[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 100 from proof eq-io-evict (previous step)

⟨if files[ino].nlink = 0 then files := files -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, dirs1[m] = mkdir(m5, md1, m6, m7, entries), files1[m] = mkfile(m3, md0, m4, content), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, boolvar, m0, m1, m2), pre-evict(inode, dirs, files) ⊦ ino ∈ dirs, (m ∈ dirs1 ∧ m0 = m6 ∧ m2 = m5 ∧ m1 = m7 ∧ boolvar ∨ m ∈ files1 ∧ m0 = m4 ∧ m1 = 0 ∧ ¬ boolvar) ∧ m ≠ ROOT_INO

Heuristic conditional left split applied rule if left

And obtained the following new goals

Proof step 101:
⟨files := files -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), files[ino].nlink = 0, asynced ↔ asynced0, files1[m] = mkfile(m3, md0, m4, content), dirs1[m] = mkdir(m5, md1, m6, m7, entries), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, boolvar, m0, m1, m2), pre-evict(inode, dirs, files) ⊦ ino ∈ dirs, (m ∈ dirs1 ∧ m0 = m6 ∧ m2 = m5 ∧ m1 = m7 ∧ boolvar ∨ m ∈ files1 ∧ m0 = m4 ∧ m1 = 0 ∧ ¬ boolvar) ∧ m ≠ ROOT_INO
Proof step 102:
⟨skip⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, files1[m] = mkfile(m3, md0, m4, content), dirs1[m] = mkdir(m5, md1, m6, m7, entries), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, boolvar, m0, m1, m2), pre-evict(inode, dirs, files) ⊦ files[ino].nlink = 0, ino ∈ dirs, (m ∈ dirs1 ∧ m0 = m6 ∧ m2 = m5 ∧ m1 = m7 ∧ boolvar ∨ m ∈ files1 ∧ m0 = m4 ∧ m1 = 0 ∧ ¬ boolvar) ∧ m ≠ ROOT_INO

Proof step 100 from proof eq-io-evict (previous step)

Heuristic conditional left split applied rule if left

And obtained the following new goals

Rule argument

Additional information