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

new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, ¬ fs[ri[inodekey(m3)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].directory, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(new_inode.ino, str)]].ino, m3 = fs[ri[dentrykey(new_inode.ino, str0)]].ino, new_child_inode = new_dent_inode, new_dent = mkdentry(str0, m3), new_dent_inode = mkinode(m3, md0, boolvar2, m4, m5, m6), old_dent = mkdentry(str, fs[ri[dentrykey(new_inode.ino, str)]].ino), old_parent_inode = mkinode(new_inode.ino, new_inode.meta, true, new_inode.nlink, new_inode.nsubdirs, new_inode.size), ro = orphans(fs, ri), fs[ri[inodekey(new_inode.ino)]].directory, new_inode.directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(new_inode.ino) ∈ ri, dentrykey(new_inode.ino, str0) ∈ ri, dentrykey(new_inode.ino, str) ∈ ri, inodekey(m3) ∈ ri, inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino) ∈ ri, 1 ≤ new_inode.size, fs[ri[inodekey(m3)]].directory → dentrykeys(inodekey(m3), ri) = ∅, fs[ri[inodekey(m3)]].directory → abs-children(m3, fs, ri) = ∅, boolvar → boolvar0, m4 = 1 → links(m3, fs, ri) = ∅ ++ dentrykey(new_inode.ino, str0), boolvar1 → 1 ≤ new_inode.nsubdirs, fs[ri[inodekey(m3)]].directory ∧ m4 = fs[ri[inodekey(m3)]].nlink ∧ m6 = fs[ri[inodekey(m3)]].size ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(m3)]].directory ∧ m4 = fs[ri[inodekey(m3)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m3)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, ¬ fs[ri[inodekey(m3)]].directory ∧ ¬ boolvar2 ∧ m4 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∨ fs[ri[inodekey(m3)]].directory ∧ boolvar2 ∧ m4 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ m6 = fs[ri[inodekey(m3)]].size, ¬ fs[ri[inodekey(m3)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(new_inode.ino, str)]].ino)]].size, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = ROOT_INO, new_inode.nlink ≠ 0 ∨ new_inode.ino = ROOT_INO ⊦ ⟪aubifs_rename_overwrite_keep_parent# (boolvar1, mkinode(m, md, boolvar1, m0, m1, m2), fi, fo; old_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar0); new_parent_inode := old_parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_inode := mkinode(new_inode.ino, new_inode.meta, true, new_inode.nlink, new_inode.nsubdirs, new_inode.size); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (boolvar → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0), new_inode.size = 0, m3 = ROOT_INO, m4 = 0, mkdentry(str, fs[ri[dentrykey(new_inode.ino, str)]].ino) = mkdentry(str0, m3), new_inode.nlink = 0 ∧ new_inode.ino ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information