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

¬ boolvar1 ↔ ¬ boolvar0, fs0[ri0[inodekey(m2)]] = inodenode(key1, md0, boolvar0, m5, m9, m10), fs0[ri0[dentrykey(m, str)]] = dentrynode(key0, m2), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key4, m1), fs0[ri0[inodekey(m1)]] = inodenode(key3, md3, boolvar1, m8 + 1, m11, m12), 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-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, ri0[inodekey(m1)] ∈ fs0, ri0[dentrykey(m, str0)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m2)] ∈ fs0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m1) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m2) ∈ ri0, dentrykey(m, str) ∈ ri0, boolvar1 → dentrykeys(inodekey(m1), ri0) = ∅, adr ∈ log0 → adr ∈ fs0 ∧ (fs0[adr].inode? → fs0[adr].key.inode? ∧ fs0[adr].key.ino ≠ 0) ∧ (fs0[adr].dentry? → fs0[adr].key.dentry?) ∧ (fs0[adr].data? → fs0[adr].key.data?) ∧ (fs0[adr].trunc? → fs0[adr].key.inode?), ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar1 ∧ boolvar2 ∧ m6 = m12, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, m4 ≠ 0 ∨ m = ROOT_INO, adr ∈ log0 ∨ adr = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr = adr4 ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m = 0, m1 = 0, m1 = ROOT_INO, m8 = 0, mkdentry(str, m2) = mkdentry(str0, m1), adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2], inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str), adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2][inodekey(m), adr3], adr ∈ log0, (adr = adr4 ∨ adr = adr3 ∨ adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .inode? → (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode? ∧ (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .ino ≠ 0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .dentry? → (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .dentry?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .data? → (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .data?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .trunc? → (adr4 = adr ⊃ inodenode(inodekey(m1), md1, boolvar2, m8, m11, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m4, n0, m0) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m2);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode?)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information