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

(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), (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] = 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] ⊃ mkdir(m13, md, m12, m15, entries3) ;(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), icache0[ino] = mkientry(boolvar2, mkinode(m28, md12, boolvar1, m29, m30, m31)), 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), icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))][ino] = mkientry(boolvar0, mkinode(m24, md11, boolvar, m25, m26, m27)), afs-cons(dirs0, files), 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, mkdir(m, md9, m19, m20, entries5) ] [entries2[str], mkdir(m21, md, m22, m23, entries6) ], files), synced(dirs0, icache0, pcache), entries0[str0] ∈ dirs0, entries2[str] ∈ dirs0, str0 ∈ entries0, m18 ∈ dirs0, str ∈ entries2, m0 ∈ dirs0, ino ∈ icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))], ino ∈ icache0 → m28 = ino ∧ (boolvar2 ⊃ ino ∈ files ∧ m29 = files[ino].nlink ∧ m30 = 0 ∧ ¬ boolvar1 ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md12, boolvar1, m29, m30, m31) = (ino ∈ dirs0 ⊃ mkinode(ino, dirs0[ino].meta, true, dirs0[ino].nlink, dirs0[ino].nsubdirs, dirs0[ino].size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) ), m0 = m18 → md1 = md2, asynced2 → synced(files, icache0, pcache), ∀ ino0. ino0 ∈ icache0 → icache0[ino0].inode.ino = ino0 ∧ (icache0[ino0].dirty ⊃ icache0[ino0].inode.ino ∈ files ∧ icache0[ino0].inode.nlink = files[icache0[ino0].inode.ino].nlink ∧ icache0[ino0].inode.nsubdirs = 0 ∧ ¬ icache0[ino0].inode.directory ; (ino0 ∈ dirs0 ∨ ino0 ∈ files) ∧ icache0[ino0].inode = (icache0[ino0].inode.ino ∈ dirs0 ⊃ mkinode (icache0[ino0].inode.ino, dirs0[icache0[ino0].inode.ino].meta, true, dirs0[icache0[ino0].inode.ino].nlink, dirs0[icache0[ino0].inode.ino].nsubdirs, dirs0[icache0[ino0].inode.ino].size) ;mkinode (icache0[ino0].inode.ino, files[icache0[ino0].inode.ino].meta, false, files[icache0[ino0].inode.ino].nlink, 0, files[icache0[ino0].inode.ino].size) ) ), links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ entries2[str] = m0, entries2[str] = ROOT_INO, ino = m0, ino = entries2[str], m18 = m0 ∧ mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0]), m24 = ino ∧ (boolvar0 ⊃ ino ∈ files ∧ m25 = files[ino].nlink ∧ m26 = 0 ∧ ¬ boolvar ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md11, boolvar, m25, m26, m27) = (ino ∈ dirs0 ⊃ mkinode (ino, (ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]).meta, true, (ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]).nlink, (ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]).nsubdirs, (ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]).size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) )

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: ino = m18

Additional information

Used simplifier rules: ⊦ ino ≠ ino0 → icache[ino0, ie][ino] = icache[ino]; (s)% ⊦ ino ≠ ino0 → (ino ∈ icache[ino0, ie] ↔ ino ∈ icache); (s)%⊦ mkientry(boolvar, inode) = mkientry(boolvar0, inode0) ↔ (boolvar ↔ boolvar0) ∧ inode = inode0; (ws)%⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)% ⊦ icache[ino, ie][ino] = ie; (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ ino ∈ icache[ino, ie]; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)%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 Used formulas: ino = m18