[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 refine-implies-bwhist-aux (conclusion) (back to tree)

C_≤*T_A(cioaut, aioaut) ⊦ bwsim (hist(cioaut), hist(aioaut), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → aioaut.start(aendstate(αas))), λ αcs. ∃ cσ, α. cexec*(cioaut)(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. aexec*(aioaut)(aσ, α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: IO-Aut-data[histA], name:elim, seq: ⊦ start = ioaut.start ∧ step = ioaut.step ↔ ioaut = AIOAut(start, step), subst:[ioaut, start, step] → [aioaut, astartf, astepf]

Additional information

Used simplifier rules: ⊦ start = ioaut.start ∧ step = ioaut.step ↔ ioaut = AIOAut(start, step); (elim) Used terms: aioaut, start, step

Proof step 2 from proof refine-implies-bwhist-aux (previous step) (back to tree)

aioaut = AIOAut(astartf, astepf), C_≤*T_A(cioaut, aioaut) ⊦ bwsim (hist(cioaut), hist(aioaut), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cexec*(cioaut)(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. aexec*(aioaut)(aσ, α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 3 from proof refine-implies-bwhist-aux (previous step) (back to tree)

C_≤*T_A(cioaut, AIOAut(astartf, astepf)) ⊦ bwsim (hist(cioaut), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cexec*(cioaut)(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cioaut

Additional information

Used simplifier rules: CIOAutomaton freely generated by CIOAut;;

Proof step 4 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cioaut = CIOAut(cstartf0, cstepf0), C_≤*T_A(cioaut, AIOAut(astartf, astepf)) ⊦ bwsim (hist(cioaut), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cexec*(cioaut)(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ cexec*(CIOAut(startf, stepf))(σ, β) ↔ cexec(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 5 from proof refine-implies-bwhist-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf, astepf)) ⊦ bwsim (hist(CIOAut(cstartf0, cstepf0)), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def, name:leqstar-def, seq:⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)), subst:[astepf, astartf, cstepf, cstartf] → [astepf, astartf, cstepf0, cstartf0], <all paths>

Additional information

Used terms: astepf, astartf, cstepf0, cstartf0

Proof step 6 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α))

A spec-lemma

Proof step 7 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace*(CIOAut(cstartf0, cstepf0))(α) → atrace*(AIOAut(astartf, astepf))(α) ⊦ bwsim (hist(CIOAut(cstartf0, cstepf0)), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s)

Proof step 8 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ bwsim (hist(CIOAut(cstartf0, cstepf0)), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: histAut[histC], name:histAut-def, seq:⊦ hist(CIOAut(startf, stepf)) = CHIOAut (λ αs. cactstream(αs) = [] ∧ startf(cendstate(αs)), λ αs, a, αs0. finp(cactstream(αs)) ∧ cmove(CIOAut(startf, stepf))(cendstate(αs), ⌜a '⌝ ^, cendstate(αs0)) ∧ cactstream(αs0) = cactstream(αs) + ⌜a '⌝ ^), subst:[stepf, startf] → [cstepf0, cstartf0], <all paths>

Additional information

Used terms: cstepf0, cstartf0

Proof step 9 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ hist(CIOAut(startf, stepf)) = CHIOAut (λ αs. cactstream(αs) = [] ∧ startf(cendstate(αs)), λ αs, a, αs0. finp(cactstream(αs)) ∧ cmove(CIOAut(startf, stepf))(cendstate(αs), ⌜a '⌝ ^, cendstate(αs0)) ∧ cactstream(αs0) = cactstream(αs) + ⌜a '⌝ ^)

A spec-lemma

Proof step 10 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ bwsim (CHIOAut (λ αs. cactstream(αs) = [] ∧ cstartf0(cendstate(αs)), λ αs, a, αs0. finp(cactstream(αs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(αs), ⌜a '⌝ ^, cendstate(αs0)) ∧ cactstream(αs0) = cactstream(αs) + ⌜a '⌝ ^), hist(AIOAut(astartf, astepf)), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: histAut[histA], name:histAut-def, seq:⊦ hist(AIOAut(startf, stepf)) = AHIOAut (λ αs. aactstream(αs) = [] ∧ startf(aendstate(αs)), λ αs, a, αs0. finp(aactstream(αs)) ∧ amove(AIOAut(startf, stepf))(aendstate(αs), ⌜a '⌝ ^, aendstate(αs0)) ∧ aactstream(αs0) = aactstream(αs) + ⌜a '⌝ ^), subst:[stepf, startf] → [astepf, astartf], <all paths>

Additional information

Used terms: astepf, astartf

Proof step 11 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ hist(AIOAut(startf, stepf)) = AHIOAut (λ αs. aactstream(αs) = [] ∧ startf(aendstate(αs)), λ αs, a, αs0. finp(aactstream(αs)) ∧ amove(AIOAut(startf, stepf))(aendstate(αs), ⌜a '⌝ ^, aendstate(αs0)) ∧ aactstream(αs0) = aactstream(αs) + ⌜a '⌝ ^)

A spec-lemma

Proof step 12 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ bwsim (CHIOAut (λ αs. cactstream(αs) = [] ∧ cstartf0(cendstate(αs)), λ αs, a, αs0. finp(cactstream(αs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(αs), ⌜a '⌝ ^, cendstate(αs0)) ∧ cactstream(αs0) = cactstream(αs) + ⌜a '⌝ ^), AHIOAut (λ αs. aactstream(αs) = [] ∧ astartf(aendstate(αs)), λ αs, a, αs0. finp(aactstream(αs)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αs), ⌜a '⌝ ^, aendstate(αs0)) ∧ aactstream(αs0) = aactstream(αs) + ⌜a '⌝ ^), λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV[IOrefine-CHIO-AHIO], name:proofobls-backwardsiminv, seq:⊦ bwsim(CHIOAut(cstartf, cstepf), AHIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ ahmove(AHIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[astartf, cINV, cstepf, aINV, astepf, t, cstartf] → [λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αcs, a, αcs0. finp(cactstream(αcs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(αcs), ⌜a '⌝ ^, cendstate(αcs0)) ∧ cactstream(αcs0) = cactstream(αcs) + ⌜a '⌝ ^, λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^, λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αcs. cactstream(αcs) = [] ∧ cstartf0(cendstate(αcs))], <all paths>

Additional information

Used terms: λ αas. ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(αas) ∧ aactstream(αas) = α ^, λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ αcs, αas. aactstream(αas) = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(aendstate(αas))), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αcs, a, αcs0. finp(cactstream(αcs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(αcs), ⌜a '⌝ ^, cendstate(αcs0)) ∧ cactstream(αcs0) = cactstream(αcs) + ⌜a '⌝ ^, λ αcs. cactstream(αcs) = [] ∧ cstartf0(cendstate(αcs))

Proof step 13 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ bwsim(CHIOAut(cstartf, cstepf), AHIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ ahmove(AHIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

A spec-lemma

Proof step 14 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∀ _cs. cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (∀ _as. aactstream(_as) = [] ∧ astartf(aendstate(_as)) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^)) ∧ (∀ _cs, a, _cs0. (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^) ∧ finp(cactstream(_cs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs), ⌜a '⌝ ^, cendstate(_cs0)) ∧ cactstream(_cs0) = cactstream(_cs) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^)) ∧ (∀ _as, a, _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^) ∧ finp(aactstream(_as)) ∧ amove(AIOAut(astartf, astepf))(aendstate(_as), ⌜a '⌝ ^, aendstate(_as0)) ∧ aactstream(_as0) = aactstream(_as) + ⌜a '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^)) ∧ (∀ _cs. (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^) → (∃ _as. (aactstream(_as) = cactstream(_cs) ∧ (cactstream(_cs) = [] → astartf(aendstate(_as)))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^))) ∧ (∀ _cs, _as. (cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs))) ∧ (aactstream(_as) = cactstream(_cs) ∧ (cactstream(_cs) = [] → astartf(aendstate(_as)))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^) → aactstream(_as) = [] ∧ astartf(aendstate(_as))) ∧ (∀ _cs, a, _cs0, _as. (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^) ∧ ( finp(cactstream(_cs)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs), ⌜a '⌝ ^, cendstate(_cs0)) ∧ cactstream(_cs0) = cactstream(_cs) + ⌜a '⌝ ^) ∧ (aactstream(_as) = cactstream(_cs0) ∧ (cactstream(_cs0) = [] → astartf(aendstate(_as)))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^) → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a '⌝ ^, _as) ∧ aactstream(_as0) = cactstream(_cs) ∧ (cactstream(_cs) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ ( aactstream(_as) = [] ∧ astartf(aendstate(_as)) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as) ∧ aactstream(_as) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α0 ^ ∧ finp(aactstream(_as0)) ∧ amove(AIOAut(astartf, astepf))(aendstate(_as0), ⌜a0 '⌝ ^, aendstate(_as1)) ∧ aactstream(_as1) = aactstream(_as0) + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as1) ∧ aactstream(_as1) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histA], name:elim, seq: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_as, α5, as]

Additional information

Used simplifier rules: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _as, ασ, st

Proof step 16 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_as = α5 × as, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α5 = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α0 ^ ∧ finp(aactstream(_as0)) ∧ amove(AIOAut(astartf, astepf))(aendstate(_as0), ⌜a0 '⌝ ^, aendstate(_as1)) ∧ aactstream(_as1) = aactstream(_as0) + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as1) ∧ aactstream(_as1) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α0 ^ ∧ finp(aactstream(_as0)) ∧ amove(AIOAut(astartf, astepf))(aendstate(_as0), ⌜a0 '⌝ ^, aendstate(_as1)) ∧ aactstream(_as1) = aactstream(_as0) + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as1) ∧ aactstream(_as1) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histA], name:elim, seq: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_as0, α6, as0]

Additional information

Used simplifier rules: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _as0, ασ, st

Proof step 18 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_as0 = α6 × as0, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α6) ∧ amove(AIOAut(astartf, astepf))(as0, ⌜a0 '⌝ ^, aendstate(_as1)) ∧ aactstream(_as1) = α6 + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as1) ∧ aactstream(_as1) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, aendstate(_as1)) ∧ aactstream(_as1) = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as1) ∧ aactstream(_as1) = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histA], name:elim, seq: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_as1, α7, as1]

Additional information

Used simplifier rules: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _as1, ασ, st

Proof step 20 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_as1 = α7 × as1, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α7 = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ aactstream(_as2) = cactstream(_cs3) ∧ astartf(aendstate(_as2)) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = aendstate(_as2) ∧ aactstream(_as2) = α2 ^ → aactstream(_as2) = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histA], name:elim, seq: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_as2, α8, as2]

Additional information

Used simplifier rules: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _as2, ασ, st

Proof step 22 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_as2 = α8 × as2, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α8 = cactstream(_cs3) ∧ astartf(as2) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α8 = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ aactstream(_as3) = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aendstate(_as3))) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = aendstate(_as3) ∧ aactstream(_as3) = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histA], name:elim, seq: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_as3, α9, as3]

Additional information

Used simplifier rules: ⊦ ασ = aactstream(αs) ∧ st = aendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _as3, ασ, st

Proof step 24 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_as3 = α9 × as3, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α9 = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(as3)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, _as3) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 25 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ( cactstream(_cs) = [] ∧ cstartf0(cendstate(_cs)) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs) ∧ cactstream(_cs) = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs, α10, cs]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs, ασ, st

Proof step 26 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs = α10 × cs, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ α10 = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs0) ∧ cactstream(_cs0) = α ^ ∧ finp(cactstream(_cs0)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs0), ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = cactstream(_cs0) + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs0, α11, cs0]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs0, ασ, st

Proof step 28 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs0 = α11 × cs0, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α11) ∧ cmove(CIOAut(cstartf0, cstepf0))(cs0, ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = α11 + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 29 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cendstate(_cs1)) ∧ cactstream(_cs1) = α ^ + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(_cs1) ∧ cactstream(_cs1) = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs1, α12, cs1]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs1, ασ, st

Proof step 30 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs1 = α12 × cs1, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs1 ∧ α12 = α ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 31 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cendstate(_cs2) ∧ cactstream(_cs2) = α1 ^ → (∃ _as2. aactstream(_as2) = cactstream(_cs2) ∧ (cactstream(_cs2) = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs2, α13, cs2]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs2, ασ, st

Proof step 32 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs2 = α13 × cs2, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α13 ∧ (α13 = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 33 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cactstream(_cs3) = [] ∧ cstartf0(cendstate(_cs3)) ∧ α2 ^ = cactstream(_cs3) ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs3, α14, cs3]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs3, ασ, st

Proof step 34 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs3 = α14 × cs3, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( α14 = [] ∧ cstartf0(cs3) ∧ α2 ^ = α14 ∧ astartf(aσ0.l.last) ∧ afrag(AIOAut(astartf, astepf))(aσ0, α2) ∧ astartf(aσ0[0]) ∧ finp(α2) ∧ aσ0.l.last = as2 ∧ α8 = α2 ^ → α2 ^ = []) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 35 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cendstate(_cs5)) ∧ cactstream(_cs5) = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = cactstream(_cs5) ∧ (cactstream(_cs5) = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs5, α2, cs3]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs5, ασ, st

Proof step 36 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs5 = α2 × cs3, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cs3) ∧ α2 = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = α2 ∧ (α2 = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cendstate(_cs4) ∧ cactstream(_cs4) = α3 ^ ∧ finp(cactstream(_cs4)) ∧ cmove(CIOAut(cstartf0, cstepf0))(cendstate(_cs4), ⌜a1 '⌝ ^, cs3) ∧ α4 ^ = cactstream(_cs4) + ⌜a1 '⌝ ^ ∧ α4 ^ = α2 ∧ (α4 ^ = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = cactstream(_cs4) ∧ (cactstream(_cs4) = [] → astartf(aendstate(_as0)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state[histC], name:elim, seq: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_cs4, α8, cs4]

Additional information

Used simplifier rules: ⊦ ασ = cactstream(αs) ∧ st = cendstate(αs) ↔ αs = ασ × st; (elim) Used terms: _cs4, ασ, st

Proof step 38 from proof refine-implies-bwhist-aux (previous step) (back to tree)

_cs4 = α8 × cs4, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cs4 ∧ α8 = α3 ^ ∧ finp(α8) ∧ cmove(CIOAut(cstartf0, cstepf0))(cs4, ⌜a1 '⌝ ^, cs3) ∧ α4 ^ = α8 + ⌜a1 '⌝ ^ ∧ α4 ^ = α2 ∧ (α4 ^ = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = α8 ∧ (α8 = [] → astartf(aendstate(_as0)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof refine-implies-bwhist-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (α10 = [] ∧ cstartf0(cs) → (∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^)) ∧ (α5 = [] ∧ astartf(as) → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs0 ∧ α11 = α ^ ∧ finp(α ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1) ∧ α12 = α ^ + ⌜a '⌝ ^ → (∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^)) ∧ ( afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ finp(α0) ∧ aσ.l.last = as0 ∧ α6 = α0 ^ ∧ finp(α0 ^) ∧ amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1) ∧ α7 = α0 ^ + ⌜a0 '⌝ ^ → (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^)) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1) ∧ cstartf0(cσ0[0]) ∧ finp(α1) ∧ cσ0.l.last = cs2 ∧ α13 = α1 ^ → (∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^))) ∧ ( cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3) ∧ cstartf0(cσ1[0]) ∧ finp(α3) ∧ cσ1.l.last = cs4 ∧ α8 = α3 ^ ∧ finp(α3 ^) ∧ cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ ^, cs3) ∧ α4 ^ = α3 ^ + ⌜a1 '⌝ ^ ∧ α4 ^ = α2 ∧ (α4 ^ = [] → astartf(aσ1.l.last)) ∧ afrag(AIOAut(astartf, astepf))(aσ1, α4) ∧ astartf(aσ1[0]) ∧ finp(α4) ∧ aσ1.l.last = as3 ∧ α9 = α4 ^ → (∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = α3 ^ ∧ (α3 ^ = [] → astartf(aendstate(_as0)))))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 40 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α10 = [], cstartf0(cs), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 41 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cstartf0(cs), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cs ∧ [] = α ^

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜cs '⌝ , [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ finp([]); (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ a '.last = a; (s) ⊦ [] ^ = []; (s) Used terms: ⌜cs '⌝ , []

Proof step 42 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α5 = [], astartf(as), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof refine-implies-bwhist-aux (previous step) (back to tree)

astartf(as), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ [] = α ^

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜as '⌝ , [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ finp([]); (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ a '.last = a; (s) ⊦ [] ^ = []; (s) Used terms: ⌜as '⌝ , []

Proof step 44 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ.l.last = cs0, α11 = α ^, α12 = α ^ + ⌜a '⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(cσ, α), cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1), cstartf0(cσ[0]), finp(α), finp(α ^), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ α ^ + ⌜a '⌝ ^ = α0 ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 45 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(cσ, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ.l.last, ⌜a '⌝ ^, cs1), cstartf0(cσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ ⌜al0⌝ + ⌜a '⌝ ^ = α0 ^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:move, seq:⊦ cmove(CIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. cfrag*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s2, startf, s1, β] → [cstepf0, cs1, cstartf0, cσ.l.last, ⌜a '⌝ ^], <all paths>

Additional information

Used terms: cs1, ⌜a '⌝ ^, cσ.l.last, cstepf0, cstartf0

Proof step 46 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 47 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(cσ, ⌜al⌝ ), cstartf0(cσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∃ α, sl. cfrag*(CIOAut(cstartf0, cstepf0))(⌜sl⌝ , α) ∧ cσ.l.last = sl[0] ∧ cs1 = sl.last ∧ α ^ = ⌜a '⌝ ^ ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = cs1 ∧ ⌜al0⌝ + ⌜a '⌝ ^ = α0 ^

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] ⊦ cfrag*(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 48 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ.l.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(cσ, ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cstartf0(cσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = csl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = α0 ^

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cσ

Additional information

Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 49 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ.l.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, cσ = ⌜csl0⌝ , ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, ⌜al⌝ ), cstartf0(cσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = csl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = α0 ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ .l = x; (s)

Proof step 50 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ cσ, α0. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0) ∧ cstartf0(cσ[0]) ∧ finp(α0) ∧ cσ.l.last = csl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = α0 ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜csl0.butlast + csl⌝ , ⌜al + al1⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜csl0.butlast + csl⌝ , ⌜al + al1⌝

Proof step 51 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast + csl⌝ , ⌜al + al1⌝ ) ∧ cstartf0(⌜csl0.butlast + csl⌝ [0]) ∧ finp(⌜al + al1⌝ ) ∧ ⌜csl0.butlast + csl⌝ .l.last = csl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = ⌜al + al1⌝ ^

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] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histC-IOstatestream] ⊦ ⌜x⌝ .l = x; (s) finp(σ) ⊦ (⌜x⌝ + σ).l = x + σ.l; (s) ⊦ finp(⌜x⌝ ); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s)

Proof step 52 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ) ∧ cstartf0((csl0.butlast + csl)[0]) ∧ (csl0.butlast + csl).last = csl.last

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag-trans, seq:cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), cfrag(CIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ cfrag(CIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ), subst:[al, al0, stepf, sl0, startf, sl] → [al, al1, cstepf0, csl, cstartf0, csl0]

Additional information

Used terms: cstartf0, cstepf0, csl0, al, csl, al1

Proof step 53 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), cfrag(CIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ cfrag(CIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ )

A spec-lemma

Proof step 54 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ) ∧ cstartf0((csl0.butlast + csl)[0]) ∧ (csl0.butlast + csl).last = csl.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ cstartf0((csl0.butlast + csl)[0]) ∧ (csl0.butlast + csl).last = csl.last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[histC-IOstatestream], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[y, x] → [csl, csl0.butlast], <all paths>

Additional information

Used simplifier rules: ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histC-IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: csl, csl0.butlast

Proof step 56 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 57 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = csl[0], ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, csl ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ cstartf0((csl0.butlast + csl)[0]) ∧ csl.last = csl.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 58 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = hd(csl), ⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, csl ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ cstartf0((csl0.butlast + csl)[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[histC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl, cs, csl1]

Additional information

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

Proof step 59 from proof refine-implies-bwhist-aux (previous step) (back to tree)

csl0.last = cs, ⌜al1⌝ ^ = ⌜a '⌝ ^, csl = cs + csl1, ⌜al0⌝ = ⌜al⌝ ^, csl ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl⌝ , ⌜al⌝ + ⌜al1⌝ ), cstartf0(csl0[0]), ¬ cstartf0((csl0.butlast + csl)[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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[histC-IOstatestream] x ≠ [] ⊦ x.butlast + x.last ' = x; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) ⊦ ⌜[]⌝ = []; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histC-IOstatestream] ⊦ a ' + x ≠ []; (s)

Proof step 60 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜a '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.butlast⌝ + ⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜al⌝ + ⌜al1⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜al1⌝ ), cstartf0(csl0[0]), ¬ cstartf0((csl0 + csl1)[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: 0, csl1, csl0

Proof step 61 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 62 from proof refine-implies-bwhist-aux (previous step) (back to tree)

aσ.l.last = as0, α6 = α0 ^, α7 = α0 ^ + ⌜a0 '⌝ ^, afrag(AIOAut(astartf, astepf))(aσ, α0), amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1), astartf(aσ[0]), finp(α0), finp(α0 ^), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ α0 ^ + ⌜a0 '⌝ ^ = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 63 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ, ⌜al⌝ ), amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1), astartf(aσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ ⌜al0⌝ + ⌜a0 '⌝ ^ = α ^

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: aσ

Additional information

Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ afrag(AIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 64 from proof refine-implies-bwhist-aux (previous step) (back to tree)

aσ = ⌜asl0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ, ⌜al⌝ ), amove(AIOAut(astartf, astepf))(aσ.l.last, ⌜a0 '⌝ ^, as1), astartf(aσ[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ ⌜al0⌝ + ⌜a0 '⌝ ^ = α ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 65 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), amove(AIOAut(astartf, astepf))(asl0.last, ⌜a0 '⌝ ^, as1), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ ⌜al0⌝ + ⌜a0 '⌝ ^ = α ^

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] → [asl0.last, astepf, ⌜a0 '⌝ ^, as1, astartf], <all paths>

Additional information

Used terms: as1, ⌜a0 '⌝ ^, asl0.last, astepf, astartf

Proof step 66 from proof refine-implies-bwhist-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 67 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∃ α, sl. afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl0.last = sl[0] ∧ as1 = sl.last ∧ α ^ = ⌜a0 '⌝ ^ ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as1 ∧ ⌜al0⌝ + ⌜a0 '⌝ ^ = α ^

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] ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 68 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = asl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = α ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜asl0.butlast + asl⌝ , ⌜al + al1⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜asl0.butlast + asl⌝ , ⌜al + al1⌝

Proof step 69 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast + asl⌝ , ⌜al + al1⌝ ) ∧ astartf(⌜asl0.butlast + asl⌝ [0]) ∧ finp(⌜al + al1⌝ ) ∧ ⌜asl0.butlast + asl⌝ .l.last = asl.last ∧ ⌜al0⌝ + ⌜al1⌝ ^ = ⌜al + al1⌝ ^

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] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histA-IOstatestream] ⊦ ⌜x⌝ .l = x; (s) finp(σ) ⊦ (⌜x⌝ + σ).l = x + σ.l; (s) ⊦ finp(⌜x⌝ ); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s)

Proof step 70 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ) ∧ astartf((asl0.butlast + asl)[0]) ∧ (asl0.butlast + asl).last = asl.last

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:frag-trans, seq:afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), afrag(AIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ afrag(AIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ), subst:[al, sl, al0, stepf, sl0, startf] → [al, asl0, al1, astepf, asl, astartf]

Additional information

Used terms: astartf, astepf, asl0, al, asl, al1

Proof step 71 from proof refine-implies-bwhist-aux (previous step) (back to tree)

afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), afrag(AIOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ afrag(AIOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ )

A spec-lemma

Proof step 72 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ) ∧ astartf((asl0.butlast + asl)[0]) ∧ (asl0.butlast + asl).last = asl.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 73 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf((asl0.butlast + asl)[0]) ∧ (asl0.butlast + asl).last = asl.last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0, asl, asl0.butlast

Proof step 74 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 75 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), ¬ 0 < # asl0.butlast, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf((asl0.butlast + asl)[0]) ∧ (asl0.butlast + asl).last = asl.last

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[histA-IOstatestream] ⊦ [] + x = x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histA-IOstatestream] ⊦ [] + σ = σ; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 76 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = [], asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), ¬ astartf(asl[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ a ' ≠ []; (s) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl0, as, y

Proof step 77 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, 0 < # asl0.butlast, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf(asl0.butlast[0]) ∧ (asl0.butlast + asl).last = asl.last

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 78 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf(hd(asl0.butlast)) ∧ (asl0.butlast + asl).last = asl.last

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[histA-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [asl0.butlast, as, asl1]

Additional information

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

Proof step 79 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as + asl1, asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf(as) ∧ (asl0.butlast + asl).last = asl.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: bin-01: x ≠ [] ⊦ a ∈ x.butlast → a ∈ x; (forward) from specification list-last[histA-IOstatestream] ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) ⊦ ⌜[]⌝ = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[histA-IOstatestream] ⊦ a + x = a ' + x; (s)

Proof step 80 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as ' + asl1, asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), as ∈ asl0.butlast, as ∈ asl0, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf(as) ∧ (asl0.butlast + asl).last = asl.last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[histA-IOstatestream], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[y, x] → [asl, asl0.butlast], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) Used terms: asl, asl0.butlast

Proof step 81 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 82 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as ' + asl1, asl0.last = asl[0], ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], asl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), as ∈ asl0, as ∈ asl0.butlast, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ astartf(as) ∧ asl.last = asl.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 83 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as ' + asl1, asl0.last = hd(asl), ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], asl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), as ∈ asl0.butlast, as ∈ asl0, ¬ astartf(as), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 84 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as ' + asl1, asl0.last = as0, ⌜al1⌝ ^ = ⌜a0 '⌝ ^, asl = as0 + asl2, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], asl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl⌝ , ⌜al⌝ + ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), astartf(asl0[0]), as ∈ asl0, as ∈ asl0.butlast, ¬ astartf(as), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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[histA-IOstatestream] a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s)

Proof step 85 from proof refine-implies-bwhist-aux (previous step) (back to tree)

asl0.butlast = as ' + asl1, ⌜al1⌝ ^ = ⌜a0 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, asl0.butlast ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.last '⌝ + ⌜asl2⌝ , ⌜al1⌝ ), afrag(AIOAut(astartf, astepf))(⌜asl0.butlast⌝ + ⌜asl0.last '⌝ + ⌜asl2⌝ , ⌜al⌝ + ⌜al1⌝ ), astartf(asl0[0]), as ∈ asl0.butlast, as ∈ asl0, ¬ astartf(as), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[histA-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: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl0, as0, y

Proof step 86 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ0.l.last = cs2, α13 = α1 ^, cfrag(CIOAut(cstartf0, cstepf0))(cσ0, α1), cstartf0(cσ0[0]), finp(α1), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as2. aactstream(_as2) = α1 ^ ∧ (α1 ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

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 87 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(cσ0, ⌜al⌝ ), cstartf0(cσ0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cσ0

Additional information

Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 88 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ0 = ⌜csl0⌝ , cfrag(CIOAut(cstartf0, cstepf0))(cσ0, ⌜al⌝ ), cstartf0(cσ0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 89 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: ⌜al⌝ ^ abort: F discard: T computed: F

Additional information

Used terms: ⌜al⌝ ^

Proof step 90 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ^) ∧ finp(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 91 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 92 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ^) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:trace, seq:⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ ^, cstepf0, cstartf0], <all paths>

Additional information

Used terms: ⌜al⌝ ^, cstepf0, cstartf0

Proof step 93 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 94 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ σ, β. ¬(⌜al⌝ ^ = β ^ ∧ cexec(CIOAut(cstartf0, cstepf0))(σ, β)) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 95 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∀ σ, β. ⌜al⌝ ^ ≠ β ^ ∨ ¬ cfrag(CIOAut(cstartf0, cstepf0))(σ, β) ∨ ¬ cstartf0(σ[0]) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: ⌜csl0⌝ , ⌜al⌝

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) Used terms: ⌜csl0⌝ , ⌜al⌝

Proof step 96 from proof refine-implies-bwhist-aux (previous step) (back to tree)

atrace(AIOAut(astartf, astepf))(⌜al⌝ ^), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:trace, seq:⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ ^, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ ^, astepf, astartf

Proof step 97 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 98 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ∃ σ, β. ⌜al⌝ ^ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β) ⊦ ∃ _as2. aactstream(_as2) = ⌜al⌝ ^ ∧ (⌜al⌝ ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 99 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ _as2. aactstream(_as2) = α ^ ∧ (α ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:split-finite-remtau, seq:⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []), subst:[β, al] → [α, ⌜al⌝ ^.l]

Additional information

Used terms: α, ⌜al⌝ ^.l

Proof step 100 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])

A spec-lemma

Proof step 101 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), α ^ = ⌜⌜al⌝ ^.l⌝ ∧ ⌜al⌝ ^.l ≠ [] → (∃ al0, α0. α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜⌜al⌝ ^.l⌝ ∧ al0.last = ⌜al⌝ ^.l.last ∧ α0 ^ = []) ⊦ ∃ _as2. aactstream(_as2) = α ^ ∧ (α ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

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(σ), finp(σ0) ⊦ (σ0 + σ).l = σ0.l + σ.l; (s) ⊦ finp(⌜al⌝ ^); (s) ⊦ finp([]); (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ σ + σ0 = σ ↔ σ0 = [] ∨ # σ = ∞; (s) ⊦ ⌜⌜al⌝ ^.l⌝ = ⌜al⌝ ^; (s) ⊦ ⌜al1⌝ ^.l = [] ↔ ⌜al1⌝ ^ = []; (s)

Proof step 102 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), α ^ ≠ [] → α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ al0.last = (⌜al0⌝ ^.l + α0 ^.l).last ∧ α0 ^ = [] ⊦ ∃ _as2. aactstream(_as2) = α ^ ∧ (α ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α ^ ≠ []

Additional information

Used formulas: α ^ ≠ []

Proof step 103 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), α ^ ≠ [] → α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ al0.last = (⌜al0⌝ ^.l + α0 ^.l).last ∧ α0 ^ = [] ⊦ ∃ _as2. aactstream(_as2) = α ^ ∧ (α ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

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] ⊦ σ + [] = σ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + [] = x; (s) ⊦ [].l = []; (s)

Proof step 104 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ _as2. aactstream(_as2) = ⌜al0⌝ ^ ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al0⌝ ^ × aσ[# al0] abort: F discard: T computed: F

Additional information

Used terms: ⌜al0⌝ ^ × aσ[# al0]

Proof step 105 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ aactstream(⌜al0⌝ ^ × aσ[# al0]) = ⌜al0⌝ ^ ∧ (∃ aσ0, α. afrag(AIOAut(astartf, astepf))(aσ0, α) ∧ astartf(aσ0[0]) ∧ finp(α) ∧ aσ0.l.last = aendstate(⌜al0⌝ ^ × aσ[# al0]) ∧ aactstream(⌜al0⌝ ^ × aσ[# al0]) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aactstream(ασ × st) = ασ; (s) ⊦ aendstate(ασ × st) = st; (s)

Proof step 106 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ aσ0, α. afrag(AIOAut(astartf, astepf))(aσ0, α) ∧ astartf(aσ0[0]) ∧ finp(α) ∧ aσ0.l.last = aσ[# al0] ∧ ⌜al0⌝ ^ = α ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: aσ to 1 + # al0, ⌜al0⌝ abort: F discard: T computed: F

Additional information

Used terms: aσ to 1 + # al0, ⌜al0⌝

Proof step 107 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ finp(⌜al0⌝ ) ∧ (aσ to 1 + # al0).l.last = aσ[# al0] ∧ ⌜al0⌝ ^ = ⌜al0⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 108 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜# al0⌝ < # aσ

Additional information

Used formulas: ⌜# al0⌝ < # aσ

Proof step 109 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[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 ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 110 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 111 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ⊦

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] → [⌜al0⌝ , aσ to 1 + # al0, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al0⌝ , aσ to 1 + # al0, astepf, astartf

Proof step 112 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 113 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), #(aσ to 1 + # al0) ≠ # ⌜al0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al0⌝ → astepf((aσ to 1 + # al0)[n], ⌜al0⌝ [n], (aσ to 1 + # al0)[n +1]))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[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 ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (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⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s)

Proof step 114 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ astepf(aσ[n], al0[n], aσ[n + 1]) ⊦

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] → [⌜al0⌝ + α0, aσ, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al0⌝ + α0, aσ, astepf, astartf

Proof step 115 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 116 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# aσ = #(⌜al0⌝ + α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, n < # al0, astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ astepf(aσ[n], al0[n], aσ[n + 1]), ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf

Proof step 117 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, ⌜# al0⌝ < # aσ, astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ astepf(aσ[n], al0[n], aσ[n + 1]), ∀ n0. ⌜n0⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n0], (⌜al0⌝ + α0)[n0], aσ[n0 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: n abort: F discard: T computed: F

Additional information

Used terms: n

Proof step 118 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, n < # al0, astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ astepf(aσ[n], al0[n], aσ[n + 1]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n, α0, ⌜al0⌝ ], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → ⌜m⌝ < ⌜n⌝ + n∞0; (s) 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 ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n, α0, ⌜al0⌝

Proof step 119 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 120 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], (aσ to 1 + # al0).l.last ≠ aσ[# al0], ⌜al0⌝ ^ ≠ [], al0 ≠ [], ⌜# al0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:to-unwind-end, seq:⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝ , subst:[n, σ] → [# al0, aσ], <all paths>

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ finp(σ to m); (s) finp(σ), finp(σ0) ⊦ (σ0 + σ).l = σ0.l + σ.l; (s) ⊦ ⌜x⌝ .l = x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histA-IOstatestream] ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic Used terms: # al0, aσ

Proof step 121 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝

A spec-lemma

Proof step 122 from proof refine-implies-bwhist-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ ⌜# al0⌝ < # aσ ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

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] → [⌜al0⌝ + α0, aσ, astepf, astartf], <all paths>

Additional information

Used terms: ⌜al0⌝ + α0, aσ, astepf, astartf

Proof step 123 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 124 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# aσ = #(⌜al0⌝ + α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ ⌜# al0⌝ < # aσ, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n +1]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf

Proof step 125 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), ¬ ⌜# al0⌝ < # aσ, ∀ n. ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]) ⊦ afrag(AIOAut(astartf, astepf))(aσ to 1 + # al0, ⌜al0⌝ ) ∧ astartf((aσ to 1 + # al0)[0]) ∧ (aσ to 1 + # al0).l.last = aσ[# al0]

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

Used simplifier rules: ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ¬ n∞ + n∞1 < n∞1; (s) 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

Proof step 126 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α ^ = [], ⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]), α ^ ≠ [] → α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ al0.last = (⌜al0⌝ ^.l + α0 ^.l).last ∧ α0 ^ = [] ⊦ ∃ _as2. aactstream(_as2) = α ^ ∧ (α ^ = [] → astartf(aendstate(_as2))) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 127 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = [], α ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ _as2. aactstream(_as2) = [] ∧ astartf(aendstate(_as2)) ∧ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as2) ∧ aactstream(_as2) = α ^)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: [] × aσ[0] abort: F discard: T computed: F

Additional information

Used terms: [] × aσ[0]

Proof step 128 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α ^ = [], ⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ aactstream([] × aσ[0]) = [] ∧ astartf(aendstate([] × aσ[0])) ∧ (∃ aσ0, α. afrag(AIOAut(astartf, astepf))(aσ0, α) ∧ astartf(aσ0[0]) ∧ finp(α) ∧ aσ0.l.last = aendstate([] × aσ[0]) ∧ aactstream([] × aσ[0]) = α ^)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aactstream(ασ × st) = ασ; (s) ⊦ aendstate(ασ × st) = st; (s)

Proof step 129 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al⌝ ^ = [], α ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al⌝ ), cstartf0(csl0[0]) ⊦ ∃ aσ0, α0. afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ finp(α0) ∧ aσ0.l.last = aσ[0] ∧ [] = α0 ^

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜aσ[0] '⌝ , [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ finp([]); (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ a '.last = a; (s) ⊦ [] ^ = []; (s) Used terms: ⌜aσ[0] '⌝ , []

Proof step 130 from proof refine-implies-bwhist-aux (previous step) (back to tree)

cσ1.l.last = cs4, aσ1.l.last = as3, α4 ^ = α3 ^ + ⌜a1 '⌝ ^, α4 ^ = α2, α8 = α3 ^, α9 = α4 ^, afrag(AIOAut(astartf, astepf))(aσ1, α4), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, α3), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ ^, cs3), cstartf0(cσ1[0]), finp(α3), finp(α3 ^), finp(α4), α4 ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, α4 ^ × aσ1.l.last) ∧ aactstream(_as0) = α3 ^ ∧ (α3 ^ = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 131 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ ^, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ ^, cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-one, seq: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ , subst:[a] → [a1], <all paths>

Additional information

Used terms: a1

Proof step 132 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝

A spec-lemma

Proof step 133 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ ^, a1 = τ, ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ ^, cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ ^, ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ ⌜τ '⌝ ^ = []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s)

Proof step 134 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, [], cs3), cstartf0(cσ1[0]), al0 = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, [], ⌜al0⌝ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al0⌝ × aσ1.l.last abort: F discard: T computed: T

Additional information

Used terms: ⌜al0⌝ × aσ1.l.last

Proof step 135 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, [], cs3), cstartf0(cσ1[0]), al0 = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(⌜al0⌝ × aσ1.l.last) ∧ aactstream(⌜al0⌝ × aσ1.l.last) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜al0⌝ × aσ1.l.last, [], ⌜al0⌝ × aσ1.l.last) ∧ aactstream(⌜al0⌝ × aσ1.l.last) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(⌜al0⌝ × aσ1.l.last)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aendstate(ασ × st) = st; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ aactstream(ασ × st) = ασ; (s) ⊦ ahmove(AHIOAut(startf, stepf))(s, [], s); (s)

Proof step 136 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, [], cs3), cstartf0(cσ1[0]), al0 = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1.l.last ∧ ⌜al0⌝ = α ^

Heuristic quantifier closing applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: aσ1, ⌜al⌝

Additional information

Used terms: aσ1, ⌜al⌝

Proof step 137 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, [], cs3), cstartf0(cσ1[0]), al0 = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1.l.last ∧ ⌜al0⌝ = α ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al⌝ ) ∧ astartf(aσ1[0]) ∧ finp(⌜al⌝ ) ∧ aσ1.l.last = aσ1.l.last ∧ ⌜al0⌝ = ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 138 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, [], cs3), cstartf0(cσ1[0]), ¬ afrag(AIOAut(astartf, astepf))(aσ1, ⌜al⌝ ), al0 = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1.l.last ∧ ⌜al0⌝ = α ^

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: aσ1, ⌜al1⌝

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: aσ1, ⌜al1⌝

Proof step 139 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 140 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-split, seq: ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), subst:[α, al, β2] → [⌜al1⌝ , al0, ⌜a1 '⌝ ]

Additional information

Used terms: ⌜al1⌝ , al0, ⌜a1 '⌝

Proof step 141 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α)

A spec-lemma

Proof step 142 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = ⌜a1 '⌝ ∧ α1 + α2 = ⌜al1⌝ ), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 143 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α1 + α2 = ⌜al1⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , α1 ^ = ⌜al0⌝ , α2 ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α2

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ σ + ⌜nf0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]

Proof step 144 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α1 + α2 = ⌜al1⌝ , α2 ^ = ⌜a1 '⌝ , α1 ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , α2 = ⌜al2⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 145 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α1 + ⌜al2⌝ = ⌜al1⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , α1 ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α1

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)

Proof step 146 from proof refine-implies-bwhist-aux (previous step) (back to tree)

α1 + ⌜al2⌝ = ⌜al1⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , α1 ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a1 '⌝ , α1 = ⌜al3⌝ , ⌜al0⌝ = ⌜al⌝ ^, a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al1⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ⌜al1⌝ ^ = [] → astartf(aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜al1⌝ ^ × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

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] ⊦ a ' ≠ []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)

Proof step 147 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜al3⌝ ^ = []

Additional information

Used formulas: ⌜al3⌝ ^ = []

Proof step 148 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al3⌝ ^ = [], ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

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] ⊦ [] + σ = σ; (s) ⊦ a ' ≠ []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s)

Proof step 149 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , ⌜a1 '⌝ × aσ1.l.last) ∧ aactstream(_as0) = [] ∧ astartf(aendstate(_as0))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: [] × aσ1[0] abort: F discard: T computed: F

Additional information

Used terms: [] × aσ1[0]

Proof step 150 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate([] × aσ1[0]) ∧ aactstream([] × aσ1[0]) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) ([] × aσ1[0], ⌜a1 '⌝ , ⌜a1 '⌝ × aσ1.l.last) ∧ aactstream([] × aσ1[0]) = [] ∧ astartf(aendstate([] × aσ1[0]))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aendstate(ασ × st) = st; (s) ⊦ aactstream(ασ × st) = ασ; (s)

Proof step 151 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1[0] ∧ [] = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) ([] × aσ1[0], ⌜a1 '⌝ , ⌜a1 '⌝ × aσ1.l.last)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 152 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1[0] ∧ [] = α ^

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜aσ1[0] '⌝ , [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ finp([]); (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ a '.last = a; (s) ⊦ [] ^ = []; (s) Used terms: ⌜aσ1[0] '⌝ , []

Proof step 153 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) ([] × aσ1[0], ⌜a1 '⌝ , ⌜a1 '⌝ × aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[IOrefine-CHIO-AHIO-traceA], name:move, seq:⊦ ahmove(AHIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. ahfrag*(AHIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s2, startf, s1, β] → [λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, ⌜a1 '⌝ × aσ1.l.last, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), [] × aσ1[0], ⌜a1 '⌝ ], <all paths>

Additional information

Used terms: ⌜a1 '⌝ × aσ1.l.last, ⌜a1 '⌝ , [] × aσ1[0], λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))

Proof step 154 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 155 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ( ahfrag* (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∧ [] × aσ1[0] = sl[0] ∧ ⌜a1 '⌝ × aσ1.l.last = sl.last ∧ α ^ = ⌜a1 '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 156 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ [] × aσ1[0] ≠ sl[0] ∨ ⌜a1 '⌝ × aσ1.l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: ⌜a1 '⌝ , ([] × aσ1[0])' + (⌜a1 '⌝ × aσ1.l.last)' abort: F discard: T computed: F

Additional information

Used terms: ⌜a1 '⌝ , ([] × aσ1[0])' + (⌜a1 '⌝ × aσ1.l.last)'

Proof step 157 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜([] × aσ1[0])' + (⌜a1 '⌝ × aσ1.l.last)'⌝ , ⌜a1 '⌝ ) ∨ ¬ finp(⌜a1 '⌝ ) ∨ [] × aσ1[0] ≠ (([] × aσ1[0])' + (⌜a1 '⌝ × aσ1.l.last)')[0] ∨ ⌜a1 '⌝ × aσ1.l.last ≠ (([] × aσ1[0])' + (⌜a1 '⌝ × aσ1.l.last)').last ∨ ⌜a1 '⌝ ^ ≠ ⌜a1 '⌝ ⊦

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[histA-hist-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 158 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ , ⌜a1 '⌝ ), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[IOrefine-CHIO-AHIO-traceA], name:frag, seq:⊦ ahfrag(AHIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜a1 '⌝ , ⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ , λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))], <all paths>

Additional information

Used terms: ⌜a1 '⌝ , ⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ , λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))

Proof step 159 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 160 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), #(⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ ) ≠ # ⌜a1 '⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜a1 '⌝ → finp(aactstream((⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ )[n])) ∧ amove(AIOAut(astartf, astepf)) (aendstate((⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ )[n]), ⌜⌜a1 '⌝ [n] '⌝ ^, aendstate((⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ )[n +1])) ∧ aactstream((⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ )[n +1]) = aactstream((⌜([] × aσ1[0])'⌝ + ⌜(⌜a1 '⌝ × aσ1.l.last)'⌝ )[n]) + ⌜⌜a1 '⌝ [n] '⌝ ^)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ a '[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aactstream(ασ × st) = ασ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histA-hist-IOstatestream] ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ a '[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) n ≠ 0 ⊦ (⌜a '⌝ + σ)[(* n)] = σ[n - 1]; (s) ⊦ aendstate(ασ × st) = st; (s) ⊦ finp([]); (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 161 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ amove(AIOAut(astartf, astepf))(aσ1[0], ⌜a1 '⌝ , aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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] → [aσ1[0], astepf, ⌜a1 '⌝ , aσ1.l.last, astartf], <all paths>

Additional information

Used terms: aσ1.l.last, ⌜a1 '⌝ , aσ1[0], astepf, astartf

Proof step 162 from proof refine-implies-bwhist-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 163 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ aσ1[0] = sl[0] ∧ aσ1.l.last = sl.last ∧ α ^ = ⌜a1 '⌝ ) ⊦

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 164 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ aσ1[0] ≠ sl[0] ∨ aσ1.l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: ⌜al3 + al2⌝ , aσ1.l abort: F discard: T computed: F

Additional information

Used terms: ⌜al3 + al2⌝ , aσ1.l

Proof step 165 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜aσ1.l⌝ , ⌜al3 + al2⌝ ) ∨ ¬ finp(⌜al3 + al2⌝ ) ∨ aσ1[0] ≠ aσ1.l[0] ∨ aσ1.l.last ≠ aσ1.l.last ∨ ⌜al3 + al2⌝ ^ ≠ ⌜a1 '⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s)

Proof step 166 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜aσ1.l⌝ , ⌜al3⌝ + ⌜al2⌝ ) ∨ aσ1[0] ≠ aσ1.l[0] ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: aσ1

Additional information

Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ .l = x; (s)

Proof step 167 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al3⌝ ^ = [], ⌜al2⌝ ^ = ⌜a1 '⌝ , aσ1 = ⌜asf0⌝ , a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜aσ1.l⌝ , ⌜al3⌝ + ⌜al2⌝ ) ∨ aσ1[0] ≠ aσ1.l[0] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)

Proof step 168 from proof refine-implies-bwhist-aux (previous step) (back to tree)

[] = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asf0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asf0(0)), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜⌜asf0⌝ .l⌝ , ⌜al3⌝ + ⌜al2⌝ ) ∨ asf0(0) ≠ ⌜asf0⌝ .l[0] ⊦

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] → [⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) 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 Used terms: ⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf

Proof step 169 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 170 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], ⌜al3⌝ ^ ≠ [], a1 ≠ τ, afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝ ∧ (al0 = [] → astartf(aendstate(_as0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 171 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ _as0. (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(_as0) ∧ aactstream(_as0) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (_as0, ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last) ∧ aactstream(_as0) = ⌜al0⌝

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al0⌝ × aσ1[# al3] abort: F discard: T computed: F

Additional information

Used terms: ⌜al0⌝ × aσ1[# al3]

Proof step 172 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aendstate(⌜al0⌝ × aσ1[# al3]) ∧ aactstream(⌜al0⌝ × aσ1[# al3]) = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜al0⌝ × aσ1[# al3], ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last) ∧ aactstream(⌜al0⌝ × aσ1[# al3]) = ⌜al0⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ aactstream(ασ × st) = ασ; (s) ⊦ aendstate(ασ × st) = st; (s)

Proof step 173 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1[# al3] ∧ ⌜al0⌝ = α ^) ∧ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜al0⌝ × aσ1[# al3], ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 174 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ aσ, α. afrag(AIOAut(astartf, astepf))(aσ, α) ∧ astartf(aσ[0]) ∧ finp(α) ∧ aσ.l.last = aσ1[# al3] ∧ ⌜al0⌝ = α ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: aσ1 to # al3 + 1, ⌜al3⌝ abort: F discard: T computed: F

Additional information

Used terms: aσ1 to # al3 + 1, ⌜al3⌝

Proof step 175 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(aσ1 to # al3 + 1, ⌜al3⌝ ) ∧ astartf((aσ1 to # al3 + 1)[0]) ∧ finp(⌜al3⌝ ) ∧ (aσ1 to # al3 + 1).l.last = aσ1[# al3] ∧ ⌜al0⌝ = ⌜al3⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 176 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(aσ1 to # al3 + 1, ⌜al3⌝ ) ∧ astartf((aσ1 to # al3 + 1)[0]) ∧ (aσ1 to # al3 + 1).l.last = aσ1[# al3]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: aσ1

Additional information

Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 177 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , aσ1 = ⌜asl0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(aσ1 to # al3 + 1, ⌜al3⌝ ) ∧ astartf((aσ1 to # al3 + 1)[0]) ∧ (aσ1 to # al3 + 1).l.last = aσ1[# al3]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s)

Proof step 178 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al3 + 1⌝ , ⌜al3⌝ ) ∧ astartf((asl0 to # al3 + 1)[0]) ∧ (asl0 to # al3 + 1).last = asl0[# al3]

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] → [⌜al3⌝ + ⌜al2⌝ , ⌜asl0⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al3⌝ + ⌜al2⌝ , ⌜asl0⌝ , astepf, astartf

Proof step 179 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 180 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# ⌜asl0⌝ = #(⌜al3⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ⌜n⌝ < #(⌜al3⌝ + ⌜al2⌝ ) → astepf(⌜asl0⌝ [n], (⌜al3⌝ + ⌜al2⌝ )[n], ⌜asl0⌝ [n +1]) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al3 + 1⌝ , ⌜al3⌝ ) ∧ astartf((asl0 to # al3 + 1)[0]) ∧ (asl0 to # al3 + 1).last = asl0[# al3]

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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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 ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 181 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al3 + 1⌝ , ⌜al3⌝ ) ∧ astartf((asl0 to # al3 + 1)[0]) ∧ (asl0 to # al3 + 1).last = asl0[# al3]

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 182 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al3 + 1⌝ , ⌜al3⌝ ), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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] → [⌜al3⌝ , ⌜asl0 to # al3 + 1⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al3⌝ , ⌜asl0 to # al3 + 1⌝ , astepf, astartf

Proof step 183 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 184 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), # ⌜asl0 to # al3 + 1⌝ ≠ # ⌜al3⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al3⌝ → astepf(⌜asl0 to # al3 + 1⌝ [n], ⌜al3⌝ [n], ⌜asl0 to # al3 + 1⌝ [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 185 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), # al3 + 1 ≠ #(asl0 to # al3 + 1) ∨ ¬(n < # al3 → astepf((asl0 to # al3 + 1)[n], al3[n], (asl0 to # al3 + 1)[n + 1])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:length-to, seq:¬ # x < n ⊦ #(x to n) = n, subst:[n, x] → [# al3 + 1, asl0], <all paths>

Additional information

Used terms: # al3 + 1, asl0

Proof step 186 from proof refine-implies-bwhist-aux (previous step) (back to tree)

¬ # x < n ⊦ #(x to n) = n

A spec-lemma

Proof step 187 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], # asl0 < # al3 + 1, astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), # al3 + 1 ≠ #(asl0 to # al3 + 1) ∨ ¬(n < # al3 → astepf((asl0 to # al3 + 1)[n], al3[n], (asl0 to # al3 + 1)[n + 1])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) 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)

Proof step 188 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # asl0 ≤ # al3, ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), # al3 + 1 ≠ #(asl0 to # al3 + 1) ∨ ¬(n < # al3 → astepf((asl0 to # al3 + 1)[n], al3[n], (asl0 to # al3 + 1)[n + 1])) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 189 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ # asl0 < # al3 + 1, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), # al3 + 1 ≠ # al3 + 1 ∨ ¬(n < # al3 → astepf((asl0 to # al3 + 1)[n], al3[n], (asl0 to # al3 + 1)[n + 1])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → ¬ n < m; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ¬ m + n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # x = 0 ↔ x = []; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s)

Proof step 190 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al3 ≠ [], asl0 ≠ [], n < # al3 + # al2, n < # asl0, n < # al3, # al3 < # asl0, astartf(hd(asl0)), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf(asl0[n], al3[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 191 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , asl0 = as + asl, ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al3 ≠ [], asl0 ≠ [], # al3 < # asl0, n < # al3, n < # asl0, n < # al3 + # al2, astartf(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf(asl0[n], al3[n], asl0[n + 1]), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → m ≤ 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 fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ a + x = a ' + x; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)

Proof step 192 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al3 ≠ [], asl ≠ [], n < # asl, n < # al3, astartf(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # al3 ≤ # asl, ¬ astepf((as ' + asl)[n], al3[n], asl[n]), ∀ n0. n0 < # asl → astepf((as ' + asl)[n0], (al3 + al2)[n0], asl[n0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 18 terms: n

Additional information

Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: n

Proof step 193 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astartf((asl0 to # al3 + 1)[0]), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:get-finto, seq:¬ # x < n, m < n ⊦ (x to n)[m] = x[m], subst:[m, n, x] → [0, # al3 + 1, asl0], <all paths>

Additional information

Used terms: 0, # al3 + 1, asl0

Proof step 194 from proof refine-implies-bwhist-aux (previous step) (back to tree)

¬ # x < n, m < n ⊦ (x to n)[m] = x[m]

A spec-lemma

Proof step 195 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astartf((asl0 to # al3 + 1)[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]) ⊦ ¬ # asl0 < # al3 + 1 ∧ 0 < # al3 + 1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)

Proof step 196 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # asl0 ≤ # al3, ¬ astartf((asl0 to # al3 + 1)[0]), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 197 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], (asl0 to # al3 + 1).last ≠ asl0[# al3], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:to-unwind-end-fin, seq:m < # x ⊦ x to m + 1 = (x to m) + x[m] ', subst:[m, x] → [# al3, asl0], <all paths>

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] Used terms: # al3, asl0

Proof step 198 from proof refine-implies-bwhist-aux (previous step) (back to tree)

m < # x ⊦ x to m + 1 = (x to m) + x[m] '

A spec-lemma

Proof step 199 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], (asl0 to # al3 + 1).last ≠ asl0[# al3], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ # al3 < # asl0, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 200 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 + 1 = # asl0, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], (asl0 to # al3 + 1).last ≠ asl0[# al3], a1 ≠ τ, al0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # asl0 ≤ # al3, ∀ n. n < # al3 + # al2 → astepf(asl0[n], (al3 + al2)[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 201 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , aσ1 = ⌜asf0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(aσ1 to # al3 + 1, ⌜al3⌝ ) ∧ astartf((aσ1 to # al3 + 1)[0]) ∧ (aσ1 to # al3 + 1).l.last = aσ1[# al3]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 202 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asf0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asf0(0)), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asf0 to # al3 + 1⌝ , ⌜al3⌝ ) ∧ (asf0 to # al3 + 1).last = asf0(# al3)

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] → [⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) 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 Used terms: ⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf

Proof step 203 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 204 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ ahmove (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜al0⌝ × aσ1[# al3], ⌜a1 '⌝ , (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[IOrefine-CHIO-AHIO-traceA], name:move, seq:⊦ ahmove(AHIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. ahfrag*(AHIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s2, startf, s1, β] → [λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), ⌜al0⌝ × aσ1[# al3], ⌜a1 '⌝ ], <all paths>

Additional information

Used terms: (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last, ⌜a1 '⌝ , ⌜al0⌝ × aσ1[# al3], λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))

Proof step 205 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 206 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ( ahfrag* (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∧ ⌜al0⌝ × aσ1[# al3] = sl[0] ∧ (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last = sl.last ∧ α ^ = ⌜a1 '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 207 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ ⌜al0⌝ × aσ1[# al3] ≠ sl[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: aσ1

Additional information

Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 208 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , aσ1 = ⌜asl0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ ⌜al0⌝ × aσ1[# al3] ≠ sl[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ , ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 209 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ ⌜al0⌝ × asl0[# al3] ≠ sl[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: ⌜a1 '⌝ , (⌜al0⌝ × asl0[# al3])' + ((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)' abort: F discard: T computed: F

Additional information

Used terms: ⌜a1 '⌝ , (⌜al0⌝ × asl0[# al3])' + ((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'

Proof step 210 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜(⌜al0⌝ × asl0[# al3])' + ((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ , ⌜a1 '⌝ ) ∨ ¬ finp(⌜a1 '⌝ ) ∨ ⌜al0⌝ × asl0[# al3] ≠ ((⌜al0⌝ × asl0[# al3])' + ((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)')[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last ≠ ((⌜al0⌝ × asl0[# al3])' + ((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)').last ∨ ⌜a1 '⌝ ^ ≠ ⌜a1 '⌝ ⊦

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[histA-hist-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 211 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ , ⌜a1 '⌝ ), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[IOrefine-CHIO-AHIO-traceA], name:frag, seq:⊦ ahfrag(AHIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜a1 '⌝ , ⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ , λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))], <all paths>

Additional information

Used terms: ⌜a1 '⌝ , ⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ , λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^, λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas))

Proof step 212 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 213 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), #(⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ ) ≠ # ⌜a1 '⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜a1 '⌝ → finp(aactstream((⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ )[n])) ∧ amove(AIOAut(astartf, astepf)) (aendstate((⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ )[n]), ⌜⌜a1 '⌝ [n] '⌝ ^, aendstate((⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ )[n +1])) ∧ aactstream((⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ )[n +1]) = aactstream((⌜(⌜al0⌝ × asl0[# al3])'⌝ + ⌜((⌜al0⌝ + ⌜a1 '⌝ ) × asl0.last)'⌝ )[n]) + ⌜⌜a1 '⌝ [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[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜x0⌝ + ⌜z⌝ ↔ x + y = x0 + z; (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ a '[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aactstream(ασ × st) = ασ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[histA-hist-IOstatestream] ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ a '[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) n ≠ 0 ⊦ (⌜a '⌝ + σ)[(* n)] = σ[n - 1]; (s) ⊦ aendstate(ασ × st) = st; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 214 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ amove(AIOAut(astartf, astepf))(asl0[# al3], ⌜a1 '⌝ , asl0.last), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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] → [asl0[# al3], astepf, ⌜a1 '⌝ , asl0.last, astartf], <all paths>

Additional information

Used terms: asl0.last, ⌜a1 '⌝ , asl0[# al3], astepf, astartf

Proof step 215 from proof refine-implies-bwhist-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 216 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl0[# al3] = sl[0] ∧ asl0.last = sl.last ∧ α ^ = ⌜a1 '⌝ ) ⊦

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 217 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ asl0[# al3] ≠ sl[0] ∨ asl0.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: ⌜al2⌝ , asl0 from # al3 abort: F discard: T computed: F

Additional information

Used terms: ⌜al2⌝ , asl0 from # al3

Proof step 218 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al3⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ asl0[# al3] ≠ (asl0 from # al3)[0] ∨ asl0.last ≠ (asl0 from # al3).last ∨ ⌜al2⌝ ^ ≠ ⌜a1 '⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 219 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al3⌝ , ⌜al2⌝ ) ∨ asl0[# al3] ≠ (asl0 from # al3)[0] ∨ asl0.last ≠ (asl0 from # al3).last ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 220 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , asl0 = asl + as ', ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], asl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al3⌝ , ⌜al2⌝ ) ∨ asl0[# al3] ≠ (asl0 from # al3)[0] ∨ as ≠ (asl0 from # al3).last ⊦

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

Proof step 221 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ + ⌜as '⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜asl + as ' from # al3⌝ , ⌜al2⌝ ) ∨ (asl + as ')[# al3] ≠ (asl + as ' from # al3)[0] ∨ as ≠ (asl + as ' from # al3).last ⊦

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] → [⌜al3⌝ + ⌜al2⌝ , ⌜asl⌝ + ⌜as '⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al3⌝ + ⌜al2⌝ , ⌜asl⌝ + ⌜as '⌝ , astepf, astartf

Proof step 222 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 223 from proof refine-implies-bwhist-aux (previous step) (back to tree)

#(⌜asl⌝ + ⌜as '⌝ ) = #(⌜al3⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ⌜n⌝ < #(⌜al3⌝ + ⌜al2⌝ ) → astepf((⌜asl⌝ + ⌜as '⌝ )[n], (⌜al3⌝ + ⌜al2⌝ )[n], (⌜asl⌝ + ⌜as '⌝ )[n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl + as ' from # al3⌝ , ⌜al2⌝ ) ∨ (asl + as ')[# al3] ≠ (asl + as ' from # al3)[0] ∨ as ≠ (asl + as ' from # al3).last ⊦

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

Proof step 224 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl + as ' from # al3⌝ , ⌜al2⌝ ) ∨ as ≠ (asl + as ' from # al3).last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 14

Additional information

Proof step 225 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl + as ' from # al3⌝ , ⌜al2⌝ ), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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] → [⌜al2⌝ , ⌜asl + as ' from # al3⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al2⌝ , ⌜asl + as ' from # al3⌝ , astepf, astartf

Proof step 226 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 227 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # ⌜asl + as ' from # al3⌝ ≠ # ⌜al2⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al2⌝ → astepf(⌜asl + as ' from # al3⌝ [n], ⌜al2⌝ [n], ⌜asl + as ' from # al3⌝ [n +1]))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m = m0 + n0 ∧ n < n0 → ¬ m < m0 + n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (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 228 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), # al2 + 1 ≠ #(asl + as ' from # al3) ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:length-from, seq:¬ # x < n ⊦ #(x from n) = # x - n, subst:[n, x] → [# al3, asl + as '], <all paths>

Additional information

Used terms: # al3, asl + as '

Proof step 229 from proof refine-implies-bwhist-aux (previous step) (back to tree)

¬ # x < n ⊦ #(x from n) = # x - n

A spec-lemma

Proof step 230 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], #(asl + as ') < # al3, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # al2 + 1 ≠ #(asl + as ' from # al3) ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)

Proof step 231 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al3 ≠ [], # asl + 1 < # al3, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # al2 + 1 ≠ #(asl + as ' from # al3) ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 232 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ #(asl + as ') < # al3, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # al2 + 1 ≠ #(asl + as ') - # al3 ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

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[histA-IOstatestream] ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 233 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # al3 ≤ # asl + 1, ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), # al2 + 1 ≠ # asl + 1 - # al3 ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [# asl + 1, # al3, n0]

Additional information

Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: # asl + 1, # al3, n0

Proof step 234 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, # asl + 1 = n0 + # al3, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), # al3 ≤ # asl + 1, ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # al2 + 1 ≠ n0 ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

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 ≤ m + n; (s)

Proof step 235 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, # asl + 1 = n0 + # al3, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), # al2 + 1 ≠ n0 ∨ ¬(n < # al2 → astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1])) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 15

Additional information

Proof step 236 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# asl + 1 = n0 + # al3, # al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, # al2 + 1 ≠ n0, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 2, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ 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

Proof step 237 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# asl + 1 = n0 + # al3, # al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], n < # al2, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1]), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 238 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# asl + 1 = n0 + # al3, # al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al2 ≠ [], n < # al2, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1]), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 16 terms: # al3 + n abort: F discard: T computed: F

Additional information

Used terms: # al3 + n

Proof step 239 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, # asl + 1 = n0 + # al3, ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al2 ≠ [], n < # al2, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1]), # al3 + n < # asl → astepf(asl[# al3 + n], (al3 + al2)[# al3 + n], (asl + as ')[(# al3 + n) + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

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[actionstream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (x + y)[n + # x] = y[n]; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s)

Proof step 240 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# asl + 1 = n0 + # al3, # al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], al2 ≠ [], n < # al2, astartf((asl + as ')[0]), astepf(asl[# al3 + n], al2[n], (asl + as ')[(# al3 + n) + 1]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ¬ astepf((asl + as ')[# al3 + n], al2[n], (asl + as ')[# al3 + n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[histA-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [asl, as ', # al3 + n], <all paths>

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) Used terms: asl, as ', # al3 + n

Proof step 241 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 242 from proof refine-implies-bwhist-aux (previous step) (back to tree)

# al3 + # al2 = # asl, ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], as ≠ (asl + as ' from # al3).last, astartf((asl + as ')[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ n. n < # asl → astepf(asl[n], (al3 + al2)[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[histA-IOstatestream], name:append-from-le, seq: ⊦ n ≤ # x → x + y from n = (x from n) + y, subst:[n, y, x] → [# al3, as ', asl], <all paths>

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[histA-IOstatestream] ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ # x < n → x + y from n = y from (n - # x); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: # al3, as ', asl

Proof step 243 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⊦ n ≤ # x → x + y from n = (x from n) + y

A spec-lemma

Proof step 244 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al3⌝ ^ = ⌜al0⌝ , aσ1 = ⌜asf0⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ1, ⌜al3⌝ + ⌜al2⌝ ), astartf(aσ1[0]), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ ⌜al0⌝ × aσ1[# al3] ≠ sl[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × aσ1.l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ , ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)

Proof step 245 from proof refine-implies-bwhist-aux (previous step) (back to tree)

⌜al3⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a1 '⌝ , ⌜al0⌝ = ⌜al⌝ ^, ⌜al0⌝ + ⌜a1 '⌝ ≠ [], a1 ≠ τ, al0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asf0⌝ , ⌜al3⌝ + ⌜al2⌝ ), astartf(asf0(0)), cfrag(CIOAut(cstartf0, cstepf0))(cσ1, ⌜al⌝ ), cmove(CIOAut(cstartf0, cstepf0))(cσ1.l.last, ⌜a1 '⌝ , cs3), cstartf0(cσ1[0]), ∀ α. ctrace(CIOAut(cstartf0, cstepf0))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ ahfrag (AHIOAut (λ αas. aactstream(αas) = [] ∧ astartf(aendstate(αas)), λ αas, a, αas0. finp(aactstream(αas)) ∧ amove(AIOAut(astartf, astepf))(aendstate(αas), ⌜a '⌝ ^, aendstate(αas0)) ∧ aactstream(αas0) = aactstream(αas) + ⌜a '⌝ ^)) (⌜sl⌝ , α) ∨ ¬ finp(α) ∨ ⌜al0⌝ × asf0(# al3) ≠ sl[0] ∨ (⌜al0⌝ + ⌜a1 '⌝ ) × ⌜asf0⌝ .l.last ≠ sl.last ∨ α ^ ≠ ⌜a1 '⌝ ⊦

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] → [⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) 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 Used terms: ⌜al3⌝ + ⌜al2⌝ , ⌜asf0⌝ , astepf, astartf

Proof step 246 from proof refine-implies-bwhist-aux (previous step) (back to tree)

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

A spec-lemma

Proof Tree for refine-implies-bwhist-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