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

# zbrar0 = BRANCH_SIZE, # asar = # asar0, # asar2 = # asar0, # asar1 = # asar0, # zbrar = BRANCH_SIZE, # asar0 = (n0 + 1) + n, zbrar0[n] = mkzbranch(key, adr0, r4), zbrar[n] = mkzbranch(key, adr0, r3), asar1[n] = asar2[n], asar[n] = asar0[n], union(asar1, 0, # asar0) = union(asar2, 0, # asar0), union(asar, 0, # asar0) = union(asar0, 0, # asar0), (( btree(r2, r4, adr0, height, false, key-range(zbrar0, n, # asar0, ri0), iast, asar0[n], asar0[n], ok) * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree(r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar0, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (0, n ) * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree(r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar0, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (1 + n, n0 ) * P0) )(zh), (( ( ( btree(r, r3, adr0, height0, false, key-range(zbrar, n, # asar0, ri1), iast, asar2[n], asar2[n], ok) * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree(r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar0, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (0, n )) * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree(r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar0, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (1 + n, n0 )) * P1) )(zh3), n < BRANCH_SIZE, n0 + n < BRANCH_SIZE, ((r => mkznode(rp1, zbrar, false, false, # asar0)))(zh4), ((r2 => mkznode(rp0, zbrar0, false, false, # asar0)))(zh5), disj(asar2, 0, # asar0), disj(asar1, 0, # asar0), disj(asar0, 0, # asar0), disj(asar, 0, # asar0), nsize(# asar0, nstat), sorted(zbrar, 0, n0 + n), sorted(zbrar0, 0, n0 + n), unmodified(adr, mkznode(rp0, zbrar0, false, false, # asar0), iast), unmodified(adr, mkznode(rp1, zbrar, false, false, # asar0), iast), adr ∈ iast, asar0[n] ⊆ dom iast, asar2[n] ⊆ 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, ∀ n1. ¬ n0 + n < n1 → asar2[n1] ⊆ dom iast, ∀ n1. ¬ n0 + n < n1 → asar0[n1] ⊆ dom iast ⊦ asar0[n] = asar2[n], union(asar0, 0, # asar0) = union(asar2, 0, # asar0), adr ∈ union(asar0, 0, # asar0), adr ∈ union(asar2, 0, # asar0)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 35 terms: r2, r4, adr0, key-range(zbrar0, n, # asar, ri0), iast, asar[n], asar0[n], ok, P0 * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree (r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (1 + n, n0 ) * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree (r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (0, n ), zh, r, r3, height0, key-range(zbrar, n, # asar, ri1), asar1[n], asar2[n], P1 * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree (r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (1 + n, n0 ) * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree (r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (0, n ), zh3

Additional information

Used simplifier rules: sep-ass: ⊦ (P * P3) * P4 = P * P3 * P4; from specification heap-sep[zheap]%sep-com: ⊦ P * P2 = P2 * P; from specification heap-sep[zheap] Used terms: r2, r4, adr0, key-range(zbrar0, n, # asar, ri0), iast, asar[n], asar0[n], ok, P0 * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree (r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (1 + n, n0 ) * (λ n1. ⌜zbrar0[n1].branch?⌝ ∧ btree (r2, zbrar0[n1].child, zbrar0[n1].adr, height, false, key-range(zbrar0, n1, # asar, ri0), iast, asar[n1], asar0[n1], ok) )⊗_ (0, n ), zh, r, r3, height0, key-range(zbrar, n, # asar, ri1), asar1[n], asar2[n], P1 * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree (r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (1 + n, n0 ) * (λ n1. ⌜zbrar[n1].branch?⌝ ∧ btree (r, zbrar[n1].child, zbrar[n1].adr, height0, false, key-range(zbrar, n1, # asar, ri1), iast, asar1[n1], asar2[n1], ok) )⊗_ (0, n ), zh3