[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 33 from proof refine-link (previous step)

p_inode1.ino = fs[ri[dentrykey(ino0, str)]].ino, fs[ri[dentrykey(ino, str)]].ino = p_inode1.ino, p_inode1.nlink = fs[ri[inodekey(p_inode1.ino)]].nlink, p_inode0.nlink = fs[ri[inodekey(p_inode0.ino)]].nlink, p_inode1.nsubdirs = 0, p_inode0.nsubdirs = fs[ri[inodekey(p_inode0.ino)]].nsubdirs, p_inode0.size = fs[ri[inodekey(p_inode0.ino)]].size, 0 = fs[ri[inodekey(p_inode1.ino)]].nsubdirs, c_inode = p_inode1, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), new_dent = old_dent0, old_dent0 = negdentry(str0), p_inode = p_inode0, ro = orphans(fs, ri), fs[ri[inodekey(ino0)]].directory, p_inode0.directory, fs[ri[inodekey(p_inode0.ino)]].directory, fs[ri[inodekey(ino)]].directory, orphans(fs, ri).inodes?, fo.inodes?, old_dent0.negdentry?, 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), dentrykey(ino0, str) ∈ ri, inodekey(ino0) ∈ ri, inodekey(p_inode0.ino) ∈ ri, dentrykey(ino, str) ∈ ri, inodekey(p_inode1.ino) ∈ ri, inodekey(ino) ∈ ri, asynced → boolvar, links(p_inode1.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ p_inode1.ino = ROOT_INO, links(p_inode0.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ p_inode0.ino = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, p_inode0.nlink ≠ 0 ∨ p_inode0.ino = ROOT_INO, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ [aubifs_link#(mkdentry(str, p_inode1.ino), fi, orphans(fs, ri), fo; p_inode, c_inode, new_dent, err, ri, fs, log, boolvar)] ( 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) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨afs_link#(mkdentry(str, p_inode1.ino); p_inode0, p_inode1, old_dent0, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ err = err0)), fs[ri[inodekey(p_inode1.ino)]].directory, p_inode1.directory, dentrykey(p_inode0.ino, str0) ∈ ri, fs[ri[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO, p_inode0.nlink = 0 ∧ p_inode0.ino ≠ ROOT_INO, p_inode1.nlink = 0 ∧ p_inode1.ino ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 34:
fs[ri[dentrykey(ino, str)]].ino = p_inode1.ino, p_inode1.ino = fs[ri[dentrykey(ino0, str)]].ino, p_inode0.nlink = fs[ri[inodekey(p_inode0.ino)]].nlink, p_inode1.nlink = fs[ri[inodekey(p_inode1.ino)]].nlink, p_inode0.nsubdirs = fs[ri[inodekey(p_inode0.ino)]].nsubdirs, p_inode1.nsubdirs = 0, p_inode0.size = fs[ri[inodekey(p_inode0.ino)]].size, 0 = fs[ri[inodekey(p_inode1.ino)]].nsubdirs, c_inode = p_inode1, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), new_dent = negdentry(str0), p_inode = p_inode0, ro = orphans(fs, ri), fs[ri[inodekey(ino)]].directory, fs[ri[inodekey(p_inode0.ino)]].directory, p_inode0.directory, fs[ri[inodekey(ino0)]].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(ino) ∈ ri, inodekey(p_inode1.ino) ∈ ri, dentrykey(ino, str) ∈ ri, inodekey(p_inode0.ino) ∈ ri, inodekey(ino0) ∈ ri, dentrykey(ino0, str) ∈ ri, ¬ p_inode1.directory, ¬ fs[ri[inodekey(p_inode1.ino)]].directory, ¬ dentrykey(p_inode0.ino, str0) ∈ ri, asynced → boolvar, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, p_inode0.nlink ≠ 0 ∨ p_inode0.ino = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, links(p_inode0.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ p_inode0.ino = ROOT_INO, links(p_inode1.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ p_inode1.ino = ROOT_INO ⊦ [aubifs_link#(mkdentry(str, p_inode1.ino), fi, orphans(fs, ri), fo; p_inode, c_inode, new_dent, err, ri, fs, log, boolvar)] ( 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) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨old_dent0 := negdentry(str0); afs_link#(mkdentry(str, p_inode1.ino); p_inode0, p_inode1, old_dent0, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ err = err0)), p_inode1.nlink = 0 ∧ p_inode1.ino ≠ ROOT_INO, p_inode0.nlink = 0 ∧ p_inode0.ino ≠ ROOT_INO, fs[ri[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ negdentry(str).negdentry?; (s)