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

fs0[ri0[inodekey(m1)]] = inodenode(key0, md1, true, m3, m4, m + 1), fs0[ri0[dentrykey(m1, str)]] = dentrynode(key, m0), fs0[ri0[inodekey(m0)]] = inodenode(key1, md2, false, 1, m6, m7), links(m0, fs0, ri0) = ∅ ++ dentrykey(m1, str), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, 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), replay-safe(log0, fs0, fi ⊖ fo), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), dentrykey(m1, str) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, inodekey(m0) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(m1)] ∈ fs0, m3 ≠ 0 ∨ m1 = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = adr3, m0 = ROOT_INO, m0 = 0, m1 = 0, adr1 ∈ log0, adr2 ∈ log0, adr3 ∈ log0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m0) ∈ ro, inodekey(m1) ∈ ro, ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) ↔ key2 ∈ (ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0))) ∧ ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) → (((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0))[key2] = ((ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0)))[key2])

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Proof step 136:
fs0[ri0[inodekey(m0)]] = inodenode(key1, md2, false, 1, m6, m7), fs0[ri0[dentrykey(m1, str)]] = dentrynode(key, m0), fs0[ri0[inodekey(m1)]] = inodenode(key0, md1, true, m3, m4, m + 1), links(m0, fs0, ri0) = ∅ ++ dentrykey(m1, str), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, 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), replay-safe(log0, fs0, fi ⊖ fo), 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(m0)] ∈ fs0, inodekey(m0) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, dentrykey(m1, str) ∈ ri0, key2 ∈ (ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str), m3 ≠ 0 ∨ m1 = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, m0 = ROOT_INO, m1 = 0, inodekey(m1) ∈ ro, inodekey(m0) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr3 ∈ log0, adr2 ∈ log0, adr1 ∈ log0, ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) ↔ key2 ∈ (ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0))) ∧ ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) → (((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0))[key2] = ((ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0)))[key2])
Proof step 174:
fs0[ri0[inodekey(m0)]] = inodenode(key1, md2, false, 1, m6, m7), fs0[ri0[dentrykey(m1, str)]] = dentrynode(key, m0), fs0[ri0[inodekey(m1)]] = inodenode(key0, md1, true, m3, m4, m + 1), links(m0, fs0, ri0) = ∅ ++ dentrykey(m1, str), replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, 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), replay-safe(log0, fs0, fi ⊖ fo), 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(m0)] ∈ fs0, inodekey(m0) ∈ ri0, ri0[dentrykey(m1, str)] ∈ fs0, dentrykey(m1, str) ∈ ri0, m3 ≠ 0 ∨ m1 = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, m0 = ROOT_INO, m1 = 0, inodekey(m1) ∈ ro, inodekey(m0) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr3 ∈ log0, adr2 ∈ log0, adr1 ∈ log0, key2 ∈ (ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str), ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) ↔ key2 ∈ (ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0))) ∧ ( key2 ∈ ((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0) → (((ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)) ⊖ inodekey(m0))[key2] = ((ri0[inodekey(m1), adr1] -- dentrykey(m1, str))[inodekey(m0), adr3] ⊖ (ro ++ inodekey(m0)))[key2])

Rule argument

fma: key2 ∈ (ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)

Additional information

Used formulas: key2 ∈ (ri0[inodekey(m1), adr1] ⊖ ro) -- dentrykey(m1, str)