[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 559 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) = ∅, 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?), m1 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10, adr ∈ log0 ∨ adr = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr = adr4 ⊦ 0 = m, 0 = m8, 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), adr ∈ log0, (adr = adr4 ∨ adr = adr3 ∨ adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .inode? → (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .key .inode? ∧ (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .key .ino ≠ 0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .dentry? → (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .key .dentry?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .data? → (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .key .data?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .trunc? → (adr4 = adr ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = adr ⊃ dentrynode(dentrykey(m, str0), m8);(adr1 = adr ⊃ dentrynode(dentrykey(m, str0), 0);fs0[adr])) ) ) .key .inode?)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information