Proof step 39 from proof inv-write-inode (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 40:

  fs0[ri[key]].key = key, fs0[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, fs0[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, ro, fi, fo, log0), key ∈ ri, ri[key] ∈ fs0, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, key.dentry? → fs0[ri[key]].dentry? ∧ inodekey(key.ino) ∈ ri ∧ inodekey(fs0[ri[key]].ino) ∈ ri ∧ ¬ inodekey(key.ino) ∈ ro ∧ ¬ inodekey(fs0[ri[key]].ino) ∈ ro ∧ fs0[ri[inodekey(key.ino)]].directory, key.data? → fs0[ri[key]].data? ∧ inodekey(key.ino) ∈ ri ∧ ¬ fs0[ri[inodekey(key.ino)]].directory ∧ # fs0[ri[key]].data = VFS_PAGE_SIZE, key.inode? → fs0[ri[key]].inode?, ¬ fs0[ri[inodekey(m)]].directory ∧ ¬ boolvar0 ∨ fs0[ri[inodekey(m)]].directory ∧ boolvar0 ∧ m2 = fs0[ri[inodekey(m)]].size ⊦ key.ino = 0, 0 = m, inodekey(m) = key, adr1 ∈ fs0, ( key.dentry? → fs0[ri[key]].dentry? ∧ inodekey(key.ino) ∈ ri ∧ inodekey(fs0[ri[key]].ino) ∈ ri ∧ ¬ inodekey(key.ino) ∈ ro ∧ ¬ inodekey(fs0[ri[key]].ino) ∈ ro ∧ (adr1 = (m = key.ino ⊃ adr1;ri[inodekey(key.ino)]) ⊃ inodenode(inodekey(m), md, boolvar0, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, m2) ;fs0[(m = key.ino ⊃ adr1;ri[inodekey(key.ino)])] ) .directory) ∧ ( key.data? → fs0[ri[key]].data? ∧ inodekey(key.ino) ∈ ri ∧ ¬ (adr1 = (m = key.ino ⊃ adr1;ri[inodekey(key.ino)]) ⊃ inodenode(inodekey(m), md, boolvar0, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, m2) ;fs0[(m = key.ino ⊃ adr1;ri[inodekey(key.ino)])] ) .directory ∧ # fs0[ri[key]].data = VFS_PAGE_SIZE)

Rule argument

Additional information