[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 1004 from proof refine-rename-overwrite-keep-parent-different (previous step)

fs0[ri0[inodekey(m)]].nsubdirs = 0, fs0[ri0[inodekey(m0)]] = inodenode(key, md0, false, m10 + 1, 0, m3), fs0[ri0[inodekey(m7)]] = inodenode(key1, md2, true, m4, n0, m11 + 1), fs0[ri0[dentrykey(m7, str)]] = dentrynode(key2, m), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m0), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m7, mkdir(m11, md1, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m])], abs-files(fs0, ri0)[m0, mkfile(m5, md, m10, abs-content(m0, fs0, ri0))]), file-node-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, dentrykey(m7, str) ∈ ri0, dentrykey(m7, str0) ∈ ri0, inodekey(m7) ∈ ri0, ri0[dentrykey(m7, str0)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str)] ∈ fs0, ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, inodekey(ino) ∈ ri0, boolvar3 → boolvar4, m4 ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = ri0[inodekey(ino)], adr3 = adr4, adr4 = ri0[inodekey(ino)], ino = m0, m0 = 0, m0 = ROOT_INO, m10 = 0, m7 = ino, m7 = 0, mkdentry(str, m) = mkdentry(str0, m0), fs0[ri0[inodekey(m)]].directory, adr3 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2], adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m7, str), adr4 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3], m4 = 0 ∧ m7 ≠ ROOT_INO, ( ¬ fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4] ∧ ¬ (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str), 0);fs0[ri0[inodekey(ino)]]) ) .directory) ∧ ( ¬ fs0[ri0[inodekey(ino)]].directory → mkfile(fs0[ri0[inodekey(ino)]].size, fs0[ri0[inodekey(ino)]].meta, fs0[ri0[inodekey(ino)]].nlink, abs-content(ino, fs0, ri0)) = mkfile ((adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str), 0);fs0[ri0[inodekey(ino)]]) ) .size, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str), 0);fs0[ri0[inodekey(ino)]]) ) .meta, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m7, str), 0);fs0[ri0[inodekey(ino)]]) ) .nlink, abs-content (ino, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11) ] [adr4, inodenode(inodekey(m0), md, false, m10, 0, m5) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m0), adr4])))

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: adr2 = ri0[inodekey(ino)]

Additional information

Used simplifier rules: ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss) Used formulas: adr2 = ri0[inodekey(ino)]