[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 150 from proof refine-rename-new-reparent (previous step)

fs0[ri0[dentrykey(m3, str)]] = dentrynode(key2, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m5, m6, m8), fs0[ri0[inodekey(m3)]] = inodenode(key0, md2, true, m4, n0 + 1, m11 + 1), 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)[m3, mkdir(m11, md0, m4, n0, abs-children(m3, fs0, ri0) -- str)] [m7, mkdir(m8 + 1, md1, m5, m6 + 1, abs-children(m7, fs0, ri0)[str0, m]) ], abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ri-inj(ri0), ri-inj(fi), ri-inj((ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ri0[dentrykey(m3, str)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, inodekey(m3) ∈ ri0, inodekey(m) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m7) ∈ ri0, boolvar3 → boolvar4, m4 ≠ 0 ∨ m3 = ROOT_INO, m5 ≠ 0 ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ abs-dirs(fs0, ri0)[m3, mkdir(m11, md0, m4, n0, abs-children(m3, fs0, ri0) -- str)] [m7, mkdir(m8 + 1, md1, m5, m6 + 1, abs-children(m7, fs0, ri0)[str0, m]) ] = abs-dirs (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + 1, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m3 = m7, m3 = 0, m7 = 0, adr4 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3], adr2 ∈ ri0 -- dentrykey(m3, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, dentrykey(m7, str0) ∈ ri0, adr3 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2], m5 = 0 ∧ m7 ≠ ROOT_INO, m4 = 0 ∧ m3 ≠ ROOT_INO

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]);%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)%key ≠ key0 ⊦ (ri -- key0)[key] = ri[key]; (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)%⊦ dirs = abs-dirs(fs, ri) ↔ (∀ ino. ( ino ∈ dirs ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory) ∧ (ino ∈ dirs → dirs[ino] = abs-dir(ino, fs, ri))); (ss)