[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 33 from proof btree-clean-fwd (previous step)

# asar2 = m + 1, # asar1 = m + 1, # zbrar = BRANCH_SIZE, # asar0 = m + 1, # asar = m + 1, # zbrar0 = BRANCH_SIZE, union(asar2, 0, m + 1) = alladrs1 -- adr, union(asar1, 0, m + 1) = alladrs1 -- adr, union(asar0, 0, m + 1) = alladrs0 -- adr, union(asar, 0, m + 1) = alladrs0 -- adr, (( (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r, zbrar[n].child, zbrar[n].adr, height0, false, key-range(zbrar, n, m + 1, ri1), iast, asar1[n], asar2[n], ok) )⊗_ (0, m + 1 ) * P1) )(zh3), (( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(r2, zbrar0[n].child, zbrar0[n].adr, height, false, key-range(zbrar0, n, m + 1, ri0), iast, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * P0) )(zh), m < BRANCH_SIZE, ((r => mkznode(rp1, zbrar, false, false, m + 1)))(zh4), ((r2 => mkznode(rp0, zbrar0, false, false, m + 1)))(zh5), disj(asar2, 0, m + 1), disj(asar1, 0, m + 1), disj(asar0, 0, m + 1), disj(asar, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar, 0, m), sorted(zbrar0, 0, m), unmodified(adr, mkznode(rp0, zbrar0, false, false, m + 1), iast), unmodified(adr, mkznode(rp1, zbrar, false, false, m + 1), iast), adr ∈ alladrs0, adr ∈ alladrs1, adr ∈ iast, alladrs0 ⊆ dom iast, alladrs1 ⊆ dom iast, zh4 ⊥ zh3, zh5 ⊥ zh, (r1 = null ⊃ P1(zh1);r = r1 ∧ zh4 ∪ zh3 = zh1), (r0 = null ⊃ P0(zh0);r2 = r0 ∧ zh5 ∪ zh = zh0), ∀ rp0, r0, adr, ri0, iast, as0, alladrs0, nstat, P0, zh0, rp1, r1, height1, ri1, as1, alladrs1, P1, zh1. ((btree(rp0, r0, adr, height, false, ri0, iast, as0, alladrs0, nstat) * P0))(zh0) ∧ ((btree(rp1, r1, adr, height1, false, ri1, iast, as1, alladrs1, nstat) * P1))(zh1) → height = height1 ∧ as0 = as1 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1 ⊦ # alladrs0 = 0, # alladrs1 = 0, alladrs0 = ∅, alladrs1 = ∅, height = height0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 34:
⊦ nP0 ⊗_(n, m + 1) = nP0(n) * nP0 ⊗_(n + 1, m)
Proof step 35:
# zbrar0 = BRANCH_SIZE, # asar = m + 1, # asar0 = m + 1, # zbrar = BRANCH_SIZE, # asar1 = m + 1, # asar2 = m + 1, union(asar, 0, m + 1) = alladrs0 -- adr, union(asar0, 0, m + 1) = alladrs0 -- adr, union(asar1, 0, m + 1) = alladrs1 -- adr, union(asar2, 0, m + 1) = alladrs1 -- adr, (( (λ n. ⌜zbrar0[n].branch?⌝ ∧ btree(r2, zbrar0[n].child, zbrar0[n].adr, height, false, key-range(zbrar0, n, m + 1, ri0), iast, asar[n], asar0[n], ok) )⊗_ (0, m + 1 ) * P0) )(zh), (( ( (⌜zbrar[0].branch?⌝ ∧ btree(r, zbrar[0].child, zbrar[0].adr, height0, false, key-range(zbrar, 0, m + 1, ri1), iast, asar1[0], asar2[0], ok)) * (λ n. ⌜zbrar[n].branch?⌝ ∧ btree(r, zbrar[n].child, zbrar[n].adr, height0, false, key-range(zbrar, n, m + 1, ri1), iast, asar1[n], asar2[n], ok) )⊗_ (0 + 1, m )) * P1) )(zh3), m < BRANCH_SIZE, ((r2 => mkznode(rp0, zbrar0, false, false, m + 1)))(zh5), ((r => mkznode(rp1, zbrar, false, false, m + 1)))(zh4), disj(asar, 0, m + 1), disj(asar0, 0, m + 1), disj(asar1, 0, m + 1), disj(asar2, 0, m + 1), nsize(m + 1, nstat), sorted(zbrar0, 0, m), sorted(zbrar, 0, m), unmodified(adr, mkznode(rp1, zbrar, false, false, m + 1), iast), unmodified(adr, mkznode(rp0, zbrar0, false, false, m + 1), iast), adr ∈ iast, adr ∈ alladrs1, adr ∈ alladrs0, alladrs1 ⊆ dom iast, alladrs0 ⊆ dom iast, zh5 ⊥ zh, zh4 ⊥ zh3, (r0 = null ⊃ P0(zh0);r2 = r0 ∧ zh5 ∪ zh = zh0), (r1 = null ⊃ P1(zh1);r = r1 ∧ zh4 ∪ zh3 = zh1), ∀ rp0, r0, adr, ri0, iast, as0, alladrs0, nstat, P0, zh0, rp1, r1, height1, ri1, as1, alladrs1, P1, zh1. ((btree(rp0, r0, adr, height, false, ri0, iast, as0, alladrs0, nstat) * P0))(zh0) ∧ ((btree(rp1, r1, adr, height1, false, ri1, iast, as1, alladrs1, nstat) * P1))(zh1) → height = height1 ∧ as0 = as1 ∧ ri0 = ri1 ∧ alladrs0 = alladrs1 ⊦ # alladrs1 = 0, # alladrs0 = 0, alladrs0 = ∅, alladrs1 = ∅, height = height0

Rule argument

spec: iter-n, inst: zheap name: Sep-rec seq: ⊦ nP0 ⊗_(n, m + 1) = nP0(n) * nP0 ⊗_(n + 1, m) subst: [m, n, nP0] → [m, 0, λ n. ⌜zbrar[n].branch?⌝ ∧ btree (r, zbrar[n].child, zbrar[n].adr, height0, false, key-range(zbrar, n, m + 1, ri1), iast, asar1[n], asar2[n], ok)] flags: <all paths>

Additional information

Used terms: m, 0, λ n. ⌜zbrar[n].branch?⌝ ∧ btree (r, zbrar[n].child, zbrar[n].adr, height0, false, key-range(zbrar, n, m + 1, ri1), iast, asar1[n], asar2[n], ok)