[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 506 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(m4)]] = inodenode(key2, md4, true, m6, m7, m8), fs0[ri0[dentrykey(m4, str0)]] = dentrynode(key0, m0), fs0[ri0[dentrykey(m9, str)]] = dentrynode(key3, m), fs0[ri0[inodekey(m9)]] = inodenode(key1, md3, true, m1, m3, m14 + 1), fs0[ri0[inodekey(m)]] = inodenode(key, md5, false, fs0[ri0[inodekey(m)]].nlink, 0, m13), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m9, mkdir(m14, md2, m1, m3, abs-children(m9, fs0, ri0) -- str)][m4, mkdir(m8, md1, m6, m7, abs-children(m4, fs0, ri0)[str0, m])], abs-files(fs0, ri0)[m0, mkfile(m5, md0, m12, abs-content(m0, 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]), file-node-cons(fs0, ri0), log-cons(log0, fs0), 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) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), 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)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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 '), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ri-inj((ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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 '), inodekey(ino) ∈ ri0, inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ri0[dentrykey(m9, str)] ∈ fs0, ri0[inodekey(m9)] ∈ fs0, ri0[inodekey(m4)] ∈ fs0, ri0[dentrykey(m4, str0)] ∈ fs0, inodekey(m4) ∈ ri0, inodekey(m9) ∈ ri0, dentrykey(m4, str0) ∈ ri0, inodekey(m0) ∈ ri0, dentrykey(m9, str) ∈ ri0, boolvar2 → boolvar3, m6 ≠ 0 ∨ m4 = ROOT_INO, m1 ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5] ∧ (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m9, str), 0);fs0[ri0[inodekey(ino)]]).directory, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr1 = adr5, adr2 = ri0[inodekey(ino)], adr2 = adr3, adr2 = adr4, adr2 = adr5, adr3 = ri0[inodekey(ino)], adr3 = adr4, adr3 = adr5, adr4 = ri0[inodekey(ino)], adr4 = adr5, adr5 = ri0[inodekey(ino)], ino = m0, m0 = ROOT_INO, m0 = 0, m12 = 0, m4 = ino, m4 = 0, m9 = ino, m9 = m4, m9 = 0, fs0[ri0[inodekey(m0)]].directory, fs0[ri0[inodekey(m)]].directory, adr4 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3], adr2 ∈ ri0 -- dentrykey(m9, str), adr5 ∈ fs0, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, adr3 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2], adr5 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4], m1 = 0 ∧ m9 ≠ ROOT_INO, m6 = 0 ∧ m4 ≠ ROOT_INO

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: adr1 = ri0[inodekey(ino)]

Additional information

Used simplifier rules: ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (ws)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ key ∈ ri -- key0 ↔ key ≠ key0 ∧ key ∈ ri; (s)% ⊦ ¬ adr ∈ fs → fs[adr] = (∅)[adr]; (s)% ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss) Used formulas: adr1 = ri0[inodekey(ino)]