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

m5 + 1 = fs0[ri0[inodekey(m1)]].nlink, 0 = fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[dentrykey(m, str)]] = dentrynode(key, m1), fs0[ri0[inodekey(m)]] = inodenode(key0, md1, true, m2, m3, m0 + 1), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons (abs-dirs(fs0, ri0)[m, mkdir(m0, md, m2, m3, abs-children(m, fs0, ri0) -- str)], abs-files(fs0, ri0)[m1, mkfile(m6, md0, m5, abs-content(m1, fs0, ri0))]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]), file-node-cons(fs0, ri0), log-cons(log0, fs0), log-cons (log0, fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ri-inj((ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri0[inodekey(m)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, dentrykey(m, str) ∈ ri0, inodekey(m) ∈ ri0, asynced0 → boolvar0, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO, m2 ≠ 0 ∨ m = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, m1 = 0, m1 = ROOT_INO, m5 = 0, str0 = str, fs0[ri0[inodekey(m1)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, (dentrykey(m, str0) ∈ ri0 ↔ dentrykey(m, str0) ∈ (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]) ∧ ( dentrykey(m, str0) ∈ ri0 → fs0[ri0[dentrykey(m, str0)]].ino = (adr3 = ri0[dentrykey(m, str0)] ⊃ inodenode(inodekey(m1), md0, false, m5, 0, m6) ;(adr2 = ri0[dentrykey(m, str0)] ⊃ dentrynode(dentrykey(m, str), 0) ;(adr1 = ri0[dentrykey(m, str0)] ⊃ inodenode(inodekey(m), md, true, m2, m3, m0);fs0[ri0[dentrykey(m, str0)]]) ) ) .ino)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 379:
m5 + 1 = fs0[ri0[inodekey(m1)]].nlink, 0 = fs0[ri0[inodekey(m1)]].nsubdirs, fs0[ri0[inodekey(m)]] = inodenode(key0, md1, true, m2, m3, m0 + 1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key, m1), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m, mkdir(m0, md, m2, m3, abs-children(m, fs0, ri0) -- str)], abs-files(fs0, ri0)[m1, mkfile(m6, md0, m5, abs-content(m1, fs0, ri0))]), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]), log-cons (log0, fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)]), log-cons(log0, fs0), orphans-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, m5, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, dentrykey(m, str) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[inodekey(m)] ∈ fs0, dentrykey(m, str0) ∈ ri0, asynced0 → boolvar0, m2 ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, m1 = ROOT_INO, m1 = 0, m5 = 0, str0 = str, fs0[ri0[inodekey(m1)]].directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, (dentrykey(m, str0) ∈ ri0 ↔ dentrykey(m, str0) ∈ (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]) ∧ ( dentrykey(m, str0) ∈ ri0 → fs0[ri0[dentrykey(m, str0)]].ino = (adr3 = ri0[dentrykey(m, str0)] ⊃ inodenode(inodekey(m1), md0, false, m5, 0, m6) ;(adr2 = ri0[dentrykey(m, str0)] ⊃ dentrynode(dentrykey(m, str), 0) ;(adr1 = ri0[dentrykey(m, str0)] ⊃ inodenode(inodekey(m), md, true, m2, m3, m0);fs0[ri0[dentrykey(m, str0)]]) ) ) .ino)

Rule argument

fma: dentrykey(m, str0) ∈ ri0

Additional information

Used simplifier rules: ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (las)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ key ∈ ri -- key0 ↔ key ≠ key0 ∧ key ∈ ri; (s)% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (ws) Used formulas: dentrykey(m, str0) ∈ ri0