[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 117 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(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(ino1)]].directory → fs0[ri0[inodekey(ino1)]].nsubdirs = 0, 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 = ino1, fs0[ri0[dentrykey(ino0, str)]].ino = 0, (adr2 = ri0[inodekey(ino1)] ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ;(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[ri0[inodekey(ino1)]] ) ) .nsubdirs = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, adr3 = ri0[inodekey(ino1)], m3 = ino1, m3 = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].directory, (adr2 = ri0[inodekey(ino1)] ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ;(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[ri0[inodekey(ino1)]] ) ) .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

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 118:
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), inodekey(ino1) ∈ ri0, 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(ino1)]].directory → fs0[ri0[inodekey(ino1)]].nsubdirs = 0, 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, fs0[ri0[dentrykey(ino0, str)]].ino = ino1, (adr2 = ri0[inodekey(ino1)] ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ;(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[ri0[inodekey(ino1)]] ) ) .nsubdirs = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, adr2 = ri0[inodekey(ino1)], adr3 = ri0[inodekey(ino1)], m3 = 0, m3 = ino1, (adr2 = ri0[inodekey(ino1)] ⊃ dentrynode(dentrykey(m3, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ;(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[ri0[inodekey(ino1)]] ) ) .directory, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].directory, 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

Rule argument

fma: adr2 = ri0[inodekey(ino1)]

Additional information

Used simplifier rules: ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss) Used formulas: adr2 = ri0[inodekey(ino1)]