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

new_dent_inode.ino = m, old_inode.ino = new_inode.ino, old_dent_inode.ino = fs[ri[dentrykey(new_inode.ino, str)]].ino, new_inode.meta = old_inode.meta, new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, old_inode.nlink = new_inode.nlink, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, old_inode.nsubdirs = new_inode.nsubdirs, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, old_inode.size = new_inode.size, ¬ fs[ri[inodekey(m)]].directory ↔ ¬ fs[ri[inodekey(old_dent_inode.ino)]].directory, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(new_inode.ino, str0)]].ino, new_child_inode = new_dent_inode, new_dent = old_dent1, old_dent = mkdentry(str, old_dent_inode.ino), old_dent1 = mkdentry(str0, m), old_parent_inode = old_inode, ro = orphans(fs, ri), old_dent1.dentry?, new_inode.directory, old_inode.directory, fs[ri[inodekey(new_inode.ino)]].directory, orphans(fs, ri).inodes?, fo.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(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(old_dent_inode.ino) ∈ ri, inodekey(m) ∈ ri, dentrykey(new_inode.ino, str) ∈ ri, dentrykey(new_inode.ino, str0) ∈ ri, inodekey(new_inode.ino) ∈ ri, 1 ≤ new_inode.size, old_dent_inode.directory → 1 ≤ new_inode.nsubdirs, new_dent_inode.nlink = 1 → links(m, fs, ri) = ∅ ++ dentrykey(new_inode.ino, str0), boolvar → boolvar0, fs[ri[inodekey(m)]].directory → abs-children(m, fs, ri) = ∅, fs[ri[inodekey(m)]].directory → dentrykeys(inodekey(m), ri) = ∅, new_inode.nlink ≠ 0 ∨ new_inode.ino = ROOT_INO, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = ROOT_INO, ¬ fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ ¬ old_dent_inode.directory ∧ old_dent_inode.nlink = fs[ri[inodekey(old_dent_inode.ino)]].nlink ∧ old_dent_inode.nsubdirs = fs[ri[inodekey(old_dent_inode.ino)]].nsubdirs ∨ fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ old_dent_inode.directory ∧ old_dent_inode.nlink = fs[ri[inodekey(old_dent_inode.ino)]].nlink ∧ old_dent_inode.nsubdirs = fs[ri[inodekey(old_dent_inode.ino)]].nsubdirs ∧ old_dent_inode.size = fs[ri[inodekey(old_dent_inode.ino)]].size, ¬ fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ ¬ new_dent_inode.directory ∧ new_dent_inode.nlink = fs[ri[inodekey(m)]].nlink ∧ new_dent_inode.nsubdirs = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ new_dent_inode.directory ∧ new_dent_inode.nlink = fs[ri[inodekey(m)]].nlink ∧ new_dent_inode.nsubdirs = fs[ri[inodekey(m)]].nsubdirs ∧ new_dent_inode.size = fs[ri[inodekey(m)]].size, fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ old_dent_inode.nlink = fs[ri[inodekey(old_dent_inode.ino)]].nlink ∧ old_dent_inode.size = fs[ri[inodekey(old_dent_inode.ino)]].size ∧ old_dent_inode.nsubdirs = fs[ri[inodekey(old_dent_inode.ino)]].nsubdirs ∧ old_dent_inode.directory ∨ ¬ fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ old_dent_inode.nlink = fs[ri[inodekey(old_dent_inode.ino)]].nlink ∧ old_dent_inode.nsubdirs = 0 ∧ ¬ old_dent_inode.directory, fs[ri[inodekey(m)]].directory ∧ new_dent_inode.nlink = fs[ri[inodekey(m)]].nlink ∧ new_dent_inode.size = fs[ri[inodekey(m)]].size ∧ new_dent_inode.nsubdirs = fs[ri[inodekey(m)]].nsubdirs ∧ new_dent_inode.directory ∨ ¬ fs[ri[inodekey(old_dent_inode.ino)]].directory ∧ new_dent_inode.nlink = fs[ri[inodekey(m)]].nlink ∧ new_dent_inode.nsubdirs = 0 ∧ ¬ new_dent_inode.directory ⊦ ⟪aubifs_rename_overwrite_keep_parent# (old_dent_inode.directory, old_dent_inode, 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 := old_dent_inode; old_dent0 := mkdentry(str, old_dent_inode.ino); 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_dent_inode.nlink = 0, new_inode.size = 0, m = ROOT_INO, mkdentry(str, old_dent_inode.ino) = old_dent1, new_inode.nlink = 0 ∧ new_inode.ino ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (s)