[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 224 from proof refine-rename-overwrite-keep-parent-different (previous step)

fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m7), fs0[ri0[dentrykey(m7, str)]] = dentrynode(key2, m), fs0[ri0[inodekey(m7)]] = inodenode(key, md0, true, 1, m14 + 1, m12 + 1), abs-children(m7, fs0, ri0) = ∅, dentrykeys(inodekey(m7), ri0) = ∅, links(m7, fs0, ri0) = ∅ ++ dentrykey(m7, str0), fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(ino)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0)[m7, mkdir(m12, md3, 0, m14, (∅)[str0, m])], abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12)] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12)] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12)] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4], orphans(fs0, ri0) ++ inodekey(m7)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12)] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4], orphans(fs0, ri0) ++ inodekey(m7), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12)] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4], orphans(fs0, ri0) ++ inodekey(m7), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(ino) ∈ ri0, inodekey(m7) ∈ ri0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, dentrykey(m7, str0) ∈ ri0, dentrykey(m7, str) ∈ ri0, inodekey(m) ∈ ri0, boolvar3 → boolvar4 ⊦ # links(m7, abs-dirs(fs0, ri0)) = 0, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr1 = ri0[inodekey(ino)], adr2 = adr4, adr2 = adr3, adr2 = ri0[inodekey(ino)], adr3 = adr4, adr3 = ri0[inodekey(ino)], adr4 = ri0[inodekey(ino)], ino = m7, links(m7, abs-dirs(fs0, ri0)) = ∅, m7 = 0, m7 = ROOT_INO, mkdentry(str, m) = mkdentry(str0, m7), adr3 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2], adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m7, str), adr4 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3], (fs0[ri0[inodekey(ino)]].directory → inodekey(ino) ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4]) ∧ ( fs0[ri0[inodekey(ino)]].directory → abs-children(ino, fs0, ri0) = abs-children (ino, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m7), md1, true, 1, m14, m12) ] [adr4, inodenode(inodekey(m7), md3, true, 0, m14 + 1, m12 + 1) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr4]))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: at-ri: ⊦ ri[key, adr][key0] = (key = key0 ⊃ adr;ri[key0]);% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (las)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)%key ≠ key0 ⊦ (ri -- key0)[key] = ri[key]; (s)% ⊦ dentrykey(m, str) = dentrykey(m0, str0) ↔ m = m0 ∧ str = str0; (ws)%⊦ dentrykey(ino, str) ∈ ri → abs-children(ino, fs, ri)[str] = fs[ri[dentrykey(ino, str)]].ino; (s)% ⊦ str ∈ abs-children(ino, fs, ri) ↔ dentrykey(ino, str) ∈ ri; (s)%⊦ entries = abs-children(ino, fs, ri) ↔ (∀ str. (str ∈ entries ↔ dentrykey(ino, str) ∈ ri) ∧ ( str ∈ entries → entries[str] = fs[ri[dentrykey(ino, str)]].ino)); (ss)% ⊦ key ∈ ri -- key0 ↔ key ≠ key0 ∧ key ∈ ri; (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (ws)