[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 behcan-limitclosed (conclusion) (back to tree)

⊦ traceprop(tP) → limit-closed(albeh(can(tP)))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof behcan-limitclosed (previous step) (back to tree)

traceprop(tP), ¬ limit-closed(albeh(can(tP))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof behcan-limitclosed (previous step) (back to tree)

traceprop(tP), ¬ limit-closed(albeh(can(tP))) ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

term: can(tP)

Additional information

Used simplifier rules: ALIOAutomaton freely generated by ALIOAut;;

Proof step 4 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ¬ limit-closed(albeh(can(tP))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ¬ limit-closed(albeh(ALIOAut(alstartf, alstepf))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: beh[can-inst], name:lemma_2-5-2, seq: ⊦ fin(ALIOAut(startf, stepf)) → limit-closed(albeh(ALIOAut(startf, stepf))), subst:[startf, stepf] → [alstartf, alstepf]

Additional information

Used terms: alstartf, alstepf

Proof step 6 from proof behcan-limitclosed (previous step) (back to tree)

⊦ fin(ALIOAut(startf, stepf)) → limit-closed(albeh(ALIOAut(startf, stepf)))

A spec-lemma

Proof step 7 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ¬ limit-closed(albeh(ALIOAut(alstartf, alstepf))), fin(ALIOAut(alstartf, alstepf)) → limit-closed(albeh(ALIOAut(alstartf, alstepf))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ¬ fin(ALIOAut(alstartf, alstepf)), ¬ limit-closed(albeh(ALIOAut(alstartf, alstepf))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 4

Additional information

Proof step 9 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ¬ fin(ALIOAut(alstartf, alstepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: restricted[can-inst], name:finiteinvisiblenondet, seq:⊦ fin(ALIOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl), subst:[stepf, startf] → [alstepf, alstartf], <all paths>

Additional information

Used terms: alstepf, alstartf

Proof step 10 from proof behcan-limitclosed (previous step) (back to tree)

⊦ fin(ALIOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl)

A spec-lemma

Proof step 11 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), (∀ alli. ¬(∀ al. alstartf(al) ↔ al ∈ alli)) ∨ (∃ al, β. ¬(∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, β, al0) ↔ al0 ∈ alli)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 12 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), (∀ alli. ¬(∀ al. alstartf(al) ↔ al ∈ alli)) ∨ ¬(∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ alli) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 13 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ∀ alli. ¬(∀ al. alstartf(al) ↔ al ∈ alli) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: can, name:canonical-def, seq:⊦ can(tP) = ALIOAut (λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )), subst:[tP] → [tP], <all paths>

Additional information

Used terms: tP

Proof step 14 from proof behcan-limitclosed (previous step) (back to tree)

⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ ))

A spec-lemma

Proof step 15 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )), traceprop(tP), ∀ alli. ¬(∀ al. alstartf(al) ↔ al ∈ alli) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ALIOAut(startf, stepf) = ALIOAut(startf0, stepf0) ↔ startf = startf0 ∧ stepf = stepf0; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 16 from proof behcan-limitclosed (previous step) (back to tree)

traceprop(tP), ∀ alli. ¬(∀ al. al = [] ↔ al ∈ alli) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 2 terms: [] ' abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) Used terms: [] '

Proof step 17 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP) ⊦ ∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ alli

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: [] abort: F discard: F computed: F

Additional information

Used terms: []

Proof step 18 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP) ⊦ ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ [], ∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), almove(ALIOAut(alstartf, alstepf))(al, α, al0), traceprop(tP) ⊦ ∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ alli

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:move, seq:⊦ almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. alfrag*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s1, startf, s2, β] → [alstepf, al, alstartf, al0, α], <all paths>

Additional information

Used terms: al0, α, al, alstepf, alstartf

Proof step 20 from proof behcan-limitclosed (previous step) (back to tree)

⊦ almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. alfrag*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 21 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), traceprop(tP), ∃ α0, alli. alfrag*(ALIOAut(alstartf, alstepf))(⌜alli⌝ , α0) ∧ al = alli[0] ∧ al0 = alli.last ∧ α0 ^ = α ⊦ ∃ alli. ∀ al0. almove(ALIOAut(alstartf, alstepf))(al, α, al0) ↔ al0 ∈ alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ alfrag*(ALIOAut(startf, stepf))(σ, β) ↔ alfrag(ALIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 22 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∃ alli0. ∀ al0. almove(ALIOAut(alstartf, alstepf))(alli[0], ⌜al⌝ ^, al0) ↔ al0 ∈ alli0

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: can, name:frag-lem-2, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ ⌜al⌝ ^ = ⌜al⌝ , subst:[tP, alli, al] → [tP, alli, al]

Additional information

Used terms: tP, alli, al

Proof step 23 from proof behcan-limitclosed (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ ⌜al⌝ ^ = ⌜al⌝

A spec-lemma

Proof step 24 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∃ alli0. ∀ al0. almove(ALIOAut(alstartf, alstepf))(alli[0], ⌜al⌝ ^, al0) ↔ al0 ∈ alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 25 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∃ alli0. ∀ al0. almove(ALIOAut(alstartf, alstepf))(alli[0], ⌜al⌝ , al0) ↔ al0 ∈ alli0

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: (alli[0] + al)' abort: F discard: T computed: F

Additional information

Used terms: (alli[0] + al)'

Proof step 26 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∀ al0. almove(ALIOAut(alstartf, alstepf))(alli[0], ⌜al⌝ , al0) ↔ al0 ∈ (alli[0] + al)'

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 27 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , ¬(almove(ALIOAut(alstartf, alstepf))(alli[0], ⌜al⌝ , al0) ↔ al0 = alli[0] + al), alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:move, seq:⊦ almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. alfrag*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s1, startf, s2, β] → [alstepf, alli[0], alstartf, al0, ⌜al⌝ ], <all paths>

Additional information

Used terms: al0, ⌜al⌝ , alli[0], alstepf, alstartf

Proof step 28 from proof behcan-limitclosed (previous step) (back to tree)

⊦ almove(ALIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. alfrag*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 29 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ (∃ α, alli0. alfrag*(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , α) ∧ alli[0] = alli0[0] ∧ al0 = alli0.last ∧ α ^ = ⌜al⌝ ) ↔ al0 = alli[0] + al

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ alfrag*(ALIOAut(startf, stepf))(σ, β) ↔ alfrag(ALIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 30 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ (∃ α, alli0. alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , α) ∧ finp(α) ∧ alli[0] = alli0[0] ∧ al0 = alli0.last ∧ α ^ = ⌜al⌝ ) ↔ al0 = alli[0] + al

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 31 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , al0 ≠ alli[0] + al, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP), ∃ α, alli0. alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , α) ∧ finp(α) ∧ alli[0] = alli0[0] ∧ al0 = alli0.last ∧ α ^ = ⌜al⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 32 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[0] = alli0[0], ⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ ^ = ⌜al⌝ , alli0.last ≠ alli0[0] + al, alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: can, name:frag-lem-2, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ ⌜al⌝ ^ = ⌜al⌝ , subst:[tP, alli, al] → [tP, alli0, al0]

Additional information

Used terms: tP, alli0, al0

Proof step 33 from proof behcan-limitclosed (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ ⌜al⌝ ^ = ⌜al⌝

A spec-lemma

Proof step 34 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[0] = alli0[0], ⌜al⌝ ^ = ⌜al⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0⌝ ^ = ⌜al0⌝ , alli0.last ≠ alli0[0] + al, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s)

Proof step 35 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[0] = alli0[0], ⌜al0⌝ ^ = ⌜al0⌝ , alli0.last ≠ alli0[0] + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: can, name:frag-det, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0, subst:[tP, alli, al, alli0] → [tP, alli, al0, alli0]

Additional information

Used terms: tP, alli, al0, alli0

Proof step 36 from proof behcan-limitclosed (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0

A spec-lemma

Proof step 37 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[0] = alli0[0], ⌜al0⌝ ^ = ⌜al0⌝ , alli = alli0, alli0.last ≠ alli0[0] + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al0⌝ ^ = ⌜al0⌝ , alli0.last ≠ alli0[0] + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: can, name:frag-lem, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n), subst:[tP, alli, al, n] → [tP, alli0, al0, # al0]

Additional information

Used simplifier rules: ⊦ alfrag(ALIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# al < # sl ↔ true); (ss) Used terms: tP, alli0, al0, # al0

Proof step 39 from proof behcan-limitclosed (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)

A spec-lemma

Proof step 40 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli0[# al0] = alli0[0] + (al0 to # al0), ⌜al0⌝ ^ = ⌜al0⌝ , alli0.last ≠ alli0[0] + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x to # x = x; (s)

Proof step 41 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli0[# al0] = alli0[0] + al0, ⌜al0⌝ ^ = ⌜al0⌝ , alli0.last ≠ alli0[0] + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[can-inst-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [alli0, al, alli]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: alli0, al, y

Proof step 42 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli0[# al0] = alli0[0] + al0, ⌜al0⌝ ^ = ⌜al0⌝ , alli0 = alli + al ', al ≠ alli0[0] + al0, alli0 ≠ [], alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s) ⊦ x ≠ [] → x[0] = hd(x); (s)

Proof step 43 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), (alli + al ')[# al0] = hd(alli + al ') + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ (alli + al ')[# al0], alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ + ⌜al '⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[can-inst-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [alli + al ', al1, alli0]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli + al ', al1, y

Proof step 44 from proof behcan-limitclosed (previous step) (back to tree)

alli + al ' = al1 + alli0, ALIOAut(alstartf, alstepf) = can(tP), (alli + al ')[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , alli + al ' ≠ [], al ≠ (alli + al ')[# al0], alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ + ⌜al '⌝ , ⌜al0⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 45 from proof behcan-limitclosed (previous step) (back to tree)

alli + al ' = al1 ' + alli0, ALIOAut(alstartf, alstepf) = can(tP), (al1 ' + alli0)[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ + ⌜al '⌝ , ⌜al0⌝ ), traceprop(tP), al = al1 ∨ al ∈ alli0, al1 ∈ alli ∨ al1 = al ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:frag, seq:⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ , ⌜alli⌝ + ⌜al '⌝ , alstepf, alstartf], <all paths>

Additional information

Used terms: ⌜al0⌝ , ⌜alli⌝ + ⌜al '⌝ , alstepf, alstartf

Proof step 46 from proof behcan-limitclosed (previous step) (back to tree)

⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 47 from proof behcan-limitclosed (previous step) (back to tree)

#(⌜alli⌝ + ⌜al '⌝ ) = # ⌜al0⌝ + ⌜1⌝ , alli + al ' = al1 ' + alli0, ALIOAut(alstartf, alstepf) = can(tP), (al1 ' + alli0)[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, traceprop(tP), ∀ n. ⌜n⌝ < # ⌜al0⌝ → alstepf((⌜alli⌝ + ⌜al '⌝ )[n], ⌜al0⌝ [n], (⌜alli⌝ + ⌜al '⌝ )[n +1]), al1 ∈ alli ∨ al1 = al, al = al1 ∨ al ∈ alli0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 48 from proof behcan-limitclosed (previous step) (back to tree)

# alli = # al0, alli + al ' = al1 ' + alli0, ALIOAut(alstartf, alstepf) = can(tP), (al1 ' + alli0)[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, traceprop(tP), ∀ n. n < # al0 → alstepf((al1 ' + alli0)[n], al0[n], alli0[n]), al = al1 ∨ al ∈ alli0, al1 ∈ alli ∨ al1 = al ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: alli

Additional information

Used simplifier rules: actionlistlist freely generated by [], +;; ⊦ [] + x = x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ # [] = 0; (s) ⊦ a '[0] = a; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream]

Proof step 49 from proof behcan-limitclosed (previous step) (back to tree)

# alli = # al0, alli + al ' = al1 ' + alli0, ALIOAut(alstartf, alstepf) = can(tP), (al1 ' + alli0)[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , alli = al2 + alli1, al ≠ al1 + al0, traceprop(tP), ∀ n. n < # al0 → alstepf((al1 ' + alli0)[n], al0[n], alli0[n]), al1 ∈ alli ∨ al1 = al, al = al1 ∨ al ∈ alli0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 50 from proof behcan-limitclosed (previous step) (back to tree)

# alli1 + 1 = # al0, ALIOAut(alstartf, alstepf) = can(tP), (al1 ' + alli1 + al ')[# al0] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, traceprop(tP), ∀ n. n < # al0 → alstepf((al1 ' + alli1 + al ')[n], al0[n], (alli1 + al ')[n]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [# al0, alli1 + al ', al1 '], <all paths>

Additional information

Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '[0] = a; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: # al0, alli1 + al ', al1 '

Proof step 51 from proof behcan-limitclosed (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 52 from proof behcan-limitclosed (previous step) (back to tree)

# alli1 + 1 = # al0, ALIOAut(alstartf, alstepf) = can(tP), (alli1 + al ')[# al0 - # al1 '] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, traceprop(tP), ¬ # al0 < # al1 ', ∀ n. n < # al0 → alstepf((al1 ' + alli1 + al ')[n], al0[n], (alli1 + al ')[n]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s)

Proof step 53 from proof behcan-limitclosed (previous step) (back to tree)

# alli1 + 1 = # al0, ALIOAut(alstartf, alstepf) = can(tP), (alli1 + al ')[# al0 - 1] = al1 + al0, ⌜al0⌝ ^ = ⌜al0⌝ , al ≠ al1 + al0, al0 ≠ [], traceprop(tP), ∀ n. n < # al0 → alstepf((al1 ' + alli1 + al ')[n], al0[n], (alli1 + al ')[n]) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [# al0, n0]

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n = # x → (x + a ')[n] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # al0, m

Proof step 54 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , al0 = alli[0] + al, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∃ α, alli0. alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , α) ∧ finp(α) ∧ alli[0] = alli0[0] ∧ al0 = alli0.last ∧ α ^ = ⌜al⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ ∃ α, alli0. alfrag(ALIOAut(alstartf, alstepf))(⌜alli0⌝ , α) ∧ finp(α) ∧ alli[0] = alli0[0] ∧ alli[0] + al = alli0.last ∧ α ^ = ⌜al⌝

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al⌝ , alli abort: F discard: T computed: T

Additional information

Used terms: ⌜al⌝ , alli

Proof step 56 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ) ∧ finp(⌜al⌝ ) ∧ alli[0] = alli[0] ∧ alli[0] + al = alli.last ∧ ⌜al⌝ ^ = ⌜al⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)

Proof step 57 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), ⌜al⌝ ^ = ⌜al⌝ , alli[0] + al ≠ alli.last, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: can, name:frag-lem, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n), subst:[tP, alli, al, n] → [tP, alli, al, # al]

Additional information

Used simplifier rules: ⊦ alfrag(ALIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# al < # sl ↔ true); (ss) Used terms: tP, alli, al, # al

Proof step 58 from proof behcan-limitclosed (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)

A spec-lemma

Proof step 59 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[# al] = alli[0] + (al to # al), ⌜al⌝ ^ = ⌜al⌝ , alli[0] + al ≠ alli.last, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x to # x = x; (s)

Proof step 60 from proof behcan-limitclosed (previous step) (back to tree)

ALIOAut(alstartf, alstepf) = can(tP), alli[# al] = alli[0] + al, ⌜al⌝ ^ = ⌜al⌝ , alli[0] + al ≠ alli.last, alfrag(ALIOAut(alstartf, alstepf))(⌜alli⌝ , ⌜al⌝ ), traceprop(tP) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:frag, seq:⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜alli⌝ , alstepf, alstartf], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜alli⌝ , alstepf, alstartf

Proof step 61 from proof behcan-limitclosed (previous step) (back to tree)

⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 62 from proof behcan-limitclosed (previous step) (back to tree)

# ⌜alli⌝ = # ⌜al⌝ + ⌜1⌝ , ALIOAut(alstartf, alstepf) = can(tP), alli[# al] = alli[0] + al, ⌜al⌝ ^ = ⌜al⌝ , alli[0] + al ≠ alli.last, traceprop(tP), ∀ n. ⌜n⌝ < # ⌜al⌝ → alstepf(⌜alli⌝ [n], ⌜al⌝ [n], ⌜alli⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 63 from proof behcan-limitclosed (previous step) (back to tree)

# al + 1 = # alli, ALIOAut(alstartf, alstepf) = can(tP), alli[# al] = alli[0] + al, ⌜al⌝ ^ = ⌜al⌝ , alli[0] + al ≠ alli.last, traceprop(tP), ∀ n. n < # al → alstepf(alli[n], al[n], alli[n + 1]) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[can-inst-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [alli, al0, alli0]

Additional information

Used simplifier rules: ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n = # x → (x + a ')[n] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: alli, al0, y

Proof Tree for behcan-limitclosed (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