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

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

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 384:
m = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, VFS_PAGE_SIZE = n0 + m4 % VFS_PAGE_SIZE, fs0[ri0[datakey(m0, m4 / VFS_PAGE_SIZE)]] = datanode(datakey(m0, m4 / VFS_PAGE_SIZE), buf0), fs0[ri0[inodekey(m0)]] = inodenode(key, md, false, m, m1, m2), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, ro.inodes?, fo.inodes?, 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-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m0) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m0, m4 / VFS_PAGE_SIZE)] ∈ fs0, m4 ≤ n1 ⊦ m4 % VFS_PAGE_SIZE = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, buf-opt.some?, adr1 ∈ log0, adr2 ∈ log0, adr3 ∈ log0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr3 ∈ ri0, inodekey(m0) ∈ ro, ¬ adr2 ∈ (ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro) ∧ ¬ adr3 ∈ (m ≠ 0 ∨ m0 = ROOT_INO ⊃ ((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro))[inodekey(m0), adr2] ;((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro)) ⊖ inodekey(m0) ) ∧ ( inodekey(m0) ∈ (m ≠ 0 ∨ m0 = ROOT_INO ⊃ ((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro))[inodekey(m0), adr2] ;((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro)) ⊖ inodekey(m0) ) ⊃ (m ≠ 0 ∨ m0 = ROOT_INO ⊃ ((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro))[inodekey(m0), adr2] ;((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro)) ⊖ inodekey(m0) ) [datakey(m0, m4 / VFS_PAGE_SIZE), adr3 ] ;(m ≠ 0 ∨ m0 = ROOT_INO ⊃ ((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro))[inodekey(m0), adr2] ;((ri0 ⊖ ro) \ datakeys(inodekey(m0), m4, ri0 ⊖ ro)) ⊖ inodekey(m0) ) ) = ( ri0[datakey(m0, m4 / VFS_PAGE_SIZE), adr3][inodekey(m0), adr2] \ datakeys(inodekey(m0), m4, ri0[datakey(m0, m4 / VFS_PAGE_SIZE), adr3][inodekey(m0), adr2])) ⊖ ro

Rule argument

fma: inodekey(m0) ∈ ro

Additional information

Used simplifier rules: ⊦ ro.inodes? ∧ key ∈ ro → datakeys(key, n, ri ⊖ ro) = ∅; (s)% ⊦ ri \ ∅ = ri; (s)% ⊦ ¬ adr ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ adr ∈ ri ⊖ ks; (s)% ⊦ inodekey(m) ∈ ks → (ri ⊖ ks) ⊖ inodekey(m) = ri ⊖ ks; (s)%⊦ inodekey(ino) ∈ ri → (inodekey(ino) ∈ ri ⊖ ro ↔ ¬ inodekey(ino) ∈ ro); (s)% ⊦ key ∈ ro → (ri \ datakeys(key, n, ri)) ⊖ ro = ri ⊖ ro; (s)% ⊦ inodekey(m) ∈ ks → ri[inodekey(m), adr] ⊖ ks = ri ⊖ ks; (s)% ⊦ inodekey(ino) ∈ ro → ri[datakey(ino, n), adr] ⊖ ro = ri ⊖ ro; (s) Used formulas: inodekey(m0) ∈ ro