[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 1 from proof Uniform-heap (conclusion) (back to tree)

¬ null ∈ h, hP(∅), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h) ⊦ hP(h)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof Uniform-heap (previous step) (back to tree)

hP(∅), ¬ hP(h), ¬ null ∈ h, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r) ⊦

User applied rule induction

And obtained the following new goals

Rule argument

indvar: # h wfpred: <

Additional information

Used simplifier rules: <; (wellfounded) Used terms: # h

Proof step 3 from proof Uniform-heap (previous step) (back to tree)

hP(∅), ¬ hP(h), ¬ null ∈ h, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: h = ∅

Additional information

Used simplifier rules: ⊦ ¬ a ∈ ∅; (s) Used formulas: h = ∅

Proof step 4 from proof Uniform-heap (previous step) (back to tree)

h ≠ ∅, hP(∅), ¬ hP(h), ¬ null ∈ h, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: map, name:Extension, seq: ⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1(a) = st2(a)), subst:[st1, st2] → [h, ∅]; [A, B] → [Ref[A], A], lhs:h = ∅, <all paths>

Additional information

Used terms: h, ∅

Proof step 5 from proof Uniform-heap (previous step) (back to tree)

⊦ st1 = st2 ↔ (∀ a. (a ∈ st1 ↔ a ∈ st2) ∧ st1(a) = st2(a))

A spec-lemma

Proof step 6 from proof Uniform-heap (previous step) (back to tree)

hP(∅), ¬ hP(h), ¬ null ∈ h, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∃ r. ¬((r ∈ h ↔ r ∈ ∅) ∧ h(r) = ∅(r)), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ ∅; (s)

Proof step 7 from proof Uniform-heap (previous step) (back to tree)

hP(∅), ¬ hP(h), ¬ null ∈ h, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦ ¬ r ∈ h ∧ h(r) = ∅(r)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: map, name:notmemlookup, seq: ⊦ ¬ a ∈ st → st(a) = ∅(a), subst:[st, a] → [h, r]; [A, B] → [Ref[A], A], lhs:h(r), <all paths>

Additional information

Used terms: h, r

Proof step 8 from proof Uniform-heap (previous step) (back to tree)

⊦ ¬ a ∈ st → st(a) = ∅(a)

A spec-lemma

Proof step 9 from proof Uniform-heap (previous step) (back to tree)

hP(∅), r ∈ h, ¬ hP(h), ¬ null ∈ h, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦ ¬ r ∈ h ∧ h(r) = ∅(r)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof Uniform-heap (previous step) (back to tree)

hP(∅), r ∈ h, ¬ hP(h), ¬ null ∈ h, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: map, name:exin, seq: ⊦ a ∈ st ↔ (∃ d, st0. st = st0(a := d) ∧ ¬ a ∈ st0), subst:[a, st] → [r, h]; [A, B] → [Ref[A], A], lhs:r ∈ h, <all paths>

Additional information

Used terms: r, h

Proof step 11 from proof Uniform-heap (previous step) (back to tree)

⊦ a ∈ st ↔ (∃ d, st0. st = st0(a := d) ∧ ¬ a ∈ st0)

A spec-lemma

Proof step 12 from proof Uniform-heap (previous step) (back to tree)

hP(∅), ¬ hP(h), ¬ null ∈ h, ∃ a0, st0. h = st0(r := a0) ∧ ¬ r ∈ st0, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h0, hP. # h0 < # h → hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ st(b := d) ↔ a = b ∨ a ∈ st; (s)

Proof step 13 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: h0 +h r, r, a0 abort: F discard: F computed: F

Additional information

Used terms: h0 +h r, r, a0

Proof step 14 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ¬ null ∈ h0 +h r → hP(h0 +h r) → hP((h0 +h r)[r := a0]h), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ¬ r ∈ h, r ≠ null ⊦ r0 ∈ h +h r ↔ r0 ∈ h ∨ r0 = r; (s)

Proof step 15 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), hP(h0 +h r) → hP((h0 +h r)[r := a0]h), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: h0, r abort: F discard: F computed: T

Additional information

Used terms: h0, r

Proof step 16 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), hP(h0 +h r) → hP((h0 +h r)[r := a0]h), ¬ null ∈ h0 → hP(h0) → hP(h0 +h r), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), hP(h0 +h r) → hP((h0 +h r)[r := a0]h), hP(h0) → hP(h0 +h r), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [h1, hP] → [h0, hP]

Additional information

Used simplifier rules: ⊦ ¬ a ∈ st → # st(a := d) = # st + 1; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: h0, hP

Proof step 18 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), hP(h0) → hP(h0 +h r), hP(h0 +h r) → hP((h0 +h r)[r := a0]h), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦ hP(∅) ∧ ¬ hP(h0) ∧ ¬ null ∈ h0 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof Uniform-heap (previous step) (back to tree)

null ≠ r, hP(∅), hP(h0), hP(h0 +h r), hP((h0 +h r)[r := a0]h), ¬ hP(h0(r := a0)), ¬ null ∈ h0, ¬ r ∈ h0, ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h), ∀ h1, hP. # h1 < # h0(r := a0) → hP(∅) ∧ ¬ hP(h1) ∧ ¬ null ∈ h1 ∧ (∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h)) ∧ (∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r)) → false ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: heapmap, name:put-def, seq: ⊦ r ∈ h → h[r := a]h = h(r := a), subst:[h, r, a] → [h0 +h r, r, a0]; [A] → [A], lhs:(h0 +h r)[r := a0]h, <all paths>

Additional information

Used simplifier rules: ¬ r ∈ h, r ≠ null ⊦ r0 ∈ h +h r ↔ r0 ∈ h ∨ r0 = r; (s) r ≠ null, ¬ r ∈ h ⊦ (h +h r)(r := a) = h(r := a); (s) ⊦ ¬ r ∈ h → h[r := a]h = h; (s) Used terms: h0 +h r, r, a0

Proof step 20 from proof Uniform-heap (previous step) (back to tree)

⊦ r ∈ h → h[r := a]h = h(r := a)

A spec-lemma

Proof Tree for Uniform-heap (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree