| abs-nodes(buf0, m + # buf1, nd ' + x + x1, @(m0, m1) ' + lax0, weak), abs-padding(buf1), ∃ buf3, buf, lax2, lax1. @(m0, m1) ' + lax0 = lax2 + lax1 ∧ buf0 = buf3 + buf ∧ abs-nodes(buf3, m + # buf1, nd ' + x, lax2, false) ∧ abs-nodes(buf, (m + # buf1) + # buf3, x1, lax1, weak), ∀ buf2, m, x0, x1, lax, weak. # buf2 < #(buf1 + buf0) → abs-nodes(buf2, m, x0 + x1, lax, weak) → (∃ buf3, buf1, lax0, lax1. lax = lax0 + lax1 ∧ buf2 = buf3 + buf1 ∧ abs-nodes(buf3, m, x0, lax0, false) ∧ abs-nodes(buf1, m + # buf3, x1, lax1, weak)) ⊦ ∃ buf3, buf2, lax2, lax1. @(m0, m1) ' + lax0 = lax2 + lax1 ∧ buf1 + buf0 = buf3 + buf2 ∧ abs-nodes(buf3, m, nd ' + x, lax2, false) ∧ abs-nodes(buf2, m + # buf3, x1, lax1, weak) |
@(m0, m1) ' + lax0 = lax1 + lax, abs-nodes(buf2 + buf, m + # buf1, nd ' + x + x1, lax1 + lax, weak), abs-nodes(buf, (m + # buf1) + # buf2, x1, lax, weak), abs-nodes(buf2, m + # buf1, nd ' + x, lax1, false), abs-padding(buf1), @(m0, m1) ∈ lax1 ∨ @(m0, m1) ∈ lax, ∀ buf3, m, x0, x1, lax, weak. # buf3 < #(buf1 + buf2 + buf) → abs-nodes(buf3, m, x0 + x1, lax, weak) → (∃ buf4, buf1, lax0, lax1. lax = lax0 + lax1 ∧ buf3 = buf4 + buf1 ∧ abs-nodes(buf4, m, x0, lax0, false) ∧ abs-nodes(buf1, m + # buf4, x1, lax1, weak)) ⊦ ∃ buf3, buf4, lax2, lax1. @(m0, m1) ' + lax0 = lax2 + lax1 ∧ buf1 + buf2 + buf = buf3 + buf4 ∧ abs-nodes(buf3, m, nd ' + x, lax2, false) ∧ abs-nodes(buf4, m + # buf3, x1, lax1, weak)
Used simplifier rules: ⊦ ladr ∈ lax + lax0 ↔ ladr ∈ lax ∨ ladr ∈ lax0; (s)%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]%in-14: ⊦ ladr ' + lax = lax0 → ladr ∈ lax0; (forward) from specification list[laddress-list]