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

# content0[m2] = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n1 + n0, files2[ino4] = mkfile(m2 * VFS_PAGE_SIZE + n0, md, # links(ino4, dirs0), content0), n0 < VFS_PAGE_SIZE, afs-cons(dirs0, files2), afs-cons (dirs0, files2 [ino4, mkfile(m2 * VFS_PAGE_SIZE + n0, md, # links(ino4, dirs0), content0[m2, fill(content0[m2], zero, n0, n1)] upto (m2 * VFS_PAGE_SIZE + n0)) ]), files2 ~ files2 [ino4, mkfile(m2 * VFS_PAGE_SIZE + n0, md, # links(ino4, dirs0), content0[m2, fill(content0[m2], zero, n0, n1)] upto (m2 * VFS_PAGE_SIZE + n0)) ], ino4 ∈ files2, m2 ∈ content0 ⊦ ( (content0.stream to m2 * VFS_PAGE_SIZE) + (((content0.stream from m2 * VFS_PAGE_SIZE) to VFS_PAGE_SIZE to n0) + (σ⊥ to n1)) + (content0.stream from VFS_PAGE_SIZE * m2 + VFS_PAGE_SIZE) to VFS_PAGE_SIZE * m2 + VFS_PAGE_SIZE) + σ⊥ from m2 * VFS_PAGE_SIZE + n0 = σ⊥, n0 = 0, n1 = 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ0 + σ3) + σ4 = σ0 + σ3 + σ4; from specification stream[buffer-inf]%¬ # σ0 < ⌜n⌝ ⊦ m < n → σ0 to n to m = σ0 to m; (s)% ⊦ ¬ ∞ < n∞; (s)% ⊦ #(content.stream from n) = ∞; (s)%⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n0, content) ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE; (s)