[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 592 from proof inv-truncate (previous step)

fs0[ri0[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, fs0[ri0[inodekey(m0)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, m4 ≤ n0, ro ⊆ dom ri0 ⊦ m4 % VFS_PAGE_SIZE = 0, adr1 = adr2, m0 = 0, fs0[ri0[inodekey(m0)]].directory, buf-opt.some?, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, (ro ⊆ dom ri0 → key ∈ ro → ¬ key ∈ ri0 ∨ ¬ key.data? ∨ key.ino ≠ m0 ∨ ¬ m4 ≤ key.part * VFS_PAGE_SIZE) ∧ ( ri0[key0] ∈ fs0 ∧ (key0.inode? → fs0[ri0[key0]].inode? ∧ key0.ino ≠ 0) ∧ ( key0.dentry? → fs0[ri0[key0]].dentry? ∧ inodekey(key0.ino) ∈ ri0 ∧ inodekey(fs0[ri0[key0]].ino) ∈ ri0 ∧ ¬ inodekey(key0.ino) ∈ ro ∧ ¬ inodekey(fs0[ri0[key0]].ino) ∈ ro ∧ fs0[ri0[inodekey(key0.ino)]].directory) ∧ ( key0.data? → fs0[ri0[key0]].data? ∧ inodekey(key0.ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(key0.ino)]].directory ∧ # fs0[ri0[key0]].data = VFS_PAGE_SIZE) → key0 ∈ ri0 ∧ (¬ key0.data? ∨ key0.ino ≠ m0 ∨ ¬ m4 ≤ key0.part * VFS_PAGE_SIZE) → ( (key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) = adr2 ∨ (key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) = adr1 ∨ (key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ∈ fs0) ∧ (adr2 = (key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ truncnode(inodekey(m0), m4) ;fs0[(key0.data? ∧ key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0]))] ) ) .key = key0 ∧ ( key0.inode? → (adr2 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ truncnode(inodekey(m0), m4);fs0[(inodekey(m0) = key0 ⊃ adr2;ri0[key0])]) ) .inode? ∧ key0.ino ≠ 0) ∧ ( key0.dentry? → (adr2 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ truncnode(inodekey(m0), m4);fs0[(inodekey(m0) = key0 ⊃ adr2;ri0[key0])]) ) .dentry? ∧ inodekey(key0.ino) ∈ ri0 ∧ ( (adr2 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ truncnode(inodekey(m0), m4);fs0[(inodekey(m0) = key0 ⊃ adr2;ri0[key0])]) ) .ino = m0 ∨ inodekey ((adr2 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ truncnode(inodekey(m0), m4);fs0[(inodekey(m0) = key0 ⊃ adr2;ri0[key0])]) ) .ino) ∈ ri0) ∧ ¬ inodekey(key0.ino) ∈ ro ∧ ¬ inodekey ((adr2 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (inodekey(m0) = key0 ⊃ adr2;ri0[key0]) ⊃ truncnode(inodekey(m0), m4);fs0[(inodekey(m0) = key0 ⊃ adr2;ri0[key0])]) ) .ino) ∈ ro ∧ (adr2 = (m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ truncnode(inodekey(m0), m4) ;fs0[(m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)])] ) ) .directory) ∧ ( key0.data? → (adr2 = (key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ truncnode(inodekey(m0), m4) ;fs0[(key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0]))] ) ) .data? ∧ inodekey(key0.ino) ∈ ri0 ∧ ¬ (adr2 = (m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ truncnode(inodekey(m0), m4) ;fs0[(m0 = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)])] ) ) .directory ∧ # (adr2 = (key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = (key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0])) ⊃ truncnode(inodekey(m0), m4) ;fs0[(key0.ino = m0 ∧ m4 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];(inodekey(m0) = key0 ⊃ adr2;ri0[key0]))] ) ) .data = VFS_PAGE_SIZE)) ∧ ( ( adr ∈ log0 → adr ∈ fs0 ∧ (fs0[adr].inode? → fs0[adr].key.inode? ∧ fs0[adr].key.ino ≠ 0) ∧ (fs0[adr].dentry? → fs0[adr].key.dentry?) ∧ (fs0[adr].data? → fs0[adr].key.data?) ∧ (fs0[adr].trunc? → fs0[adr].key.inode?)) → adr ∈ log0 ∨ adr = adr1 ∨ adr = adr2 → (adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .inode? → (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .key .inode? ∧ (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .key .ino ≠ 0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .dentry? → (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .key .dentry?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .data? → (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .key .data?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .trunc? → (adr2 = adr ⊃ inodenode(inodekey(m0), md0, false, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m0), m4);fs0[adr]) ) .key .inode?))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information