[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 245 from proof inv-rename-dir-dentry (previous step)

(entries2[str] = m0 ⊃ (entries2[str] = m18 ⊃ mkdir(m13, md2, m12, m15, entries3);mkdir(m13, md7, m12, m15, entries3)).meta:= md1 ;(entries2[str] = m18 ⊃ mkdir(m13, md2, m12, m15, entries3);mkdir(m13, md7, m12, m15, entries3)) ) = mkdir(m21, md10, m22, m23, entries6), (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), (entries2[str] = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]) ;(entries2[str] = m18 ⊃ mkdir(m1, md0, # links(entries2[str], dirs0), m2, entries0 -- str0) ;mkdir(m6, md5, # links(entries2[str], dirs0), m9, ∅) ) ) = mkdir(m13, md7, m12 + 1, m15, entries3), (m18 = entries2[str] ⊃ (entries2[str] = m0 ⊃ mkdir(m13, md1, m12, m15, entries3);mkdir(m13, md2, m12, m15, entries3)).meta:= md ;(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 = entries2[str] ⊃ (entries2[str] = m18 ⊃ mkdir(m13, md2, m12, m15, entries3);mkdir(m13, md7, m12, m15, entries3)).meta:= md1.meta:= md ;(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), dirs0[m18] = mkdir(m1 + 1, md0, # links(m18, dirs0), m2 + 1, entries0), dirs0[m0] = mkdir(m4, md3, # links(m0, dirs0), m7, entries2), dirs0[entries2[str]] = mkdir(m6, md5, # links(entries2[str], dirs0), m9, ∅), dirs0[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], dirs0), m5, entries), afs-cons (dirs0 [m18, (m18 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3) ;(m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)) ) .meta:= md2 ] [m0, (m0 = m18 ⊃ (m18 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md2 ;(m0 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])) ) .meta:= md1 ] [entries2[str], mkdir(m21, md, m22, m23, entries6) ], files), afs-cons(dirs0, files), dcache-cons(dcache0, dirs0, files), synced(dirs0, icache0, pcache), entries0[str0] ∈ dirs0, entries2[str] ∈ dirs0, str0 ∈ entries0, m18 ∈ dirs0, str ∈ entries2, m0 ∈ dirs0, m0 = m18 → md1 = md2, asynced2 → synced(files, icache0, pcache), links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ entries2[str] = ROOT_INO, ∀ key. key ∈ (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])] → key.dentry? ∧ key.name = (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key].name ∧ valid-dentry (key.ino, (dcache0 -- dentrykey(m18, str0))[dentrykey(m0, str), mkdentry(str, entries0[str0])][key], dirs0 [m18, (m18 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3) ;(m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)) ) .meta:= md2 ] [m0, (m0 = m18 ⊃ (m18 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md2 ;(m0 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])) ) .meta:= md1 ] [entries2[str], mkdir(m21, md, m22, m23, entries6) ], files), 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).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)