[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 648 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), 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) = ∅, m1 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10 ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m0 = 0, m4 = 0, m8 = ROOT_INO, 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]), inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 649:
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, inodekey(ino) ∈ ri0, 1 ≤ m4, boolvar0 → dentrykeys(inodekey(m8), ri0) = ∅, m0 = 1 → links(m8, fs0, ri0) = ∅ ++ dentrykey(m, str0), boolvar3 → 1 ≤ m2, ¬ fs0[ri0[inodekey(ino)]].directory → fs0[ri0[inodekey(ino)]].nsubdirs = 0, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, m1 ≠ 0 ∨ m = ROOT_INO ⊦ (adr4 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), 0) ;fs0[(m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)]))] ) ) ) ) .nsubdirs = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m0 = 0, m4 = 0, m8 = ROOT_INO, (adr4 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), 0) ;fs0[(m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)]))] ) ) ) ) .directory, adr2 ∈ ri0 -- dentrykey(m, str0), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro

Rule argument

Additional information

Used simplifier rules: in-ri: ⊦ key0 ∈ ri[key1, adr] ↔ key0 = key1 ∨ key0 ∈ ri;%at-ri: ⊦ ri[key0, adr][key1] = (key0 = key1 ⊃ adr;ri[key1]);%at-fs: ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]);% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)%⊦ file-node-cons(fs, ri) → ( file-node-cons(fs0, ri0) ↔ (∀ ino. ( inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nsubdirs = 0) → inodekey(ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(ino)]].directory → fs0[ri0[inodekey(ino)]].nsubdirs = 0)); (ss)