[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 refine-rename-overwrite-reparent (previous step)

⟨afs_rename#(; old_inode, new_inode, old_child_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( old_inode = old_inode0 ∧ new_inode = new_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_dent_inode = new_dent_inode0 ∧ old_dent0 = old_dent ∧ old_dent1 = old_dent2 ∧ err0 = err ∧ dirs = abs-dirs(fs0, ri0) ∧ files = abs-files(fs0, ri0) ∧ (boolvar ↔ boolvar1)), old_child_inode0.ino = m, old_dent1.ino = fs[ri[dentrykey(new_inode.ino, old_dent1.name)]].ino, new_dent_inode.ino = old_dent1.ino, old_child_inode0.nlink = fs[ri[inodekey(m)]].nlink, old_inode.nlink = fs[ri[inodekey(old_inode.ino)]].nlink, new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, new_dent_inode.nlink = fs[ri[inodekey(old_dent1.ino)]].nlink, old_child_inode0.nsubdirs = 0, old_inode.nsubdirs = fs[ri[inodekey(old_inode.ino)]].nsubdirs, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, new_dent_inode.nsubdirs = 0, old_inode.size = fs[ri[inodekey(old_inode.ino)]].size, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), m = fs[ri[dentrykey(old_inode.ino, str)]].ino, old_child_inode = old_child_inode0, old_dent0 = mkdentry(str, m), orphans(abs-dirs(fs0, ri0), abs-files(fs0, ri0)) = abs-keys(ro0), old_dent1.dentry?, old_dent0.dentry?, fs[ri[inodekey(new_inode.ino)]].directory, fs[ri[inodekey(old_inode.ino)]].directory, old_inode.directory, new_inode.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(m) ∈ ri, inodekey(new_inode.ino) ∈ ri, dentrykey(new_inode.ino, old_dent1.name) ∈ ri, inodekey(old_dent1.ino) ∈ ri, inodekey(old_inode.ino) ∈ ri, dentrykey(old_inode.ino, str) ∈ ri, boolvar → boolvar0, boolvar1 → boolvar2, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = ROOT_INO, links(old_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ old_inode.ino = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_child_inode0, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs0, ri0) ∧ files = abs-files(fs0, ri0) ∧ (boolvar → boolvar2) ∧ old_inode0 = old_inode ∧ new_inode0 = new_inode ∧ old_child_inode = old_child_inode0 ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ old_dent2 = old_dent1 ∧ err = err0), old_inode.ino = new_inode.ino, old_child_inode0.directory, fs[ri[inodekey(m)]].directory, new_dent_inode.directory, fs[ri[inodekey(old_dent1.ino)]].directory

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 30:
⟨afs_rename#(; old_inode, new_inode, old_child_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( old_inode = old_inode0 ∧ new_inode = new_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_dent_inode = new_dent_inode0 ∧ old_dent0 = old_dent ∧ old_dent1 = old_dent2 ∧ err0 = err ∧ dirs = abs-dirs(fs0, ri0) ∧ files = abs-files(fs0, ri0) ∧ (boolvar ↔ boolvar1)), new_dent_inode.ino = old_dent1.ino, old_dent1.ino = fs[ri[dentrykey(new_inode.ino, old_dent1.name)]].ino, old_child_inode0.ino = fs[ri[dentrykey(old_inode.ino, str)]].ino, new_dent_inode.nlink = fs[ri[inodekey(old_dent1.ino)]].nlink, new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, old_inode.nlink = fs[ri[inodekey(old_inode.ino)]].nlink, old_child_inode0.nlink = fs[ri[inodekey(old_child_inode0.ino)]].nlink, new_dent_inode.nsubdirs = 0, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, old_inode.nsubdirs = fs[ri[inodekey(old_inode.ino)]].nsubdirs, old_child_inode0.nsubdirs = 0, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, old_inode.size = fs[ri[inodekey(old_inode.ino)]].size, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), old_child_inode = old_child_inode0, old_dent0 = mkdentry(str, old_child_inode0.ino), orphans(abs-dirs(fs0, ri0), abs-files(fs0, ri0)) = abs-keys(ro0), old_inode.ino ≠ new_inode.ino, old_dent1.dentry?, new_inode.directory, old_inode.directory, fs[ri[inodekey(old_inode.ino)]].directory, fs[ri[inodekey(new_inode.ino)]].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), dentrykey(old_inode.ino, str) ∈ ri, inodekey(old_inode.ino) ∈ ri, inodekey(old_dent1.ino) ∈ ri, dentrykey(new_inode.ino, old_dent1.name) ∈ ri, inodekey(new_inode.ino) ∈ ri, inodekey(old_child_inode0.ino) ∈ ri, ¬ fs[ri[inodekey(old_dent1.ino)]].directory, ¬ new_dent_inode.directory, ¬ fs[ri[inodekey(old_child_inode0.ino)]].directory, ¬ old_child_inode0.directory, boolvar1 → boolvar2, boolvar → boolvar0, links(old_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ old_inode.ino = ROOT_INO, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_child_inode0, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs0, ri0) ∧ files = abs-files(fs0, ri0) ∧ (boolvar → boolvar2) ∧ old_inode0 = old_inode ∧ new_inode0 = new_inode ∧ old_child_inode = old_child_inode0 ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ old_dent2 = old_dent1 ∧ err = err0)

Rule argument

Additional information

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