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

# buf-opt.buf = VFS_PAGE_SIZE, fs0[ri0[key0]].key = key0, fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m3 % VFS_PAGE_SIZE, fs0[ri0[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, buf-opt.some?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[key0] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, key0 ∈ ri0, m3 ≤ n1, ro ⊆ dom ri0, key0.data? → fs0[ri0[key0]].data? ∧ inodekey(key0.ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(key0.ino)]].directory ∧ # fs0[ri0[key0]].data = VFS_PAGE_SIZE, 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.inode? → fs0[ri0[key0]].inode? ∧ key0.ino ≠ 0, ¬ key0.data? ∨ key0.ino ≠ m ∨ ¬ m3 ≤ key0.part * VFS_PAGE_SIZE ⊦ m3 % VFS_PAGE_SIZE = 0, key0.ino = 0, 0 = m, adr1 = adr2, adr1 = adr3, adr2 = adr3, datakey(m, m3 / VFS_PAGE_SIZE) = key0, inodekey(m) = key0, fs0[ri0[inodekey(m)]].directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, ( (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) = adr3 ∨ (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) = adr2 ∨ (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) = adr1 ∨ (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ∈ fs0) ∧ (adr3 = (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ datanode(datakey(m, m3 / VFS_PAGE_SIZE), fill(buf-opt.buf, zero, m3 % VFS_PAGE_SIZE, n0)) ;(adr2 = (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n1) ;(adr1 = (key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(m), m3) ;fs0[(key0.data? ∧ key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) ) .key = key0 ∧ ( 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 ∧ (adr3 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ datanode(datakey(m, m3 / VFS_PAGE_SIZE), fill(buf-opt.buf, zero, m3 % VFS_PAGE_SIZE, n0)) ;(adr2 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n1) ;(adr1 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ truncnode(inodekey(m), m3);fs0[(m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)])]) ) ) .directory) ∧ ( key0.data? → (adr3 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ datanode(datakey(m, m3 / VFS_PAGE_SIZE), fill(buf-opt.buf, zero, m3 % VFS_PAGE_SIZE, n0)) ;(adr2 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n1) ;(adr1 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(m), m3) ;fs0[(key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) ) .data? ∧ inodekey(key0.ino) ∈ ri0 ∧ ¬ (adr3 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ datanode(datakey(m, m3 / VFS_PAGE_SIZE), fill(buf-opt.buf, zero, m3 % VFS_PAGE_SIZE, n0)) ;(adr2 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n1) ;(adr1 = (m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)]) ⊃ truncnode(inodekey(m), m3);fs0[(m = key0.ino ⊃ adr2;ri0[inodekey(key0.ino)])]) ) ) .directory ∧ # (adr3 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ datanode(datakey(m, m3 / VFS_PAGE_SIZE), fill(buf-opt.buf, zero, m3 % VFS_PAGE_SIZE, n0)) ;(adr2 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n1) ;(adr1 = (key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0]) ⊃ truncnode(inodekey(m), m3) ;fs0[(key0.ino = m ∧ m3 ≤ key0.part * VFS_PAGE_SIZE ⊃ (∅)[key0];ri0[key0])] ) ) ) .data = VFS_PAGE_SIZE)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information