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

1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nlink, dentrykeys(inodekey(fs0[ri0[dentrykey(m0, str)]].ino), ri0) = ∅, fs = fs0[adr1, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1)] [adr2, dentrynode(dentrykey(m0, str), 0) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) ], key = inodekey(fs0[ri0[dentrykey(m0, str)]].ino), links(fs0[ri0[dentrykey(m0, str)]].ino, fs0, ri0) = ∅ ++ dentrykey(m0, str), log = ((log0 + adr1 ') + adr2 ') + adr3 ', ri = (ri0[inodekey(m0), adr1] -- dentrykey(m0, str))[inodekey(fs0[ri0[dentrykey(m0, str)]].ino), adr3], fs0[ri0[dentrykey(m0, str)]].dentry?, fs0[ri0[inodekey(m0)]].directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].directory, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) .inode?, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].inode?, fs0[ri0[inodekey(m0)]].inode?, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1).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), dentrykey(m0, str) ∈ ri0, inodekey(fs0[ri0[dentrykey(m0, str)]].ino) ∈ ri0, inodekey(m0) ∈ ri0, ri0[dentrykey(m0, str)] ∈ fs0, ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)] ∈ fs0, ri0[inodekey(m0)] ∈ fs0, 1 ≤ fs0[ri0[inodekey(m0)]].size, 1 ≤ fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size ≥ 1, fs0[ri0[inodekey(m0)]].nsubdirs ≥ 1, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) .trunc? ∨ inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) .inode?, fs0[ri0[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].trunc? ∨ fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].inode?, fs0[ri0[inodekey(m0)]].trunc? ∨ fs0[ri0[inodekey(m0)]].inode?, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1).trunc? ∨ inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1).inode? ⊦ fs0[ri0[dentrykey(m0, str)]].ino = 0, fs0[ri0[dentrykey(m0, str)]].ino = ROOT_INO, fs0[ri0[inodekey(m0)]].nsubdirs = 0, fs0[ri0[inodekey(m0)]].size = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, inodekey(fs0[ri0[dentrykey(m0, str)]].ino) ∈ ro, inodekey(m0) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, ubifs-cons (fs0[adr1, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1)] [adr2, dentrynode(dentrykey(m0, str), 0) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) ], (ri0[inodekey(m0), adr1] -- dentrykey(m0, str))[inodekey(fs0[ri0[dentrykey(m0, str)]].ino), adr3], ro ++ key, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs0[adr1, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1)] [adr2, dentrynode(dentrykey(m0, str), 0) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) ], (ri0[inodekey(m0), adr1] -- dentrykey(m0, str))[inodekey(fs0[ri0[dentrykey(m0, str)]].ino), adr3], ro ++ key, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs0[adr1, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1)] [adr2, dentrynode(dentrykey(m0, str), 0) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) ], (ri0[inodekey(m0), adr1] -- dentrykey(m0, str))[inodekey(fs0[ri0[dentrykey(m0, str)]].ino), adr3]) ∧ orphans-cons (fs0[adr1, inodenode(inodekey(m0), md0, true, fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m0)]].nsubdirs - 1, fs0[ri0[inodekey(m0)]].size - 1)] [adr2, dentrynode(dentrykey(m0, str), 0) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(m0, str)]].ino), md, true, 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].nsubdirs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m0, str)]].ino)]].size) ], (ri0[inodekey(m0), adr1] -- dentrykey(m0, str))[inodekey(fs0[ri0[dentrykey(m0, str)]].ino), adr3], ro ++ key)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)