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

m14 + 1 = fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m11)]] = inodenode(key2, md4, true, m4, m16 + 1, m13 + 1), fs[ri[dentrykey(m7, str0)]] = dentrynode(key0, m0), fs[ri[dentrykey(m11, str)]] = dentrynode(key, m), fs[ri[inodekey(m)]] = inodenode(key1, md3, true, m1, m2, m3), fs[ri[inodekey(m7)]] = inodenode(key3, md5, true, m5, m6, m8), abs-children(m0, fs, ri) = ∅, dentrykeys(inodekey(m0), ri) = ∅, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode = mkinode(m0, md0, true, m14 + 1, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), new_inode = mkinode(m7, md1, true, m5, m6, m8), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m0), old_dent_inode = mkinode(m, md, true, m1, m2, m3), old_inode = mkinode(m11, md2, true, m4, m16 + 1, m13 + 1), m0 ≠ 0, m0 ≠ ROOT_INO, m11 ≠ 0, m11 ≠ m7, m7 ≠ 0, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m0)]].inode?, 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-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m11, str) ∈ ri, ri[dentrykey(m11, str)] ∈ fs, inodekey(m11) ∈ ri, ri[inodekey(m11)] ∈ fs, dentrykey(m7, str0) ∈ ri, ri[dentrykey(m7, str0)] ∈ fs, ri[inodekey(m0)] ∈ fs, inodekey(m0) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m7) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, ⌊err0⌋ , m14 = 0 → links(m0, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar2 → boolvar0, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs, ri)) ≠ ∅ ∨ m11 = ROOT_INO, m5 ≠ 0 ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m11 = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar2)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar2 → boolvar1) ∧ mkinode(m11, md2, true, m4, m16 + 1, m13 + 1) = old_inode ∧ mkinode(m7, md1, true, m5, m6, m8) = new_inode ∧ mkinode(m, md, true, m1, m2, m3) = old_dent_inode ∧ mkinode(m0, md0, true, m14 + 1, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size) = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ mkdentry(str0, m0) = old_dent1 ∧ err0 = err1), m4 = 0 ∧ m11 ≠ ROOT_INO, m5 = 0 ∧ m7 ≠ ROOT_INO

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 1443:
m14 + 1 = m9, fs[ri[inodekey(m7)]] = inodenode(key3, md5, true, m5, m6, m8), fs[ri[inodekey(m)]] = inodenode(key1, md3, true, m1, m2, m3), fs[ri[dentrykey(m11, str)]] = dentrynode(key, m), fs[ri[dentrykey(m7, str0)]] = dentrynode(key0, m0), fs[ri[inodekey(m11)]] = inodenode(key2, md4, true, m4, m16 + 1, m13 + 1), fs[ri[inodekey(m0)]] = inodenode(key4, md6, boolvar, m9, m10, m12), abs-children(m0, fs, ri) = ∅, boolvar, dentrykeys(inodekey(m0), ri) = ∅, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode = mkinode(m0, md0, true, m14 + 1, m10, m12), new_inode = mkinode(m7, md1, true, m5, m6, m8), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m0), old_dent_inode = mkinode(m, md, true, m1, m2, m3), old_inode = mkinode(m11, md2, true, m4, m16 + 1, m13 + 1), fs[ri[inodekey(m0)]].inode?, 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-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m7) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m0) ∈ ri, ri[inodekey(m0)] ∈ fs, ri[dentrykey(m7, str0)] ∈ fs, dentrykey(m7, str0) ∈ ri, ri[inodekey(m11)] ∈ fs, inodekey(m11) ∈ ri, ri[dentrykey(m11, str)] ∈ fs, dentrykey(m11, str) ∈ ri, ⌊err0⌋ , boolvar2 → boolvar0, m14 = 0 → links(m0, fs, ri) = ∅ ++ dentrykey(m7, str0), m4 ≠ 0 ∨ m11 = ROOT_INO, m5 ≠ 0 ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs, ri)) ≠ ∅ ∨ m11 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar2)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar2 → boolvar1) ∧ mkinode(m11, md2, true, m4, m16 + 1, m13 + 1) = old_inode ∧ mkinode(m7, md1, true, m5, m6, m8) = new_inode ∧ mkinode(m, md, true, m1, m2, m3) = old_dent_inode ∧ mkinode(m0, md0, true, m14 + 1, m10, m12) = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ mkdentry(str0, m0) = old_dent1 ∧ err0 = err1), m0 = 0, m0 = ROOT_INO, m11 = 0, m11 = m7, m7 = 0, m5 = 0 ∧ m7 ≠ ROOT_INO, m4 = 0 ∧ m11 ≠ ROOT_INO

Rule argument

spec: node name: elim-03 seq: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)) subst: [nd, key, md, boolvar, m, m0, m1] → [fs[ri[inodekey(m0)]], key4, md6, boolvar, m9, m10, m12]

Additional information

Used simplifier rules: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)); (elim) Used terms: fs[ri[inodekey(m0)]], key4, md6, boolvar, m9, m10, m12