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

1 = fs0[ri0[inodekey(m3)]].nlink, 0 = fs0[ri0[inodekey(m3)]].nsubdirs, 0 = fs0[ri0[inodekey(m)]].nsubdirs, 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, m3), links(m3, fs0, ri0) = ∅ ++ dentrykey(m7, str0), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons (abs-dirs(fs0, ri0)[m7, mkdir(m11, md1, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m])], abs-files(fs0, ri0)[m3, mkfile(m6, md0, 0, abs-content(m3, fs0, ri0))]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(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(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4]), log-cons(log0, fs0), 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(m3), md0, false, 0, 0, m6) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), 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(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ri-inj((ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), inodekey(m) ∈ ri0, inodekey(m3) ∈ 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, boolvar3 → boolvar4, m4 ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ key.inode? ∧ key ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4] ∧ (adr4 = (inodekey(m3) = key ⊃ adr4;(inodekey(m7) = key ⊃ adr3;(dentrykey(m7, str0) = key ⊃ adr2;ri0[key]))) ⊃ inodenode(inodekey(m3), md0, false, 0, 0, m6) ;(adr3 = (inodekey(m3) = key ⊃ adr4;(inodekey(m7) = key ⊃ adr3;(dentrykey(m7, str0) = key ⊃ adr2;ri0[key]))) ⊃ inodenode(inodekey(m7), md1, true, m4, n0, m11) ;(adr2 = (inodekey(m3) = key ⊃ adr4;(inodekey(m7) = key ⊃ adr3;(dentrykey(m7, str0) = key ⊃ adr2;ri0[key]))) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (inodekey(m3) = key ⊃ adr4;(inodekey(m7) = key ⊃ adr3;(dentrykey(m7, str0) = key ⊃ adr2;ri0[key]))) ⊃ dentrynode(dentrykey(m7, str), 0) ;fs0[(inodekey(m3) = key ⊃ adr4;(inodekey(m7) = key ⊃ adr3;(dentrykey(m7, str0) = key ⊃ adr2;ri0[key])))] ) ) ) ) .nlink = 0 ∧ key.ino ≠ ROOT_INO ↔ key = inodekey(m3) ∨ key.inode? ∧ key ∈ ri0 ∧ fs0[ri0[key]].nlink = 0 ∧ key.ino ≠ ROOT_INO, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m3 = ROOT_INO, m3 = 0, m7 = 0, mkdentry(str, m) = mkdentry(str0, m3), fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m3)]].directory, adr4 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3], adr2 ∈ ri0 -- dentrykey(m7, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, adr3 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2], m4 = 0 ∧ m7 ≠ ROOT_INO

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: key = inodekey(m3)

Additional information

Used simplifier rules: ⊦ inodekey(m).inode?; (s)% ⊦ key ≠ key0 → (key ∈ ri[key0, adr] ↔ key ∈ ri); (s)% ⊦ key ∈ ri[key, adr]; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodekey(m).ino = m; (s) Used formulas: key = inodekey(m3)