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

VFS_PAGE_SIZE = n2 + m2 % VFS_PAGE_SIZE, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf0), fs0[ri0[inodekey(m)]] = inodenode(key1, md0, false, m3, 0, m5), key.inode?, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons (abs-dirs (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), abs-files (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), afs-cons (abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n1, md, m3, abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)] upto m2)]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj ( ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, m2 ≤ n1, VFS_PAGE_SIZE ≤ # buf0, asynced0 → boolvar0 ⊦ m2 % VFS_PAGE_SIZE = 0, key.ino = ROOT_INO, key ∈ ri0 ∧ fs0[ri0[key]].nlink = 0 ↔ key ∈ ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] ∧ (adr3 = (inodekey(m) = key ⊃ adr2;(datakey(m, m2 / VFS_PAGE_SIZE) = key ⊃ adr3;ri0[key])) ⊃ datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ;(adr2 = (inodekey(m) = key ⊃ adr2;(datakey(m, m2 / VFS_PAGE_SIZE) = key ⊃ adr3;ri0[key])) ⊃ inodenode(inodekey(m), md, false, m3, 0, n1) ;(adr1 = (inodekey(m) = key ⊃ adr2;(datakey(m, m2 / VFS_PAGE_SIZE) = key ⊃ adr3;ri0[key])) ⊃ truncnode(inodekey(m), m2) ;fs0[(inodekey(m) = key ⊃ adr2;(datakey(m, m2 / VFS_PAGE_SIZE) = key ⊃ adr3;ri0[key]))] ) ) ) .nlink = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, buf-opt0.some?, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr3 ∈ ri0

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: key name: elim-01 seq: ⊦ key.inode? → (m = key.ino ↔ key = inodekey(m)) subst: [key, m] → [key, m0]

Additional information

Used simplifier rules: ⊦ key.inode? → (m = key.ino ↔ key = inodekey(m)); (elim) Used terms: key, m0