[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 319 from proof refine-rename-overwrite-reparent-dir (previous step)

fs0[ri0[inodekey(m11)]] = inodenode(key5, md0, true, 1, m22 + 1, m20 + 1), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m11), fs0[ri0[dentrykey(m11, str)]] = dentrynode(key4, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m1, m2, m3), fs0[ri0[inodekey(m)]] = inodenode(key, md6, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size), abs-children(m11, fs0, ri0) = ∅, dentrykeys(inodekey(m11), ri0) = ∅, links(m11, fs0, ri0) = ∅ ++ dentrykey(m7, str0), fs0[ri0[inodekey(m)]].directory, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0)[m7, mkdir(m3, md1, m1, m2, abs-children(m7, fs0, ri0)[str0, m])][m11, mkdir(m20, md, 0, m22, ∅)], abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, 1, m22, m20)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, 1, m22, m20)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ]), orphans-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, 1, m22, m20)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5], orphans(fs0, ri0) ++ inodekey(m11)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, 1, m22, m20)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5], orphans(fs0, ri0) ++ inodekey(m11), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ri-inj((ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, 1, m22, m20)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5], orphans(fs0, ri0) ++ inodekey(m11), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ri0[dentrykey(m11, str)] ∈ fs0, ri0[inodekey(m11)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, inodekey(m11) ∈ ri0, inodekey(m7) ∈ ri0, dentrykey(m11, str) ∈ ri0, dentrykey(m7, str0) ∈ ri0, boolvar2 → boolvar3, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, m1 ≠ 0 ∨ m7 = ROOT_INO ⊦ # links(m11, abs-dirs(fs0, ri0)) = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr1 = adr5, adr2 = adr3, adr2 = adr4, adr2 = adr5, adr3 = adr4, adr3 = adr5, adr4 = adr5, links(m11, abs-dirs(fs0, ri0)) = ∅, m11 = ROOT_INO, m11 = 0, m7 = m11, m7 = 0, adr4 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3], adr2 ∈ ri0 -- dentrykey(m11, str), adr5 ∈ fs0, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, adr3 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2], adr5 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4], ( dentrykey(m7, str1) ∈ ri0 ↔ dentrykey(m7, str1) ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4][inodekey(m11), adr5]) ∧ ( dentrykey(m7, str1) ∈ ri0 → abs-children(m7, fs0, ri0)[str0, m][str1] = (adr5 = (dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)]) ⊃ inodenode(inodekey(m11), md, true, 0, m22 + 1, m20 + 1) ;(adr4 = (dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)]) ⊃ inodenode(inodekey(m7), md1, true, m1, m2, m3) ;(adr3 = (dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)]) ⊃ inodenode(inodekey(m11), md2, true, 1, m22, m20) ;(adr2 = (dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)]) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)]) ⊃ dentrynode(dentrykey(m11, str), 0) ;fs0[(dentrykey(m7, str0) = dentrykey(m7, str1) ⊃ adr2;ri0[dentrykey(m7, str1)])] ) ) ) ) ) .ino), m1 = 0 ∧ m7 ≠ ROOT_INO

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: str1 = str0

Additional information

Used simplifier rules: ⊦ entries[str, ino][str] = ino; (s)% ⊦ dentrynode(key, m).ino = m; (s)% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (ws)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ key ∈ ri[key, adr]; (s) Used formulas: str1 = str0