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

⟨if dirs[ino].nlink = 0 then dirs := dirs -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, files1[m] = mkfile(m0, md0, 0, content), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, false, 0, 0, m2), pre-evict(inode, dirs, files), m ∈ files1, ino ∈ dirs ⊦ m = ROOT_INO, m ∈ dirs1, ESUCCESS = err0 ∧ dirs1 = dirs0 ∧ files1 -- m = files0

Heuristic conditional left split applied rule if left

And obtained the following new goals

Proof step 62:
⟨dirs := dirs -- ino⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), dirs[ino].nlink = 0, asynced ↔ asynced0, files1[m] = mkfile(m0, md0, 0, content), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, false, 0, 0, m2), pre-evict(inode, dirs, files), ino ∈ dirs, m ∈ files1 ⊦ m = ROOT_INO, m ∈ dirs1, ESUCCESS = err0 ∧ dirs1 = dirs0 ∧ files1 -- m = files0
Proof step 63:
⟨skip⟩ (ESUCCESS = err0 ∧ dirs = dirs0 ∧ files = files0), asynced ↔ asynced0, files1[m] = mkfile(m0, md0, 0, content), dirs = dirs1, files = files1, ino = inode.ino, inode = mkinode(m, md, false, 0, 0, m2), pre-evict(inode, dirs, files), ino ∈ dirs, m ∈ files1 ⊦ dirs[ino].nlink = 0, m = ROOT_INO, m ∈ dirs1, ESUCCESS = err0 ∧ dirs1 = dirs0 ∧ files1 -- m = files0

Proof step 61 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