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

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(m7)]] = inodenode(key1, md3, true, m1, m2, m3), fs0[ri0[dentrykey(m11, str)]] = dentrynode(key4, m), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m5), fs0[ri0[inodekey(m11)]] = inodenode(key2, md4, true, m4, m16 + 1, m13 + 1), fs0[ri0[inodekey(m5)]] = inodenode(key5, md7, true, 1, m22, m20), abs-children(m5, fs0, ri0) = ∅, dentrykeys(inodekey(m5), ri0) = ∅, links(m5, fs0, ri0) = ∅ ++ dentrykey(m7, str0), fs0[ri0[inodekey(m)]].directory, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m11, str), 0);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)[m11, mkdir(m13, md2, m4, m16, abs-children(m11, fs0, ri0) -- str)] [m7, mkdir(m3, md1, m1, m2, abs-children(m7, fs0, ri0)[str0, m]) ] [m5, mkdir(m20, md, 0, m22, ∅) ], abs-files(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(m5), md, true, 0, m22, m20) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5]), file-node-cons(fs0, ri0), 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(m5), md, true, 0, m22, m20) ]), 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(m5), md, true, 0, m22, m20) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0) ++ inodekey(m5)), 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(m5), md, true, 0, m22, m20) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0) ++ inodekey(m5), 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(m5), adr5]), ri-inj(ri0), ri-inj(fi), 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(m5), md, true, 0, m22, m20) ], (ri0 -- dentrykey(m11, str))[dentrykey(m7, str0), adr2][inodekey(m11), adr3][inodekey(m7), adr4][inodekey(m5), adr5], orphans(fs0, ri0) ++ inodekey(m5), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(m7, str0) ∈ ri0, dentrykey(m11, str) ∈ ri0, inodekey(m7) ∈ ri0, inodekey(m11) ∈ ri0, ri0[dentrykey(m7, str0)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[inodekey(m11)] ∈ fs0, ri0[dentrykey(m11, str)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m5)] ∈ fs0, inodekey(m5) ∈ ri0, inodekey(ino) ∈ ri0, boolvar2 → boolvar3, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m11 = ROOT_INO, m1 ≠ 0 ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m11 = ROOT_INO ⊦ adr1 = adr5, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr5, adr2 = adr4, adr2 = adr3, adr3 = adr5, adr3 = adr4, adr3 = ri0[inodekey(ino)], adr4 = ri0[inodekey(ino)], adr4 = adr5, adr5 = ri0[inodekey(ino)], ino = m11, ino = m5, ino = m7, m11 = 0, m11 = m7, m5 = m11, m5 = 0, m5 = ROOT_INO, m5 = m7, m7 = 0, fs0[ri0[inodekey(ino)]].directory, 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], m4 = 0 ∧ m11 ≠ ROOT_INO, m1 = 0 ∧ m7 ≠ ROOT_INO

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

Used simplifier rules: ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss)