[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 101 from proof write-loop-0 (previous step)

VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0) ≠ 0, inode.ino ∈ files, ino2 + ino5 ≤ ino1, ino5 = 0 → files = files1 ⊦ [fail#(; ; err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino5, mkbuf(VFS_PAGE_SIZE), (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0)); afs_writepage#(inode, (ino2 + ino5) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: inode name: elim seq: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2) subst: [inode, m, md, boolvar, m0, m1, m2] → [inode, m, md, boolvar, m0, m1, m2]

Additional information

Used simplifier rules: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim) Used terms: inode, m, md, boolvar, m0, m1, m2