[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 29 from proof inv-renam (previous step)

mkinode(fs[ri[dentrykey(m, str)]].ino, md1, boolvar5, m5, m6, m7) = mkinode(m0, md0, boolvar, m1, m2, m3), new_dent = negdentry(str0), new_parent_inode = mkinode(m4, md2, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), old_parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m4)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(m4) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, boolvar5 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_rename_new_reparent# (boolvar, mkinode(fs[ri[dentrykey(m, str)]].ino, md1, boolvar5, m5, m6, m7), fi, ro, fo ; old_parent_inode, new_parent_inode, old_dent, new_dent, err, ri, fs, log, boolvar2)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[inodekey(m)]].size = 0, m = m4, inodekey(m4) ∈ ro, dentrykey(m4, str0) ∈ ri, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 30:
new_dent = negdentry(str0), new_parent_inode = mkinode(m4, md2, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), old_parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[inodekey(m)]].size ≠ 0, m ≠ m4, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m4)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(m4) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, ¬ inodekey(m4) ∈ ro, ¬ dentrykey(m4, str0) ∈ ri, ¬ inodekey(m) ∈ ro, boolvar → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_rename_new_reparent# (boolvar, mkinode(fs[ri[dentrykey(m, str)]].ino, md0, boolvar, m1, m2, m3), fi, ro, fo ; old_parent_inode, new_parent_inode, old_dent, new_dent, err, ri, fs, log, boolvar2)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro))

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)