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

(m7 = m2 ⊃ mkdir(m1, md3, m0, m5, entries);mkdir(m11, md1, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m])) = mkdir(m3, md4, m9, m10, entries0), (m2 = m7 ⊃ mkdir(m11, md2, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m]);mkdir(m8, md0, 1, m6, ∅)) = mkdir(m1, md, m0 + 1, m5, entries), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m2), fs0[ri0[dentrykey(m7, str)]] = dentrynode(key2, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md2, true, m4, n0 + 1, m11 + 1), fs0[ri0[inodekey(m2)]] = inodenode(key, md0, true, 1, m6, m8), abs-children(m2, fs0, ri0) = ∅, dentrykeys(inodekey(m2), ri0) = ∅, links(m2, fs0, ri0) = ∅ ++ dentrykey(m7, str0), mkdir(m1, md, m0, m5, entries) = mkdir(m12, md5, m13, m14, entries1), fs0[ri0[inodekey(m)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0) [m7, (m7 = m2 ⊃ mkdir(m1, md, m0, m5, entries);mkdir(m11, md2, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m])).meta:= md1.meta:= md1 ] [m2, mkdir(m12, md3, m13, m14, entries1) ], 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, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m2), 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, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ]), 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, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m2), adr4], orphans(fs0, ri0) ++ inodekey(m2)), 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, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m2), adr4], orphans(fs0, ri0) ++ inodekey(m2), 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), adr3][inodekey(m2), 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, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m2), adr4], orphans(fs0, ri0) ++ inodekey(m2), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m2) ∈ ri0, ri0[inodekey(m2)] ∈ fs0, ri0[dentrykey(m7, str)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, inodekey(m7) ∈ ri0, dentrykey(m7, str0) ∈ ri0, dentrykey(m7, str) ∈ ri0, inodekey(m) ∈ ri0, boolvar3 → boolvar4, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m7 = ROOT_INO ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m2 = 0, m2 = ROOT_INO, m2 = m7, m7 = 0, mkdentry(str, m) = mkdentry(str0, m2), mkdir(m12, md3, m13, m14, entries1) = mkdir (m8, md3, 0, m6, abs-children (m2, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m2), md3, true, 0, m6, m8) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m2), adr4])), 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], m4 = 0 ∧ m7 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: mkdir-inj: ⊦ mkdir(n, md, m, n0, entries0) = mkdir(n, md, m, n0, entries1) ↔ entries0 = entries1;%in-ri-dentry-inode: ⊦ dentrykey(ino, str) ∈ ri[inodekey(ino), adr] ↔ dentrykey(ino, str) ∈ ri;%ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv% ⊦ dentrykey(m, str) = dentrykey(m0, str0) ↔ m = m0 ∧ str = str0; (ws)% ⊦ key ∈ ri -- key0 ↔ key ≠ key0 ∧ key ∈ ri; (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (las)% ⊦ ¬ str ∈ ∅; (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)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ 1 = m + 1 ↔ m = 0; (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)