[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 380 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), 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), 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) = ∅, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar1 ∧ boolvar2 ∧ m6 = m12, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, m4 ≠ 0 ∨ m = ROOT_INO ⊦ 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), adr4 ∈ log0, 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], replay-safe (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) ∧ ¬ adr3 ∈ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) ∧ ¬ adr4 ∈ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) [inodekey(m), adr3 ] ∧ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) [inodekey(m), adr3 ] [inodekey(m1), adr4 ] = (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m1), adr4] ⊖ ro

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 381:
¬ boolvar1 ↔ ¬ boolvar0, fs0[ri0[inodekey(m1)]] = inodenode(key3, md3, boolvar1, m8 + 1, m11, m12), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key4, m1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key0, m2), fs0[ri0[inodekey(m2)]] = inodenode(key1, md0, boolvar0, m5, m9, m10), 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), dentrykey(m, str) ∈ ri0, inodekey(m2) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m1) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, ri0[inodekey(m2)] ∈ fs0, inodekey(m) ∈ ri0, ri0[dentrykey(m, str0)] ∈ fs0, ri0[inodekey(m1)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, boolvar1 → dentrykeys(inodekey(m1), ri0) = ∅, m4 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar1 ∧ boolvar2 ∧ m6 = m12 ⊦ adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m = 0, m1 = ROOT_INO, m1 = 0, m8 = 0, mkdentry(str, m2) = mkdentry(str0, m1), adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2][inodekey(m), adr3], adr2 ∈ ri0 -- dentrykey(m, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro, adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2], adr4 ∈ log0, adr3 ∈ log0, replay-safe (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) ∧ ¬ adr1 ∈ replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) ∧ ¬ adr2 ∈ replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) ∧ ¬ adr3 ∈ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) ∧ ¬ adr4 ∈ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) [inodekey(m), adr3 ] ∧ (m2 ≠ 0 ⊃ ( replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) )[dentrykey(m, str0), adr2 ] ; replay-log (log0, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), 0)][adr3, inodenode(inodekey(m), md, true, m4, n0, m0)], fi ⊖ fo) -- dentrykey(m, str) -- dentrykey(m, str0) ) [inodekey(m), adr3 ] [inodekey(m1), adr4 ] = (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2][inodekey(m), adr3][inodekey(m1), adr4] ⊖ ro

Rule argument

fma: adr3 ∈ log0

Additional information

Used simplifier rules: ⊦ log-cons(log, fs) ∧ adr ∈ log → adr ∈ fs; (ss) Used formulas: adr3 ∈ log0