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

# links(entries1[str], dirs0) = m16 + 1, (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), (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), (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), dirs0[m0] = mkdir(m4, md4, # links(m0, dirs0), m8, entries1), files0[entries1[str]] = mkfile(m5, md5, m16 + 1, content1), files0[entries[str0]] = mkfile(m3, md0, # links(entries[str0], dirs0), content), dirs0[m15] = mkdir(m1 + 1, md6, # links(m15, dirs0), m7, entries), 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 ] = mkientry(boolvar0, mkinode(m18, md9, boolvar, m19, m20, m21)), afs-cons(dirs0, files0), 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)]), synced(dirs0, icache0, pcache), 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)) ], entries1[str] ∈ files0, m0 ∈ dirs0, str ∈ entries1, m15 ∈ dirs0, entries[str0] ∈ files0, str0 ∈ entries, asynced2 → synced(files0, icache0, pcache), m0 = m15 → md1 = md2, ino ∈ icache0 → icache0[ino].inode.ino = ino ∧ (icache0[ino].dirty ⊃ icache0[ino].inode.ino ∈ files0 ∧ icache0[ino].inode.nlink = files0[icache0[ino].inode.ino].nlink ∧ icache0[ino].inode.nsubdirs = 0 ∧ ¬ icache0[ino].inode.directory ; (ino ∈ dirs0 ∨ ino ∈ files0) ∧ icache0[ino].inode = (icache0[ino].inode.ino ∈ dirs0 ⊃ mkinode (icache0[ino].inode.ino, dirs0[icache0[ino].inode.ino].meta, true, dirs0[icache0[ino].inode.ino].nlink, dirs0[icache0[ino].inode.ino].nsubdirs, dirs0[icache0[ino].inode.ino].size) ;mkinode (icache0[ino].inode.ino, files0[icache0[ino].inode.ino].meta, false, files0[icache0[ino].inode.ino].nlink, 0, files0[icache0[ino].inode.ino].size) ) ), ∀ ino0. ino0 ∈ icache0 → icache0[ino0].inode.ino = ino0 ∧ (icache0[ino0].dirty ⊃ icache0[ino0].inode.ino ∈ files0 ∧ icache0[ino0].inode.nlink = files0[icache0[ino0].inode.ino].nlink ∧ icache0[ino0].inode.nsubdirs = 0 ∧ ¬ icache0[ino0].inode.directory ; (ino0 ∈ dirs0 ∨ ino0 ∈ files0) ∧ 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, files0[icache0[ino0].inode.ino].meta, false, files0[icache0[ino0].inode.ino].nlink, 0, files0[icache0[ino0].inode.ino].size) ) ), links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m15, dirs0) ≠ ∅ ∨ m15 = ROOT_INO ⊦ entries1[str] ∈ dirs0, entries[str0] ∈ dirs0, m18 = ino ∧ (boolvar0 ⊃ ino ∈ files0 ∧ m19 = (ino = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[ino]).nlink ∧ m20 = 0 ∧ ¬ boolvar ; (ino ∈ dirs0 ∨ ino ∈ files0) ∧ mkinode(ino, md9, boolvar, m19, m20, m21) = (ino ∈ dirs0 ⊃ mkinode (ino, (ino = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(ino = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[ino])).meta, true, (ino = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(ino = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[ino])) .nlink, (ino = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(ino = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[ino])) .nsubdirs, (ino = m0 ⊃ mkdir(m2, md1, m11, m17, entries3);(ino = m15 ⊃ mkdir(m1, md2, # links(m15, dirs0), m7, entries -- str0);dirs0[ino])).size) ;mkinode (ino, (ino = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[ino]).meta, false, (ino = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[ino]).nlink, 0, (ino = entries1[str] ⊃ mkfile(m, md8, m16, content1);files0[ino]).size) ) ), m15 = m0 ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: inode name: elim seq: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2) subst: [inode, m, md, boolvar, m0, m1, m2] → [icache0[ino].inode, m22, md10, boolvar1, m23, m24, m25]

Additional information

Used simplifier rules: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim) Used terms: icache0[ino].inode, m22, md10, boolvar1, m23, m24, m25