[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 12 from proof read-inv-rec (previous step)

# buf1 = n4 + n + min(n3, n2, n1), # buf0 = # buf1, VFS_PAGE_SIZE = n2 + (n0 + n) % VFS_PAGE_SIZE, files[ino] = mkfile(n1 + n0 + n, md, # links(ino, dirs), content), ⌜buf1⌝ = ((content.stream from n0) to n) + (⌜buf0⌝ from n), afs-cons(dirs, files), ino ∈ files, n3 + n ≤ # buf1, n + min(n3, n2, n1) ≤ # buf1, (n0 + n) % VFS_PAGE_SIZE + min(n3, n2, n1) ≤ VFS_PAGE_SIZE ⊦ (⌜buf1⌝ to n) + ((⌜getpage((n0 + n) / VFS_PAGE_SIZE, content)⌝ from (n0 + n) % VFS_PAGE_SIZE) to min(n3, n2, n1)) + (⌜buf1⌝ from n + min(n3, n2, n1)) = ((content.stream from n0) to min(n3, n2, n1) + n) + (⌜buf0⌝ from min(n3, n2, n1) + n)

User applied rule insert equation

And obtained the following new goals

Proof step 13:
# buf0 = # buf1, # buf1 = n4 + n + min(n3, n2, n1), VFS_PAGE_SIZE = n2 + (n0 + n) % VFS_PAGE_SIZE, files[ino] = mkfile(n1 + n0 + n, md, # links(ino, dirs), content), afs-cons(dirs, files), ino ∈ files, (n0 + n) % VFS_PAGE_SIZE + min(n3, n2, n1) ≤ VFS_PAGE_SIZE, n + min(n3, n2, n1) ≤ # buf1, n3 + n ≤ # buf1 ⊦ (((content.stream from n0) to n) + (⌜buf0⌝ from n) to n) + ((⌜getpage((n0 + n) / VFS_PAGE_SIZE, content)⌝ from (n0 + n) % VFS_PAGE_SIZE) to min(n3, n2, n1)) + (((content.stream from n0) to n) + (⌜buf0⌝ from n) from n + min(n3, n2, n1)) = ((content.stream from n0) to min(n3, n2, n1) + n) + (⌜buf0⌝ from min(n3, n2, n1) + n)

Rule argument

pos: left 5 flags: discard

Proof step 12 from proof read-inv-rec (previous step)

User applied rule insert equation

And obtained the following new goals

Rule argument

Additional information