[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 branchinfw-fw-aux (conclusion) (back to tree)

bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof branchinfw-fw-aux (previous step) (back to tree)

bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), ¬ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: branchingIOforward, name:proofobls-branchingforwardsim, seq:⊦ bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) )), subst:[cstartf, cstepf, astartf, r, astepf] → [cstartf, cstepf, astartf, r, astepf], <all paths>

Additional information

Used terms: r, astepf, astartf, cstepf, cstartf

Proof step 3 from proof branchinfw-fw-aux (previous step) (back to tree)

⊦ bfwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ))

A spec-lemma

Proof step 4 from proof branchinfw-fw-aux (previous step) (back to tree)

¬ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof branchinfw-fw-aux (previous step) (back to tree)

¬ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOforward, name:proofobls-forwardsim, seq:⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0))), subst:[cstartf, cstepf, astartf, r, astepf] → [cstartf, cstepf, astartf, r, astepf], <all paths>

Additional information

Used terms: r, astepf, astartf, cstepf, cstartf

Proof step 6 from proof branchinfw-fw-aux (previous step) (back to tree)

⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))

A spec-lemma

Proof step 7 from proof branchinfw-fw-aux (previous step) (back to tree)

∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ), (∃ cs. ¬(cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)))) ∨ (∃ cs, a, cs0, as. ¬(r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof branchinfw-fw-aux (previous step) (back to tree)

∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ¬(cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∨ ¬(r(as, cs0) ∧ cstepf(cs0, a, cs1) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 9 from proof branchinfw-fw-aux (previous step) (back to tree)

cstartf(cs), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ) ⊦ ∃ as. r(as, cs) ∧ astartf(as)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 2 terms: cs

Additional information

Used terms: cs

Proof step 10 from proof branchinfw-fw-aux (previous step) (back to tree)

cstepf(cs0, a, cs1), r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (a = τ ⊃ r(as, cs0) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs0) ) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: cs0, a, cs1, as abort: F discard: T computed: T

Additional information

Used terms: cs0, a, cs1, as

Proof step 11 from proof branchinfw-fw-aux (previous step) (back to tree)

cstepf(cs0, a, cs1), r(as, cs0), r(as, cs0) ∧ cstepf(cs0, a, cs1) → (a = τ ⊃ r(as, cs1) ;∃ asl, al, as1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs0)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs1) ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 12 from proof branchinfw-fw-aux (previous step) (back to tree)

cstepf(cs0, a, cs1), r(as, cs0), (a = τ ⊃ r(as, cs1) ;afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = [] ∧ hd(asl) = as ∧ (∀ as. as ∈ asl → r(as, cs0)) ∧ astepf(asl.last, a, as1) ∧ r(as1, cs1) ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 13 from proof branchinfw-fw-aux (previous step) (back to tree)

a = τ, cstepf(cs0, a, cs1), r(as, cs0), r(as, cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)

Proof step 14 from proof branchinfw-fw-aux (previous step) (back to tree)

cstepf(cs0, τ, cs1), r(as, cs1), r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ r(as0, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as

Additional information

Used simplifier rules: ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used terms: as

Proof step 15 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], hd(asl) = as, a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astepf(asl.last, a, as1), cstepf(cs0, a, cs1), r(as, cs0), r(as1, cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s)

Proof step 16 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astepf(asl.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(hd(asl), cs0), ∀ as. as ∈ asl → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(hd(asl), ⌜a '⌝ , as0) ∧ r(as0, cs1)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceA-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [asl, as2, asl0]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: asl, as2, y

Proof step 17 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], asl = as2 + asl0, a ≠ τ, asl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astepf(asl.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl → r(as, cs0) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

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[traceA-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s)

Proof step 18 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf((as2 ' + asl0).last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

Heuristic weak cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: asl0 = []

Additional information

Used formulas: asl0 = []

Proof step 19 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], asl0 = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf((as2 ' + asl0).last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ σ + [] = σ; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ x + [] = x; (s)

Proof step 20 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as1 abort: F discard: T computed: T

Additional information

Used terms: as1

Proof step 21 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as1) ∧ r(as1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 22 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [as2, astepf, ⌜a '⌝ , as1, astartf], <all paths>

Additional information

Used terms: as1, ⌜a '⌝ , as2, astepf, astartf

Proof step 23 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 24 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ as2 = sl[0] ∧ as1 = sl.last ∧ α ^ = ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 25 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ , ⌜al⌝ ), astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as2 ≠ sl[0] ∨ as1 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜as2 '⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜as2 '⌝ , astepf, astartf

Proof step 26 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 27 from proof branchinfw-fw-aux (previous step) (back to tree)

# ⌜as2 '⌝ = # ⌜al⌝ + ⌜1⌝ , ⌜al⌝ ^ = [], a ≠ τ, astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as2 ≠ sl[0] ∨ as1 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ , ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n. ⌜n⌝ < # ⌜al⌝ → astepf(⌜as2 '⌝ [n], ⌜al⌝ [n], ⌜as2 '⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜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 ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ m ≤ n → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ = n∞2); (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 28 from proof branchinfw-fw-aux (previous step) (back to tree)

a ≠ τ, astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as2 ≠ sl[0] ∨ as1 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ , ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: ⌜a '⌝ , as2 ' + as1 ' abort: F discard: T computed: F

Additional information

Used terms: ⌜a '⌝ , as2 ' + as1 '

Proof step 29 from proof branchinfw-fw-aux (previous step) (back to tree)

a ≠ τ, astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ¬ afrag(AIOAut(astartf, astepf))(⌜as2 ' + as1 '⌝ , ⌜a '⌝ ) ∨ ¬ finp(⌜a '⌝ ) ∨ as2 ≠ (as2 ' + as1 ')[0] ∨ as1 ≠ (as2 ' + as1 ').last ∨ ⌜a '⌝ ^ ≠ ⌜a '⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 30 from proof branchinfw-fw-aux (previous step) (back to tree)

a ≠ τ, astepf(as2, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜as1 '⌝ , ⌜a '⌝ ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜a '⌝ , ⌜as2 '⌝ + ⌜as1 '⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) n ≠ 0 ⊦ (⌜a '⌝ + σ)[(* n)] = σ[n - 1]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] Used terms: ⌜a '⌝ , ⌜as2 '⌝ + ⌜as1 '⌝ , astepf, astartf

Proof step 31 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 32 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf((as2 ' + asl0).last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

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[traceA-IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 33 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as0) ∧ r(as0, cs1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as1 abort: F discard: T computed: T

Additional information

Used terms: as1

Proof step 34 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦ amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as1) ∧ r(as1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 35 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ amove(AIOAut(astartf, astepf))(as2, ⌜a '⌝ , as1), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [as2, astepf, ⌜a '⌝ , as1, astartf], <all paths>

Additional information

Used terms: as1, ⌜a '⌝ , as2, astepf, astartf

Proof step 36 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 37 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ as2 = sl[0] ∧ as1 = sl.last ∧ α ^ = ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 38 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as2 ≠ sl[0] ∨ as1 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: ⌜al + a '⌝ , as2 + (asl0 + as1 ') abort: F discard: T computed: F

Additional information

Used terms: ⌜al + a '⌝ , as2 + (asl0 + as1 ')

Proof step 39 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ¬ afrag(AIOAut(astartf, astepf))(⌜as2 + (asl0 + as1 ')⌝ , ⌜al + a '⌝ ) ∨ ¬ finp(⌜al + a '⌝ ) ∨ as2 ≠ (as2 + (asl0 + as1 '))[0] ∨ as1 ≠ (as2 + (asl0 + as1 ')).last ∨ ⌜al + a '⌝ ^ ≠ ⌜a '⌝ ⊦

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[actionstream] finp(σ) ⊦ σ0 + σ = σ ↔ σ0 = []; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 40 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ , ⌜al⌝ + ⌜a '⌝ ), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ + ⌜a '⌝ , ⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ + ⌜a '⌝ , ⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ , astepf, astartf

Proof step 41 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 42 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), #(⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ ) ≠ #(⌜al⌝ + ⌜a '⌝ ) + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < #(⌜al⌝ + ⌜a '⌝ ) → astepf((⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ )[n], (⌜al⌝ + ⌜a '⌝ )[n], (⌜as2 '⌝ + ⌜asl0⌝ + ⌜as1 '⌝ )[n +1]))) ⊦

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[traceA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]; (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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 43 from proof branchinfw-fw-aux (previous step) (back to tree)

⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜as2 '⌝ + ⌜asl0⌝ , ⌜al⌝ ), astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), # asl0 ≠ # al ∨ ¬(¬ # al < n → astepf((as2 ' + asl0 + as1 ')[n], (al + a ')[n], (asl0 + as1 ')[n])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag, seq:⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜as2 '⌝ + ⌜asl0⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜as2 '⌝ + ⌜asl0⌝ , astepf, astartf

Proof step 44 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 45 from proof branchinfw-fw-aux (previous step) (back to tree)

#(⌜as2 '⌝ + ⌜asl0⌝ ) = # ⌜al⌝ + ⌜1⌝ , ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n. ⌜n⌝ < # ⌜al⌝ → astepf((⌜as2 '⌝ + ⌜asl0⌝ )[n], ⌜al⌝ [n], (⌜as2 '⌝ + ⌜asl0⌝ )[n +1]), # asl0 ≠ # al ∨ ¬(¬ # al < n → astepf((as2 ' + asl0 + as1 ')[n], (al + a ')[n], (asl0 + as1 ')[n])) ⊦

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[traceA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) 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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 46 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), n ≤ # al, ¬ astepf((as2 ' + asl0 + as1 ')[n], (al + a ')[n], (asl0 + as1 ')[n]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceA-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [n, asl0 + as1 ', as2 '], <all paths>

Additional information

Used terms: n, asl0 + as1 ', as2 '

Proof step 47 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 48 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), n ≤ # al, ¬ n < # as2 ', ¬ astepf((as2 ' + asl0 + as1 ')[n], (al + a ')[n], (asl0 + as1 ')[n]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 49 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], n ≠ 0, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), n ≤ # al, ¬ astepf((as2 ' + asl0 + as1 ')[n], (al + a ')[n], (asl0 + as1 ')[n]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceA-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[x, y, n] → [as2 ', asl0 + as1 ', n], <all paths>

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: as2 ', asl0 + as1 ', n

Proof step 50 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 51 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], n ≠ 0, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), n ≤ # al, ¬ n < # as2 ', ¬ astepf((asl0 + as1 ')[n - # as2 '], (al + a ')[n], (asl0 + as1 ')[n]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 52 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], n ≠ 0, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), n ≤ # al, ¬ astepf((asl0 + as1 ')[n - 1], (al + a ')[n], (asl0 + as1 ')[n]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m

Proof step 53 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], n = n1 + 1, a ≠ τ, asl0 ≠ [], n ≠ 0, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), n ≤ # al, ¬ astepf((asl0 + as1 ')[n1], (al + a ')[n], (asl0 + as1 ')[n]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

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[traceA-IOstatestream] ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)

Proof step 54 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], n1 < # al, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(asl0[n1], (al + a ')[n1 + 1], (asl0 + as1 ')[n1 + 1]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[x, y, n] → [al, a ', n1 + 1], <all paths>

Additional information

Used terms: al, a ', n1 + 1

Proof step 55 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 56 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], n1 + 1 < # al, n1 < # al, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(asl0[n1], (al + a ')[n1 + 1], (asl0 + as1 ')[n1 + 1]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

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[traceA-IOstatestream] ⊦ n < # x → (x + a ')[n] = x[n]; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ n < # x → (x + a ')[n] = x[n]; (s)

Proof step 57 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], n1 + 1 < # al, n1 < # al, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(asl0[n1], al[n1 + 1], asl0[n1 + 1]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 15 terms: n1 + 1

Additional information

Used simplifier rules: ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] Used terms: n1 + 1

Proof step 58 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], n1 < # al, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ n1 + 1 < # al, ¬ astepf(asl0[n1], a '[n1 + 1 - # al], (asl0 + as1 ')[n1 + 1]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ a '[0] = a; (s) ⊦ m - m = 0; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 59 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = n1 + 1, # al = n1 + 1, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(asl0[n1], a, as1), ∀ n0. ¬ n1 < n0 → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[traceA-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [asl0, as0, asl]

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 ⊦ x + a ' ≠ []; (s) ⊦ n = # x → (x + a ')[n] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl0, as0, y

Proof step 60 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], n < # as2 ', astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), n ≤ # al, ¬ astepf(as2 '[n], (al + a ')[n], (asl0 + as1 ')[n]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 61 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(as2, (al + a ')[0], (asl0 + as1 ')[0]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, a ', al], <all paths>

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) Used terms: 0, a ', al

Proof step 62 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 63 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, asl0 ≠ [], 0 < # al, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(as2, al[0], (asl0 + as1 ')[0]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 64 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], a ≠ τ, al ≠ [], asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(as2, hd(al), (asl0 + as1 ')[0]), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[actionstream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [al, a0, al0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a0, y

Proof step 65 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al, ⌜al⌝ ^ = [], al = a0 + al0, a ≠ τ, al ≠ [], asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(as2, a0, (asl0 + as1 ')[0]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0), ∀ n0. n0 < # al → astepf((as2 ' + asl0)[n0], al[n0], asl0[n0]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 66 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al0 + 1, ⌜al0⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(as2, τ, (asl0 + as1 ')[0]), ∀ n0. ¬ # al0 < n0 → astepf((as2 ' + asl0)[n0], (τ ' + al0)[n0], asl0[n0]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceA-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, as1 ', asl0], <all paths>

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) Used terms: 0, as1 ', asl0

Proof step 67 from proof branchinfw-fw-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 68 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al0 + 1, ⌜al0⌝ ^ = [], a ≠ τ, asl0 ≠ [], 0 < # asl0, astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(as2, τ, asl0[0]), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n0. ¬ # al0 < n0 → astepf((as2 ' + asl0)[n0], (τ ' + al0)[n0], asl0[n0]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 69 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al0 + 1, ⌜al0⌝ ^ = [], a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(as2, τ, hd(asl0)), ∀ n0. ¬ # al0 < n0 → astepf((as2 ' + asl0)[n0], (τ ' + al0)[n0], asl0[n0]), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ as. as ∈ asl0 → r(as, cs0) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceA-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [asl0, as0, asl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: asl0, as0, y

Proof step 70 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl0 = # al0 + 1, ⌜al0⌝ ^ = [], asl0 = as0 + asl, a ≠ τ, asl0 ≠ [], astepf(asl0.last, a, as1), cstepf(cs0, a, cs1), r(as2, cs0), r(as1, cs1), ¬ astepf(as2, τ, as0), ∀ as. as ∈ asl0 → r(as, cs0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n0. ¬ # al0 < n0 → astepf((as2 ' + asl0)[n0], (τ ' + al0)[n0], asl0[n0]) ⊦

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[traceA-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 71 from proof branchinfw-fw-aux (previous step) (back to tree)

# asl = # al0, ⌜al0⌝ ^ = [], a ≠ τ, astepf((as0 ' + asl).last, a, as1), cstepf(cs0, a, cs1), r(as1, cs1), r(as2, cs0), ¬ astepf(as2, τ, as0), ∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as)), ∀ n0. ¬ # al0 < n0 → astepf((as2 ' + as0 ' + asl)[n0], (τ ' + al0)[n0], (as0 ' + asl)[n0]), ∀ as. as = as0 ∨ as ∈ asl → r(as, cs0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: 0

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] Used terms: 0

Proof Tree for branchinfw-fw-aux (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