[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 554 from proof inv-rename-overwrite-keep-parent (previous step)

fs0[ri0[inodekey(m8)]] = inodenode(key1, md0, boolvar0, m0, m9, m10), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key0, m8), fs0[ri0[inodekey(m)]] = inodenode(key2, md2, true, m1, m2, m4), adr = adr4, fs = fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], fs1 = fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], key = inodekey(m8), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', log1 = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', nd = inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6), ri = ri1[key, adr], ri1 = ri0[dentrykey(m, str0), adr2][inodekey(m), adr3], mkdentry(str0, m8).dentry?, nd.inode?, inodenode(inodekey(m), md, true, m1, m2, m4).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-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m8) ∈ ri0, ri0[dentrykey(m, str0)] ∈ fs0, ri0[inodekey(m8)] ∈ fs0, 1 ≤ m4, boolvar3 → 1 ≤ m2, m0 = 1 → links(m8, fs0, ri0) = ∅ ++ dentrykey(m, str0), boolvar0 → dentrykeys(inodekey(m8), ri0) = ∅, nd.trunc? ∨ nd.inode?, m1 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10, inodenode(inodekey(m), md, true, m1, m2, m4).trunc? ∨ inodenode(inodekey(m), md, true, m1, m2, m4).inode? ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m0 = 0, m4 = 0, m8 = ROOT_INO, inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str0), ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 555:
fs0[ri0[inodekey(m)]] = inodenode(key2, md2, true, m1, m2, m4), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key0, m8), fs0[ri0[inodekey(m8)]] = inodenode(key1, md0, boolvar0, m0, m9, m10), 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), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m8)] ∈ fs0, ri0[dentrykey(m, str0)] ∈ fs0, inodekey(m8) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, 1 ≤ m4, boolvar0 → dentrykeys(inodekey(m8), ri0) = ∅, m0 = 1 → links(m8, fs0, ri0) = ∅ ++ dentrykey(m, str0), boolvar3 → 1 ≤ m2, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, m1 ≠ 0 ∨ m = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m0 = 0, m4 = 0, m8 = ROOT_INO, adr2 ∈ ri0 -- dentrykey(m, str0), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro, ubifs-cons (fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], ri0[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m8), adr4], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], ri0[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m8), adr4], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ file-node-cons (fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], ri0[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m8), adr4]) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m, str0), 0)][adr2, dentrynode(dentrykey(m, str0), m8)][adr3, inodenode(inodekey(m), md, true, m1, m2, m4)] [adr4, inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ], ri0[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m8), adr4], ro)

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)