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

# links(entries1[str], dirs0) = m16 + 1, icache0[m15, mkientry(false, mkinode(m15, md7, true, m13, m14, m12))][m0, mkientry(false, mkinode(m0, md1, true, m11, m17, m2))] [entries1[str], mkientry(false, mkinode(entries1[str], md8, false, m16, 0, m)) ] [ino ] .inode = mkinode(m18, md9, boolvar, m19, m20, m21), (m0 = m15 ⊃ mkdir(m6, md2, m9, m10, entries0[str, entries[str0]]);mkdir(m6, md3, m9, m10, entries0[str, entries[str0]])) = mkdir(m2, md, m11, m17, entries3), (m0 = m15 ⊃ mkdir(m1, md6, # links(m15, dirs0), m7, entries -- str0);mkdir(m4, md4, # links(m0, dirs0), m8, entries1)) = mkdir(m6, md3, m9, m10, entries0), (m15 = m0 ⊃ mkdir(m6, md1, m9, m10, entries0[str, entries[str0]]);mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0)) = mkdir(m12, md7, m13, m14, entries2), dirs0[m15] = mkdir(m1 + 1, md6, # links(m15, dirs0), m7, entries), files0[entries[str0]] = mkfile(m3, md0, # links(entries[str0], dirs0), content), files0[entries1[str]] = mkfile(m5, md5, m16 + 1, content1), dirs0[m0] = mkdir(m4, md4, # links(m0, dirs0), m8, entries1), afs-cons (dirs0 [m15, (m15 = m0 ⊃ mkdir(m6, md3, m9, m10, entries0[str, entries[str0]]);mkdir(m1, md6, # links(m15, dirs0), m7, entries -- str0)).meta:= md2 ] [m0, mkdir(m2, md1, m11, m17, entries3) ], files0[entries1[str], mkfile(m, md8, m16, content1)]), afs-cons(dirs0, files0), icache-cons(icache0, dirs0, files0), synced(dirs0, icache0, pcache), str0 ∈ entries, entries[str0] ∈ files0, m15 ∈ dirs0, str ∈ entries1, m0 ∈ dirs0, entries1[str] ∈ files0, ino ∈ icache0[m15, mkientry(false, mkinode(m15, md7, true, m13, m14, m12))][m0, mkientry(false, mkinode(m0, md1, true, m11, m17, m2))] [entries1[str], mkientry(false, mkinode(entries1[str], md8, false, m16, 0, m)) ], m0 = m15 → md1 = md2, asynced2 → synced(files0, icache0, pcache), links(m15, dirs0) ≠ ∅ ∨ m15 = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ entries[str0] ∈ dirs0, entries1[str] ∈ dirs0, m18 = ino ∧ (icache0[m15, mkientry(false, mkinode(m15, md7, true, m13, m14, m12))][m0, mkientry(false, mkinode(m0, md1, true, m11, m17, m2))] [entries1[str], mkientry(false, mkinode(entries1[str], md8, false, m16, 0, m)) ] [ino ] .dirty ⊃ m18 ∈ files0 ∧ m19 = (m18 = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[m18]).nlink ∧ m20 = 0 ∧ ¬ boolvar ; (ino ∈ dirs0 ∨ ino ∈ files0) ∧ icache0[m15, mkientry(false, mkinode(m15, md7, true, m13, m14, m12))][m0, mkientry(false, mkinode(m0, md1, true, m11, m17, m2))] [entries1[str], mkientry(false, mkinode(entries1[str], md8, false, m16, 0, m)) ] [ino ] .inode = (m18 ∈ dirs0 ⊃ mkinode (m18, (m18 = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(m18 = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[m18])).meta, true, (m18 = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(m18 = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[m18])) .nlink, (m18 = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(m18 = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[m18])) .nsubdirs, (m18 = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(m18 = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[m18])).size) ;mkinode (m18, (m18 = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[m18]).meta, false, (m18 = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[m18]).nlink, 0, (m18 = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[m18]).size) ) ), m15 = m0 ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information