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

icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))][m0, mkientry(false, mkinode(m0, md9, true, m19, m20, m))] [entries2[str], mkientry(false, mkinode(entries2[str], md, true, m22, m23, m21)) ] [ino ] .inode = mkinode(m24, md11, boolvar, m25, m26, m27), (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), (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), (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), (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 ⊃ (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), dirs0[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m6, md5, # links(entries2[str], dirs0), m9, ∅), dirs0[m0] = mkdir(m4, md3, # links(m0, dirs0), m7, entries2), dirs0[m18] = mkdir(m1 + 1, md0, # links(m18, dirs0), m2 + 1, entries0), 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, (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), icache-cons(icache0, dirs0, files), synced(dirs0, icache0, pcache), m0 ∈ dirs0, str ∈ entries2, m18 ∈ dirs0, str0 ∈ entries0, entries2[str] ∈ dirs0, entries0[str0] ∈ dirs0, ino ∈ icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))][m0, mkientry(false, mkinode(m0, md9, true, m19, m20, m))] [entries2[str], mkientry(false, mkinode(entries2[str], md, true, m22, m23, m21)) ], asynced2 → synced(files, icache0, pcache), m0 = m18 → md1 = md2, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO ⊦ entries2[str] = ROOT_INO, m18 = m0 ∧ mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0]), m24 = ino ∧ (icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))][m0, mkientry(false, mkinode(m0, md9, true, m19, m20, m))] [entries2[str], mkientry(false, mkinode(entries2[str], md, true, m22, m23, m21)) ] [ino ] .dirty ⊃ 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 = entries2[str] ⊃ mkdir(m21, md, m22, m23, entries6) ;(ino = m0 ⊃ (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 ;(ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]) ) ) .meta, true, (ino = entries2[str] ⊃ mkdir(m21, md, m22, m23, entries6) ;(ino = m0 ⊃ (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 ;(ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]) ) ) .nlink, (ino = entries2[str] ⊃ mkdir(m21, md, m22, m23, entries6) ;(ino = m0 ⊃ (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 ;(ino = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);dirs0[ino]) ) ) .nsubdirs, (ino = entries2[str] ⊃ mkdir(m21, md, m22, m23, entries6) ;(ino = m0 ⊃ (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 ;(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 elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: icache-entry name: elim seq: ⊦ (boolvar ↔ ie.dirty) ∧ inode = ie.inode ↔ ie = mkientry(boolvar, inode) subst: [ie, boolvar, inode] → [icache0 [m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14)) ] [m0, mkientry(false, mkinode(m0, md9, true, m19, m20, m)) ] [entries2[str], mkientry (false, mkinode(entries2[str], md, true, m22, m23, m21)) ] [ino ], boolvar0, inode]

Additional information

Used simplifier rules: ⊦ (boolvar ↔ ie.dirty) ∧ inode = ie.inode ↔ ie = mkientry(boolvar, inode); (elim) Used terms: icache0[m18, mkientry(false, mkinode(m18, md8, true, m16, m17, m14))] [m0, mkientry(false, mkinode(m0, md9, true, m19, m20, m)) ] [entries2[str], mkientry(false, mkinode(entries2[str], md, true, m22, m23, m21)) ] [ino ], boolvar0, inode