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

fs0[ri0[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), inodekey(ino) = inodekey(m), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[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), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, inodekey(ino) ∈ ri0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced0 → boolvar0 ⊦ adr1 = adr2, m = 0, adr2 ∈ fs0, adr1 ∈ fs0, ( ¬ fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ ri0[inodekey(m), adr2] ∧ ¬ (adr2 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ truncnode(inodekey(m), min(n0, m2));fs0[(m = ino ⊃ adr2;ri0[inodekey(ino)])]) ) .directory) ∧ ( ¬ fs0[ri0[inodekey(ino)]].directory → (ino = m ⊃ mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2)) ;mkfile(fs0[ri0[inodekey(ino)]].size, fs0[ri0[inodekey(ino)]].meta, fs0[ri0[inodekey(ino)]].nlink, abs-content(ino, fs0, ri0)) ) = mkfile ((adr2 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ truncnode(inodekey(m), min(n0, m2));fs0[(m = ino ⊃ adr2;ri0[inodekey(ino)])]) ) .size, (adr2 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ truncnode(inodekey(m), min(n0, m2));fs0[(m = ino ⊃ adr2;ri0[inodekey(ino)])]) ) .meta, (adr2 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ truncnode(inodekey(m), min(n0, m2));fs0[(m = ino ⊃ adr2;ri0[inodekey(ino)])]) ) .nlink, abs-content (ino, fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])))), m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ (datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0 ∨ buf-opt0.some?), m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 1318:
fs0[ri0[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))]), file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, asynced0 → boolvar0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE ⊦ adr1 = adr2, m = 0, adr1 ∈ fs0, adr2 ∈ fs0, m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0, m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ (datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0 ∨ buf-opt0.some?), ( n * VFS_PAGE_SIZE < min(n0, m2) ∧ datakey(m, n) ∈ ri0 ↔ datakey(m, n) ∈ ri0[inodekey(m), adr2] ∧ (¬ datakey(m, n) ∈ ri0 ∨ ¬ min(n0, m2) ≤ n * VFS_PAGE_SIZE)) ∧ ( n * VFS_PAGE_SIZE < min(n0, m2) ∧ datakey(m, n) ∈ ri0 → (abs-content(m, fs0, ri0) upto min(n0, m2))[n] = (adr2 = ri0[datakey(m, n)] ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = ri0[datakey(m, n)] ⊃ truncnode(inodekey(m), min(n0, m2));fs0[ri0[datakey(m, n)]]) ) .data)

Rule argument

Additional information

Used simplifier rules: at-ri: ⊦ ri[key, adr][key0] = (key = key0 ⊃ adr;ri[key0]);% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ inodekey(m) ≠ datakey(m0, m1); (s)% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ (ri \ ks)[key] = (key ∈ ks ⊃ (∅)[key];ri[key]); (s)% ⊦ datakey(m, m0).part = m0; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ datakey(m, m0).ino = m; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ datakey(m, m0).data?; (s)%⊦ key ∈ datakeys(key0, ri) ↔ key ∈ ri ∧ key.data? ∧ key0.inode? ∧ key.ino = key0.ino; (s)% ⊦ datakeys(key, ri[inodekey(ino), adr]) = datakeys(key, ri); (s)%⊦ key ∈ datakeys(key0, n, ri) ↔ key ∈ datakeys(key0, ri) ∧ n ≤ key.part * VFS_PAGE_SIZE; (s)% ⊦ key ∈ ri \ ks ↔ key ∈ ri ∧ ¬ key ∈ ks; (ls)% ⊦ n ∈ abs-content(ino, fs, ri) ↔ datakey(ino, n) ∈ ri; (s)% ⊦ m ∈ content upto n ↔ m * VFS_PAGE_SIZE < n ∧ m ∈ content; (s)%⊦ content = abs-content(ino, fs, ri) ↔ (∀ n. (n ∈ content ↔ datakey(ino, n) ∈ ri) ∧ (n ∈ content → content[n] = fs[ri[datakey(ino, n)]].data)); (ss)%⊦ mkfile(m0, md0, n0, content0) = mkfile(m1, md1, n1, content1) ↔ ¬(n0 ≠ n1 ∨ md0 ≠ md1 ∨ m0 ≠ m1 ∨ content0 ≠ content1); (ss)% ⊦ key ∈ ri[key, adr]; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).meta = md; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)