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

fs0[ri0[dentrykey(ino, str)]].ino = fs0[ri0[dentrykey(ino0, str)]].ino, fs0[ri0[dentrykey(ino0, str)]].dentry?, fs0[ri0[inodekey(ino0)]].directory, fs0[ri0[inodekey(m3)]].directory, fs0[ri0[inodekey(ino)]].directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].inode?, fs0[ri0[inodekey(m3)]].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(ino0, str) ∈ ri0, inodekey(m3) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino0, str)]].ino) ∈ ri0, ri0[dentrykey(ino0, str)] ∈ fs0, dentrykey(ino, str) ∈ ri0, inodekey(ino0) ∈ ri0, inodekey(ino) ∈ ri0, ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, fs0[ri0[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO, fs0[ri0[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, fs0[ri0[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ fs0[ri0[dentrykey(ino0, str)]].ino = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m3 = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].directory, orphans-cons (fs0[adr1, inodenode(inodekey(m3), md0, true, fs0[ri0[inodekey(m3)]].nlink, fs0[ri0[inodekey(m3)]].nsubdirs, fs0[ri0[inodekey(m3)]].size + 1)] [adr2, dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ] [adr3, inodenode (inodekey(fs0[ri0[dentrykey(ino0, str)]].ino), md, false, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink + 1, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) ], ri0[inodekey(m3), adr1][dentrykey(m3, str0), adr2][inodekey(fs0[ri0[dentrykey(ino0, str)]].ino), adr3], ro), inodekey(ino0) ∈ ro, inodekey(m3) ∈ ro, dentrykey(m3, str0) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino0, 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 121:
fs0[ri0[dentrykey(ino, str)]].ino = fs0[ri0[dentrykey(ino0, str)]].ino, fs0[ri0[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, fs0[ri0[dentrykey(ino0, str)]].dentry?, fs0[ri0[inodekey(ino)]].directory, fs0[ri0[inodekey(m3)]].directory, fs0[ri0[inodekey(ino0)]].directory, fs0[ri0[inodekey(m3)]].inode?, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].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), ri0[inodekey(m3)] ∈ fs0, ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)] ∈ fs0, inodekey(ino) ∈ ri0, inodekey(ino0) ∈ ri0, dentrykey(ino, str) ∈ ri0, ri0[dentrykey(ino0, str)] ∈ fs0, inodekey(fs0[ri0[dentrykey(ino0, str)]].ino) ∈ ri0, inodekey(m3) ∈ ri0, dentrykey(ino0, str) ∈ ri0, inodekey(ino1) ∈ ri0, fs0[ri0[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, fs0[ri0[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, fs0[ri0[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO ⊦ fs0[ri0[dentrykey(ino0, str)]].ino = 0, (adr3 = (fs0[ri0[dentrykey(ino0, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode (inodekey(fs0[ri0[dentrykey(ino0, str)]].ino), md, false, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink + 1, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) ;(adr2 = (fs0[ri0[dentrykey(ino0, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ;(adr1 = (fs0[ri0[dentrykey(ino0, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)])) ⊃ inodenode(inodekey(m3), md0, true, fs0[ri0[inodekey(m3)]].nlink, fs0[ri0[inodekey(m3)]].nsubdirs, fs0[ri0[inodekey(m3)]].size + 1) ;fs0[(fs0[ri0[dentrykey(ino0, str)]].ino = ino1 ⊃ adr3;(m3 = ino1 ⊃ adr1;ri0[inodekey(ino1)]))] ) ) ) .nlink = 0 ∧ ino1 ≠ ROOT_INO ↔ inodekey(ino1) ∈ ro, adr1 = adr2, adr1 = adr3, adr2 = adr3, m3 = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(ino) ∈ ro, inodekey(fs0[ri0[dentrykey(ino0, str)]].ino) ∈ ro, dentrykey(m3, str0) ∈ ri0, inodekey(m3) ∈ ro, inodekey(ino0) ∈ ro

Rule argument

Additional information

Used simplifier rules: in-ri: ⊦ key0 ∈ ri[key1, adr] ↔ key0 = key1 ∨ key0 ∈ ri;%at-ri: ⊦ ri[key0, adr][key1] = (key0 = key1 ⊃ adr;ri[key1]);%at-fs: ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]);% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)%⊦ orphans-cons(fs, ri, ro) → ( orphans-cons(fs0, ri0, ro0) ↔ (∀ ino. ( inodekey(ino) ∈ ri → ( fs[ri[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO ↔ inodekey(ino) ∈ ro)) → inodekey(ino) ∈ ri0 → ( fs0[ri0[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO ↔ inodekey(ino) ∈ ro0))); (ss)