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

m12 + 1 = fs0[ri0[inodekey(m0)]].nlink, 0 = fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m)]] = inodenode(key, md5, false, fs0[ri0[inodekey(m)]].nlink, 0, m13), fs0[ri0[inodekey(m9)]] = inodenode(key1, md3, true, m1, m3, m14 + 1), fs0[ri0[dentrykey(m9, str)]] = dentrynode(key3, m), fs0[ri0[dentrykey(m4, str0)]] = dentrynode(key0, m0), fs0[ri0[inodekey(m4)]] = inodenode(key2, md4, true, m6, m7, m8), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, m12, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, m12, 0, m5) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, m12, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, m12, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, m12, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(m9, str) ∈ ri0, inodekey(m0) ∈ ri0, dentrykey(m4, str0) ∈ ri0, inodekey(m9) ∈ ri0, inodekey(m4) ∈ ri0, ri0[dentrykey(m4, str0)] ∈ fs0, ri0[inodekey(m4)] ∈ fs0, ri0[inodekey(m9)] ∈ fs0, ri0[dentrykey(m9, str)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, boolvar2 → boolvar0, links(m9, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m4 = ROOT_INO, m1 ≠ 0 ∨ m9 = ROOT_INO, m6 ≠ 0 ∨ m4 = ROOT_INO ⊦ adr1 = adr5, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr5, adr2 = adr4, adr2 = adr3, adr3 = adr5, adr3 = adr4, adr4 = adr5, m0 = 0, m0 = ROOT_INO, m12 = 0, m4 = 0, m9 = 0, m9 = m4, fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m0)]].directory, adr5 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4], adr3 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2], adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr5 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m9, str), adr4 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3], m6 = 0 ∧ m4 ≠ ROOT_INO, m1 = 0 ∧ m9 ≠ ROOT_INO, str0 ∈ abs-dirs(fs0, ri0)[m4].entries ∧ m0 = abs-dirs(fs0, ri0)[m4].entries[str0] ∧ str ∈ abs-dirs(fs0, ri0)[m9].entries ∧ m = abs-dirs(fs0, ri0)[m9].entries[str] ∧ m1 = abs-dirs(fs0, ri0)[m9].nlink ∧ m14 + 1 = abs-dirs(fs0, ri0)[m9].size ∧ m3 = abs-dirs(fs0, ri0)[m9].nsubdirs ∧ m6 = abs-dirs(fs0, ri0)[m4].nlink ∧ m8 = abs-dirs(fs0, ri0)[m4].size ∧ m7 = abs-dirs(fs0, ri0)[m4].nsubdirs

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [abs-dirs(fs0, ri0)[m9], m2, md, m10, m11, entries]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: abs-dirs(fs0, ri0)[m9], m2, md, m10, m11, entries