[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 295 from proof inv-rename-overwrite-reparent (previous step)

¬ fs0[ri0[inodekey(m8)]].directory ↔ ¬ fs0[ri0[inodekey(m5)]].directory, fs0[ri0[inodekey(ino)]].nlink = 0 ↔ inodekey(ino) ∈ ro, 1 = fs0[ri0[inodekey(m8)]].nlink, fs0[ri0[inodekey(m)]] = inodenode(key2, md3, true, m10, n0 + (boolvar3 ⊃ 1;0), m1 + 1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key1, m5), fs0[ri0[inodekey(m0)]] = inodenode(key0, md1, true, m9, m12, m13), fs0[ri0[dentrykey(m0, str0)]] = dentrynode(key3, m8), links(m8, fs0, ri0) = ∅ ++ dentrykey(m0, str0), 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[dentrykey(m0, str0)] ∈ fs0, inodekey(m0) ∈ ri0, inodekey(m) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m8) ∈ ri0, dentrykey(m0, str0) ∈ ri0, inodekey(m5) ∈ ri0, dentrykey(m, str) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, inodekey(ino) ∈ ri0, fs0[ri0[inodekey(m8)]].directory → dentrykeys(inodekey(m8), ri0) = ∅, m9 ≠ 0 ∨ m0 = ROOT_INO, m10 ≠ 0 ∨ m = ROOT_INO, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar1 ∨ fs0[ri0[inodekey(m8)]].directory ∧ boolvar1 ∧ m7 = fs0[ri0[inodekey(m8)]].size, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar3 ∨ fs0[ri0[inodekey(m5)]].directory ∧ boolvar3 ∧ m4 = fs0[ri0[inodekey(m5)]].size ⊦ (adr5 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m8), md2, boolvar1, 0, fs0[ri0[inodekey(m8)]].nsubdirs, m7) ;(adr4 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m0), md0, true, m9, m12, m13) ;(adr3 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m), md, true, m10, n0, m1) ;(adr2 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m0, str0), m5) ;(adr1 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str), 0) ;fs0[(m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)]))] ) ) ) ) ) .nlink = 0 ↔ ino = m8 ∨ inodekey(ino) ∈ ro, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr1 = adr5, adr2 = adr3, adr2 = adr4, adr2 = adr5, adr3 = adr4, adr3 = adr5, adr4 = adr5, ino = ROOT_INO, m = 0, m0 = ino, m0 = m, m0 = 0, m8 = ROOT_INO, m8 = 0, adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], adr2 ∈ ri0 -- dentrykey(m, str), adr5 ∈ fs0, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro, inodekey(m0) ∈ ro, adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2], adr5 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3][inodekey(m0), adr4]

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 296:
fs0[ri0[inodekey(ino)]].nlink = 0 ↔ inodekey(ino) ∈ ro, ¬ fs0[ri0[inodekey(m8)]].directory ↔ ¬ fs0[ri0[inodekey(m5)]].directory, 1 = fs0[ri0[inodekey(m8)]].nlink, fs0[ri0[dentrykey(m0, str0)]] = dentrynode(key3, m8), fs0[ri0[inodekey(m0)]] = inodenode(key0, md1, true, m9, m12, m13), fs0[ri0[dentrykey(m, str)]] = dentrynode(key1, m5), fs0[ri0[inodekey(m)]] = inodenode(key2, md3, true, m10, n0 + (boolvar3 ⊃ 1;0), m1 + 1), links(m8, fs0, ri0) = ∅ ++ dentrykey(m0, str0), 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-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(ino) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, dentrykey(m, str) ∈ ri0, inodekey(m5) ∈ ri0, dentrykey(m0, str0) ∈ ri0, inodekey(m8) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m) ∈ ri0, inodekey(m0) ∈ ri0, ri0[dentrykey(m0, str0)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, fs0[ri0[inodekey(m8)]].directory → dentrykeys(inodekey(m8), ri0) = ∅, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar3 ∨ fs0[ri0[inodekey(m5)]].directory ∧ boolvar3 ∧ m4 = fs0[ri0[inodekey(m5)]].size, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar1 ∨ fs0[ri0[inodekey(m8)]].directory ∧ boolvar1 ∧ m7 = fs0[ri0[inodekey(m8)]].size, m10 ≠ 0 ∨ m = ROOT_INO, m9 ≠ 0 ∨ m0 = ROOT_INO ⊦ (adr5 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m8), md2, boolvar1, 0, fs0[ri0[inodekey(m8)]].nsubdirs, m7) ;(adr4 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m0), md0, true, m9, m12, m13) ;(adr3 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m), md, true, m10, n0, m1) ;(adr2 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m0, str0), m5) ;(adr1 = (m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str), 0) ;fs0[(m8 = ino ⊃ adr5;(m = ino ⊃ adr3;ri0[inodekey(ino)]))] ) ) ) ) ) .nlink = 0 ↔ ino = m8 ∨ inodekey(ino) ∈ ro, adr1 = adr5, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr5, adr2 = adr4, adr2 = adr3, adr3 = adr5, adr3 = adr4, adr4 = adr5, ino = ROOT_INO, m = 0, m = ino, m0 = 0, m0 = m, m0 = ino, m8 = 0, m8 = ROOT_INO, adr5 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3][inodekey(m0), adr4], adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2], inodekey(m0) ∈ ro, inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr5 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str), adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3]

Rule argument

fma: m = ino

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s) Used formulas: m = ino