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

# buf-opt.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m3 % VFS_PAGE_SIZE, fs0[ri0[inodekey(m)]] = inodenode(key, md, false, m0, m1, m2), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, 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), replay-safe(log0, fs0, fi ⊖ fo), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, m3 ≤ n1, key0.data? → ¬ inodekey(key0.ino) ∈ ro, key0 = datakey(m, m3 / VFS_PAGE_SIZE) ∨ key0 ∈ ri0, key0 ≠ datakey(key0.ino, m3 / VFS_PAGE_SIZE) ∧ ¬ key0 ∈ ri0 ∨ ¬ key0.data? ∨ key0.ino ≠ m ∨ ¬ m3 ≤ key0.part * VFS_PAGE_SIZE ⊦ m3 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, key0 ∈ ( inodekey(m) ∈ (m0 ≠ 0 ∨ m = ROOT_INO ⊃ (ri0 \ datakeys(inodekey(m), m3, ri0))[inodekey(m), adr2] ⊖ ro ;((ri0 \ datakeys(inodekey(m), m3, ri0)) ⊖ ro) ⊖ inodekey(m) ) ⊃ (m0 ≠ 0 ∨ m = ROOT_INO ⊃ (ri0 \ datakeys(inodekey(m), m3, ri0))[inodekey(m), adr2] ⊖ ro ;((ri0 \ datakeys(inodekey(m), m3, ri0)) ⊖ ro) ⊖ inodekey(m) ) [datakey(m, m3 / VFS_PAGE_SIZE), adr3 ] ;(m0 ≠ 0 ∨ m = ROOT_INO ⊃ (ri0 \ datakeys(inodekey(m), m3, ri0))[inodekey(m), adr2] ⊖ ro ;((ri0 \ datakeys(inodekey(m), m3, ri0)) ⊖ ro) ⊖ inodekey(m) ) ), inodekey(m) ∈ ro, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, adr3 ∈ log0, adr2 ∈ log0, adr1 ∈ log0, key0 ∈ ro, m0 = 0 ∧ m ≠ ROOT_INO

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 6

Additional information