| lpt[m3] = mklp(m, m4, lpf, m5), lpt[n] = mklp(m0, m1, lpf0, m2), n < # lpt, m3 < # lpt, ∀ lpt, n, m0, m1, lpf0, m2, n0, n1, lpf1, n2, nx. lpt[n] = mklp(m0, m1, lpf0, m2) ∧ n < # lpt ∧ m3 ≤ # lpt → gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx, m3) = gc-heap(lpt, nx, m3) ∨ lpf0 = LP_GROUP_NODES ∨ lpf1 = LP_GROUP_NODES ⊦ lpf0 = LP_GROUP_NODES, lpf1 = LP_GROUP_NODES, gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx, m3) ∪ (¬ m3 ∈ nx ∧ lpt[n, mklp(n0, n1, lpf1, n2)][m3].flags = LP_GROUP_NODES ⊃ ∅ ++ key-index(m, m3);∅) = gc-heap(lpt, nx, m3) ∪ (¬ m3 ∈ nx ∧ lpf = LP_GROUP_NODES ⊃ ∅ ++ key-index(m, m3);∅) |
lpt[n] = mklp(m0, m1, lpf0, m2), lpt[m3] = mklp(m, m4, lpf, m5), lpt[n, mklp(n0, n1, lpf1, n2)][m3] = mklp(m6, m7, lpf2, m8), m3 < # lpt, n < # lpt, ∀ lpt, n, m0, m1, lpf0, m2, n0, n1, lpf1, n2, nx. lpt[n] = mklp(m0, m1, lpf0, m2) ∧ n < # lpt ∧ m3 ≤ # lpt → gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx, m3) = gc-heap(lpt, nx, m3) ∨ lpf0 = LP_GROUP_NODES ∨ lpf1 = LP_GROUP_NODES ⊦ lpf0 = LP_GROUP_NODES, lpf1 = LP_GROUP_NODES, gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx, m3) ∪ (¬ m3 ∈ nx ∧ lpf2 = LP_GROUP_NODES ⊃ ∅ ++ key-index(m, m3);∅) = gc-heap(lpt, nx, m3) ∪ (¬ m3 ∈ nx ∧ lpf = LP_GROUP_NODES ⊃ ∅ ++ key-index(m, m3);∅)
Used simplifier rules: ⊦ ((m = lp.ref-size ∧ m0 = lp.size) ∧ lpf = lp.flags) ∧ m1 = lp.gcheapidx ↔ lp = mklp(m, m0, lpf, m1); (elim) Used terms: lpt[n, mklp(n0, n1, lpf1, n2)][m3], m6, m7, lpf2, m8