[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 472 from proof refine-rename-new-reparent (previous step)

boolvar ↔ false, boolvar0 ↔ false, fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m5, m6, m8), fs0[ri0[dentrykey(m3, str)]] = dentrynode(key2, m), fs0[ri0[inodekey(m3)]] = inodenode(key0, md2, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1), dirs = dirs2[new_ino, dirs2[new_ino].size:= (dirs2[new_ino].size + 1)], dirs0 = abs-dirs(fs0, ri0)[old_ino, abs-dirs(fs0, ri0)[old_ino].entries:= (abs-dirs(fs0, ri0)[old_ino].entries -- str)], dirs1 = dirs0[old_ino, dirs0[old_ino].size:= (dirs0[old_ino].size - 1)], dirs2 = dirs1[new_ino, dirs1[new_ino].entries:= dirs1[new_ino].entries[str0, old_dent.ino]], files = abs-files(fs0, ri0), new_dent = negdentry(str0), new_ino = m7, old_dent = mkdentry(str, m), old_ino = m3, old_dent.dentry?, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + (boolvar1 ⊃ 1;0), m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + (boolvar1 ⊃ 1;0), m8 + 1) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + (boolvar1 ⊃ 1;0), m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + (boolvar1 ⊃ 1;0), m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj((ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6 + (boolvar1 ⊃ 1;0), m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m7) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m3) ∈ ri0, ri0[inodekey(m7)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m3, str)] ∈ fs0, dirs0[old_ino].size ≥ 1, boolvar3 → boolvar4, fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m2 = fs0[ri0[inodekey(m)]].size ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(m)]].size, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, m5 ≠ 0 ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m3 = ROOT_INO ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m3 = 0, m3 = m7, m7 = 0, old_dent.dentry?, old_dent.ino ∈ dirs1, adr3 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2], dentrykey(m7, str0) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m3, str), adr4 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3], m4 = 0 ∧ m3 ≠ ROOT_INO, m5 = 0 ∧ m7 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information