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

fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), abs-children(m, fs0, ri0) = ∅, dentrykeys(inodekey(m), ri0) = ∅, fs0[ri0[inodekey(m)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m6, mkdir(m9, md1, m7, m8, abs-children(m6, fs0, ri0)[str, m])] [m, mkdir(fs0[ri0[inodekey(m)]].size, md, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, ∅) ], abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), 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(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(m6, str0) ∈ ri0, inodekey(m6) ∈ ri0, ri0[inodekey(m6)] ∈ fs0, ri0[dentrykey(m6, str)] ∈ fs0, inodekey(m) ∈ ri0, dentrykey(m6, str) ∈ ri0, 1 ≤ m8, 1 ≤ m9, fs0[ri0[inodekey(m)]].nlink = 1 → links(m, fs0, ri0) = ∅ ++ dentrykey(m6, str), boolvar4 → boolvar1, m7 ≠ 0 ∨ m6 = ROOT_INO, links(m6, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m6 = ROOT_INO ⊦ fs0[ri0[dentrykey(m6, str0)]].ino = (adr1 = ri0[dentrykey(m6, str0)] ⊃ dentrynode(dentrykey(m6, str), 0);fs0[ri0[dentrykey(m6, str0)]]).ino, fs0[ri0[inodekey(m)]].nlink = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = ri0[dentrykey(m6, str0)], adr2 = adr3, adr2 = adr4, adr3 = ri0[dentrykey(m6, str0)], adr3 = adr4, adr4 = ri0[dentrykey(m6, str0)], dentrykey(m6, str) = dentrykey(m6, str0), m = ROOT_INO, m = 0, m6 = 0, m6 = m, m8 = 0, m9 = 0, adr2 ∈ ri0 -- dentrykey(m6, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, m7 = 0 ∧ m6 ≠ ROOT_INO

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: adr1 = ri0[dentrykey(m6, str0)]

Additional information

Used simplifier rules: ⊦ ¬ adr ∈ fs → fs[adr] = (∅)[adr]; (s)% ⊦ dentrynode(key, m).ino = m; (s)% ⊦ key ∈ ri ∧ ri-cons(ri, fs) → ri[key] ∈ fs; (ss) Used formulas: adr1 = ri0[dentrykey(m6, str0)]