[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 264 from proof inv-rename-dir-dentry (previous step)

# links(entries2[str], dirs0) = m22 + 1, (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 = mkdir(m, md9, m19, m20, entries5), (key.ino = entries2[str] ⊃ mkdir(m21, md, m22, m23, ∅) ;(key.ino = m0 ⊃ (key.ino = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 ;(key.ino = m18 ⊃ mkdir(m1, md2, # links(key.ino, dirs0), m2, entries0 -- str0);mkdir(m27, md12, m28, m29, entries8)) ) ) = mkdir(m24, md11, m25, m26, entries7), (m18 = m0 ⊃ mkdir(m8, md1, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0)) = mkdir(m14, md8, m16, m17, entries4), (m0 = m18 ⊃ mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0);mkdir(m4, md3, # links(m0, dirs0), m7, entries2)) = mkdir(m8, md6, m10, m11, entries1), dirs0[key.ino] = mkdir(m27, md12, m28, m29, entries8), dirs0[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m21, md5, m22 + 1, m23, ∅), dirs0[m0] = mkdir(m4, md3, # links(m0, dirs0), m7, entries2), dirs0[m18] = mkdir(m1 + 1, md0, # links(m18, dirs0), m2 + 1, entries0), key = dentrykey(m0, str), afs-cons(dirs0, files), afs-cons (dirs0 [m18, (m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)).meta:= md2 ] [m0, mkdir(m, md9, m19, m20, entries5) ] [entries2[str], mkdir(m21, md, m22, m23, ∅) ], files), synced(dirs0, icache0, pcache), m0 ∈ dirs0, key ∈ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])], str ∈ entries2, m18 ∈ dirs0, str0 ∈ entries0, entries0[str0] ∈ dirs0, entries2[str] ∈ dirs0, asynced2 → synced(files, icache0, pcache), m0 = m18 → md1 = md2, key ∈ dcache0 → key.dentry? ∧ key.name = dcache0[key].name ∧ key.ino ∈ dirs0 ∧ (links(key.ino, dirs0) ≠ ∅ ∨ key.ino = ROOT_INO) ∧ (dcache0[key].ino ∈ dirs0 ∨ dcache0[key].ino ∈ files) ∧ dcache0[key].name ∈ entries8 ∧ dcache0[key].ino = entries8[dcache0[key].name] ∧ dcache0[key].dentry?, ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO ⊦ entries2[str] = ROOT_INO, m0 = entries2[str], m18 = entries2[str], key.dentry? ∧ key.name = (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].name ∧ key.ino ∈ dirs0 ∧ ( links (key.ino, dirs0 [m18, (m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)) .meta:= md2 ] [m0, mkdir(m, md9, m19, m20, entries5) ]) ≠ ∅ ∨ key.ino = ROOT_INO) ∧ ( (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].ino ∈ dirs0 ∨ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].ino ∈ files) ∧ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].name ∈ entries7 ∧ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].ino = entries7[(dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].name] ∧ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].dentry?, m18 = m0 ∧ mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%afs-cons-dir-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) → # links(ino, dirs) = n; (forward) from specification afs-base% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ dcache[key, dent][key] = dent; (s)% ⊦ dentrykey(m, str).name = str; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ key ∈ dcache[key, dent]; (s)% ⊦ dentrykey(m, str).ino = m; (s)