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

VFS_PAGE_SIZE = n2 + m2 % VFS_PAGE_SIZE, fs0[ri0[inodekey(m)]] = inodenode(key1, md0, false, m3, 0, m5), fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf0), orphans(fs0, ri0).inodes?, fo.inodes?, n * VFS_PAGE_SIZE < n1, n * VFS_PAGE_SIZE < m2, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), 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)]), file-node-cons(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])), log-cons(log0, fs0), 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)) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), 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)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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 '), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), 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])), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), 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 '), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, VFS_PAGE_SIZE ≤ # buf0, m2 ≤ n1, asynced0 → boolvar0 ⊦ m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, n = m2 / VFS_PAGE_SIZE, buf-opt0.some?, adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, ( n ∈ abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)] ↔ datakey(m, n) ∈ ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]) ∧ ( n ∈ abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)] → abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)][n] = (adr3 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ;(adr2 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ inodenode(inodekey(m), md, false, m3, 0, n1) ;(adr1 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ truncnode(inodekey(m), m2) ;fs0[(datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)])] ) ) ) .data)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ datakey(ino, n) ∈ ri → abs-content(ino, fs, ri)[n] = fs[ri[datakey(ino, n)]].data; (s)% ⊦ n ≠ n0 → content[n0, buf][n] = content[n]; (s)% ⊦ n ∈ abs-content(ino, fs, ri) ↔ datakey(ino, n) ∈ ri; (s)% ⊦ n ≠ n0 → (n ∈ content[n0, buf] ↔ n ∈ content); (s)