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

boolvar0 ↔ boolvar2, boolvar ↔ boolvar1, new_dent = negdentry(str0), new_parent_inode = mkinode(m0, md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), old_child_inode = mkinode (fs[ri[dentrykey(m, str)]].ino, md1, boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, m4), 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), old_dent.dentry?, fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].inode?, 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), ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(m0) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, old_parent_inode.nsubdirs ≥ (boolvar0 ⊃ 1;0), old_parent_inode.size ≥ 1, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar2 ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(old_parent_inode.ino, old_dent.name), 0), dentrynode(dentrykey(new_parent_inode.ino, new_dent.name), old_dent.ino), inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1), inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(old_parent_inode.ino, old_dent.name), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(new_parent_inode.ino, new_dent.name), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(old_parent_inode.ino), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(new_parent_inode.ino), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode0 := mkinode (old_parent_inode.ino, inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1) .meta, inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1) .directory, inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1) .nlink, inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1) .nsubdirs, inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1) .size); new_parent_inode0 := mkinode (new_parent_inode.ino, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1) .meta, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1) .directory, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1) .nlink, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1) .nsubdirs, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1) .size)}⟫ (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, m0 = m, inodekey(m) ∈ ro, dentrykey(m0, str0) ∈ ri, inodekey(m0) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ negdentry(str).name = str; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)