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

m14 + 1 = fs0[ri0[inodekey(m0)]].nlink, abs-dirs(fs0, ri0)[m11] = mkdir(m5, md, m6, m8, entries), fs0[ri0[inodekey(m)]] = inodenode(key, md6, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size), fs0[ri0[inodekey(m11)]] = inodenode(key2, md4, true, m4, m16 + 1, m13 + 1), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m0), fs0[ri0[dentrykey(m11, str)]] = dentrynode(key4, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m1, m2, m3), fs0[ri0[inodekey(m0)]] = inodenode(key3, md5, true, m14 + 1, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size), abs-dirs(fs0, ri0)[m7] = mkdir(m9, md7, m10, m12, entries0), abs-children(m0, fs0, ri0) = ∅, dentrykeys(inodekey(m0), ri0) = ∅, fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m0)]].directory, 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(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m0), md0, true, m14, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m0), adr5]), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m0), md0, true, m14, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size) ]), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m0), md0, true, m14, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m0), adr5], orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m0), md0, true, m14, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), 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(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m0), adr5]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m11, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m11), md2, true, m4, m16, m13)] [adr4, inodenode(inodekey(m7), md1, true, m1, m2, m3) ] [adr5, inodenode(inodekey(m0), md0, true, m14, fs0[ri0[inodekey(m0)]].nsubdirs, fs0[ri0[inodekey(m0)]].size) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), 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), ri0[dentrykey(m11, str)] ∈ fs0, ri0[inodekey(m11)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[inodekey(m0)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, inodekey(m11) ∈ ri0, inodekey(m7) ∈ ri0, dentrykey(m11, str) ∈ ri0, inodekey(m0) ∈ ri0, dentrykey(m7, str0) ∈ ri0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, boolvar2 → boolvar0, m4 ≠ 0 ∨ m11 = ROOT_INO, m1 ≠ 0 ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m11 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = 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, m11 = 0, m11 = m7, m14 = 0, m7 = 0, adr5 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4], adr3 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2], adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr5 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m11, str), adr4 ∈ (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3], m1 = 0 ∧ m7 ≠ ROOT_INO, m4 = 0 ∧ m11 ≠ ROOT_INO, str0 ∈ entries0 ∧ m0 = entries0[str0] ∧ str ∈ entries ∧ m = entries[str] ∧ m4 = m6 ∧ m13 + 1 = m5 ∧ m16 + 1 = m8 ∧ m1 = m10 ∧ m3 = m9 ∧ m2 = m12

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: aubifs-abs name: at-dirs seq: ⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri) subst: [ino, ri, fs] → [m11, ri0, fs0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss) Used terms: m11, ri0, fs0