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

m3 + 1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nlink, fs0[ri0[dentrykey(m1, str)]].dentry?, fs0[ri0[inodekey(m1)]].directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].inode?, fs0[ri0[inodekey(m1)]].inode?, 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, dentrykey(m1, str) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, inodekey(fs0[ri0[dentrykey(m1, str)]].ino) ∈ ri0, ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(m1)] ∈ fs0, 1 ≤ fs0[ri0[inodekey(m1)]].size, ¬ fs0[ri0[inodekey(ino)]].directory → fs0[ri0[inodekey(ino)]].nsubdirs = 0, fs0[ri0[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ fs0[ri0[dentrykey(m1, str)]].ino = 0, fs0[ri0[dentrykey(m1, str)]].ino = ROOT_INO, fs0[ri0[dentrykey(m1, str)]].ino = ino, (adr3 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nsubdirs, m2) ;(adr2 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m1, str), 0) ;(adr1 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[inodekey(m1)]].size - 1) ;fs0[(fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)]))] ) ) ) .nsubdirs = 0, fs0[ri0[inodekey(m1)]].size = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m1 = 0, m3 = 0, (adr3 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nsubdirs, m2) ;(adr2 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m1, str), 0) ;(adr1 = (fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[inodekey(m1)]].size - 1) ;fs0[(fs0[ri0[dentrykey(m1, str)]].ino = ino ⊃ adr3;(m1 = ino ⊃ adr1;ri0[inodekey(ino)]))] ) ) ) .directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].directory, inodekey(m1) ∈ ro, inodekey(fs0[ri0[dentrykey(m1, str)]].ino) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 323:
m3 + 1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nlink, fs0[ri0[dentrykey(m1, str)]].dentry?, fs0[ri0[inodekey(m1)]].directory, fs0[ri0[inodekey(m1)]].inode?, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, 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), ri0[inodekey(m1)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)] ∈ fs0, inodekey(fs0[ri0[dentrykey(m1, str)]].ino) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, dentrykey(m1, str) ∈ ri0, inodekey(ino) ∈ ri0, 1 ≤ fs0[ri0[inodekey(m1)]].size, ¬ fs0[ri0[inodekey(ino)]].directory → fs0[ri0[inodekey(ino)]].nsubdirs = 0, fs0[ri0[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ fs0[ri0[dentrykey(m1, str)]].ino = ino, fs0[ri0[dentrykey(m1, str)]].ino = ROOT_INO, fs0[ri0[dentrykey(m1, str)]].ino = 0, (adr3 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nsubdirs, m2) ;(adr2 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m1, str), 0) ;(adr1 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[inodekey(m1)]].size - 1) ;fs0[(m1 = ino ⊃ adr1;ri0[inodekey(ino)])] ) ) ) .nsubdirs = 0, fs0[ri0[inodekey(m1)]].size = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m1 = 0, m3 = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].directory, (adr3 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(fs0[ri0[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri0[inodekey(fs0[ri0[dentrykey(m1, str)]].ino)]].nsubdirs, m2) ;(adr2 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m1, str), 0) ;(adr1 = (m1 = ino ⊃ adr1;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m1), md0, true, fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[inodekey(m1)]].size - 1) ;fs0[(m1 = ino ⊃ adr1;ri0[inodekey(ino)])] ) ) ) .directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(fs0[ri0[dentrykey(m1, str)]].ino) ∈ ro, inodekey(m1) ∈ ro

Proof step 322 from proof inv-unlink (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information