[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 126 from proof inv-link (previous step)

fs0[ri0[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, true, m, m0, m1), fs0[ri0[dentrykey(ino0, str)]] = dentrynode(key, fs0[ri0[dentrykey(ino, str)]].ino), fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, str)]].ino)]] = inodenode(key1, md2, boolvar, m4, m5, m6), ¬ boolvar, fs0[ri0[inodekey(ino0)]].directory, fs0[ri0[inodekey(ino)]].directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, str)]].ino)]].inode?, 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), inodekey(ino1) ∈ ri0, dentrykey(ino0, str) ∈ ri0, inodekey(m3) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino, str)]].ino) ∈ ri0, ri0[dentrykey(ino0, str)] ∈ fs0, dentrykey(ino, str) ∈ ri0, inodekey(ino0) ∈ ri0, inodekey(ino) ∈ ri0, ri0[inodekey(fs0[ri0[dentrykey(ino, str)]].ino)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, fs0[ri0[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO, m ≠ 0 ∨ m3 = ROOT_INO, fs0[ri0[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ fs0[ri0[dentrykey(ino, str)]].ino = 0, (adr3 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(ino, str)]].ino), md, false, m4 + 1, m5, m2) ;(adr2 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino, str)]].ino) ;(adr1 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode(inodekey(m3), md0, true, m, m0, m1 + 1) ;fs0[(fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)]))] ) ) ) .nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, adr1 = adr3, adr1 = adr2, adr2 = adr3, m3 = 0, inodekey(ino0) ∈ ro, inodekey(m3) ∈ ro, dentrykey(m3, str0) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino, str)]].ino) ∈ ro, inodekey(ino) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 127:
fs0[ri0[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, true, m, m0, m1), fs0[ri0[dentrykey(ino0, str)]] = dentrynode(key, fs0[ri0[dentrykey(ino, str)]].ino), fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, str)]].ino)]] = inodenode(key1, md2, false, m4, m5, m6), fs0[ri0[inodekey(ino0)]].directory, fs0[ri0[inodekey(ino)]].directory, 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), inodekey(ino1) ∈ ri0, dentrykey(ino0, str) ∈ ri0, inodekey(m3) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino, str)]].ino) ∈ ri0, ri0[dentrykey(ino0, str)] ∈ fs0, dentrykey(ino, str) ∈ ri0, inodekey(ino0) ∈ ri0, inodekey(ino) ∈ ri0, ri0[inodekey(fs0[ri0[dentrykey(ino, str)]].ino)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, fs0[ri0[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO, m ≠ 0 ∨ m3 = ROOT_INO, fs0[ri0[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ fs0[ri0[dentrykey(ino, str)]].ino = 0, (adr3 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(ino, str)]].ino), md, false, m4 + 1, m5, m2) ;(adr2 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino, str)]].ino) ;(adr1 = (fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode(inodekey(m3), md0, true, m, m0, m1 + 1) ;fs0[(fs0[ri0[dentrykey(ino, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)]))] ) ) ) .nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, adr1 = adr3, adr1 = adr2, adr2 = adr3, m3 = 0, inodekey(ino0) ∈ ro, inodekey(m3) ∈ ro, dentrykey(m3, str0) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino, str)]].ino) ∈ ro, inodekey(ino) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)