[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 cforest-and-leqstarrefine-implies-backward-aux (conclusion) (back to tree)

cforest(CIOAut(cstartf, cstepf)), C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cforest(CIOAut(cstartf, cstepf)) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 3 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cforest(CIOAut(cstartf, cstepf)) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IObackward, name:proofobls-backwardsim, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t) ↔ (∀ cs. ∃ as. t(cs, as)) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cstepf(cs, a, cs0) ∧ t(cs0, as0) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, t, astepf] → [cstartf, cstepf, astartf, λ cs, as. ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ), astepf], <all paths>

Additional information

Used terms: λ cs, as. ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ), astepf, astartf, cstepf, cstartf

Proof step 4 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 5 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cforest(CIOAut(cstartf, cstepf)) ⊦ (∀ cs. ∃ as. ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ (∀ cs, as. cstartf(cs) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cstepf(cs, a, cs0) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as0 ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 6 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cforest(CIOAut(cstartf, cstepf)) ⊦ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ ( cstartf(csl.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ) → astartf(asl.last)) ∧ ( cstepf(cs1, a, csl0.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∧ astartf(asl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ asl0.last = as0 ∧ csl0.last = cs2 ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: restricted[restrictedC], name:forest, seq:⊦ cforest(CIOAut(startf, stepf)) ↔ (∀ s2. (∃ α, sl. cexec*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. cexec*(CIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ cexec*(CIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)), subst:[stepf, startf] → [cstepf, cstartf], <all paths>

Additional information

Used terms: cstepf, cstartf

Proof step 7 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ cforest(CIOAut(startf, stepf)) ↔ (∀ s2. (∃ α, sl. cexec*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. cexec*(CIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ cexec*(CIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2))

A spec-lemma

Proof step 8 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s2. (∃ α, sl. cexec*(CIOAut(cstartf, cstepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. cexec*(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cexec*(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ ( cstartf(csl.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ) → astartf(asl.last)) ∧ ( cstepf(cs1, a, csl0.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∧ astartf(asl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ asl0.last = as0 ∧ csl0.last = cs2 ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 9 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ ( cstartf(csl.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ) → astartf(asl.last)) ∧ ( cstepf(cs1, a, csl0.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∧ astartf(asl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ asl0.last = as0 ∧ csl0.last = cs2 ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

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, cstepf, cstartf], <all paths>

Additional information

Used terms: astepf, astartf, cstepf, cstartf

Proof step 10 from proof cforest-and-leqstarrefine-implies-backward-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 11 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α) ⊦ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ ( cstartf(csl.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ) → astartf(asl.last)) ∧ ( cstepf(cs1, a, csl0.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∧ astartf(asl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ asl0.last = as0 ∧ csl0.last = cs2 ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

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 12 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)) ∧ ( cstartf(csl.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs0 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ) → astartf(asl.last)) ∧ ( cstepf(cs1, a, csl0.last) ∧ afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ) ∧ astartf(asl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ asl0.last = as0 ∧ csl0.last = cs2 ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 13 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: cs abort: F discard: T computed: T

Additional information

Used terms: cs

Proof step 14 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ cs = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ cs = csl1.last ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = cs ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 15 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ⌜al⌝ ^

Proof step 16 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^) ∧ finp(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 17 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^) → atrace(AIOAut(astartf, astepf))(⌜al⌝ ^), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 18 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ^), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ⌜al⌝ ^, cstepf, cstartf

Proof step 19 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 20 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ σ, β. ¬(⌜al⌝ ^ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β)) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 21 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ σ, β. ⌜al⌝ ^ ≠ β ^ ∨ ¬ cfrag(CIOAut(cstartf, cstepf))(σ, β) ∨ ¬ cstartf(σ[0]) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: ⌜csl1⌝ , ⌜al⌝

Additional information

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

Proof step 22 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

atrace(AIOAut(astartf, astepf))(⌜al⌝ ^), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedA], 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 23 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 24 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ σ, β. ⌜al⌝ ^ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 25 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α ^ = []

Additional information

Used formulas: α ^ = []

Proof step 26 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

α ^ = [], ⌜al⌝ ^ = [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) Used terms: aσ[0] ', csl1, [], al

Proof step 28 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 29 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 30 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = α ^, α ^ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), α ^ = ⌜⌜al⌝ ^.l⌝ ∧ ⌜al⌝ ^.l ≠ [] → (∃ al0, α0. α = ⌜al0⌝ + α0 ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜⌜al⌝ ^.l⌝ ∧ al0.last = ⌜al⌝ ^.l.last ∧ α0 ^ = []), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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

Proof step 31 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ )

Additional information

Used formulas: afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ )

Proof step 32 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: (aσ to # al0 + 1).l, csl1, al0, al abort: F discard: T computed: F

Additional information

Used terms: (aσ to # al0 + 1).l, csl1, al0, al

Proof step 33 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ afrag(AIOAut(astartf, astepf))(⌜(aσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ) ∧ cstartf(csl1[0]) ∧ csl1.last = csl1.last ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ ∧ (al0 ≠ [] → al0.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 34 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ afrag(AIOAut(astartf, astepf))(⌜(aσ to # al0 + 1).l⌝ , ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream-basic[traceA-IOstatestream], name:sel-embed-fin, seq: ⊦ finp(σ) → ⌜σ.l⌝ = σ, subst:[σ] → [aσ to # al0 + 1], <all paths>

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: aσ to # al0 + 1

Proof step 35 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ finp(σ) → ⌜σ.l⌝ = σ

A spec-lemma

Proof step 36 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), finp(aσ to # al0 + 1), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ) ∧ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s)

Proof step 37 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ finp(σ to m); (s) finp(σ) ⊦ (⌜a '⌝ + σ).l = a ' + σ.l; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ ⌜al⌝ ^ ≠ [] → ⌜al⌝ ^.l.last ≠ τ; (s) Used terms: # al0, aσ

Proof step 38 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 39 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 40 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ + α0), afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedA], 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 41 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 42 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = #(⌜al0⌝ + α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n +1]) ⊦ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

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 43 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ n. ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]) ⊦ astartf((aσ to # al0 + 1).l[0]) ∧ al0.last ≠ τ

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 44 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ afrag(AIOAut(astartf, astepf))(aσ to # al0 + 1, ⌜al0⌝ ), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 45 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 46 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, #(aσ to # al0 + 1) ≠ # ⌜al0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al0⌝ → astepf((aσ to # al0 + 1)[n], ⌜al0⌝ [n], (aσ to # al0 + 1)[n +1]))) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 47 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedA], 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 48 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 49 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α0) → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n +1]), #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 50 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ n0. ⌜n0⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n0], (⌜al0⌝ + α0)[n0], aσ[n0 + 1]), #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 51 from proof cforest-and-leqstarrefine-implies-backward-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(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: #(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝

Additional information

Used formulas: #(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝

Proof step 52 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , #(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ m < n → ⌜m⌝ < ⌜n⌝ + n∞0; (s)

Proof step 53 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , #(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, astartf(aσ[0]), astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceA-IOstatestream], name:get-to, seq:m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m], subst:[m, n, σ] → [n, # al0 + 1, aσ], <all paths>

Additional information

Used terms: n, # al0 + 1, aσ

Proof step 54 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]

A spec-lemma

Proof step 55 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

#(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝ , # aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, astartf(aσ[0]), astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ), n < # al0 + 1 ∧ ¬ # aσ < ⌜# al0 + 1⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 56 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , #(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, astartf(aσ[0]), astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ¬ astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

Used simplifier rules: ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ ⌜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 57 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

#(aσ to # al0 + 1) = ⌜1⌝ + ⌜# al0⌝ , # aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, n < # al0 + 1, astartf(aσ[0]), astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ # aσ < ⌜# al0 + 1⌝ , ¬ astepf(aσ[n], al0[n], (aσ to # al0 + 1)[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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 + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (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 58 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], ⌜al0⌝ ^ ≠ [], al0 ≠ [], n < # al0, ⌜# al0⌝ < # aσ, astartf(aσ[0]), astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ astepf(aσ[n], al0[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

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⌝ [n] = x[n]; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ ⌜n⌝ .n = n; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n, α0, ⌜al0⌝

Proof step 59 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 60 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], #(aσ to # al0 + 1) ≠ ⌜1⌝ + ⌜# al0⌝ , ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, #(aσ to # al0 + 1) ≠ ⌜# al0⌝ + ⌜1⌝ ∨ ¬(n < # al0 → astepf((aσ to # al0 + 1)[n], al0[n], (aσ to # al0 + 1)[n + 1])) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf

Proof step 61 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, #(aσ to # al0 + 1) ≠ ⌜1⌝ + ⌜# al0⌝ , ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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: # al0 + 1, aσ

Proof step 62 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝

A spec-lemma

Proof step 63 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, ⌜al⌝ ^ = ⌜al0⌝ ^, α0 ^ = [], #(aσ to # al0 + 1) ≠ ⌜1⌝ + ⌜# al0⌝ , ⌜al0⌝ ^ ≠ [], al0 ≠ [], # aσ < ⌜# al0 + 1⌝ , astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 64 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# aσ = (⌜# al0⌝ + # α0) + ⌜1⌝ , al0.last = ⌜al0⌝ ^.l.last, α0 ^ = [], ⌜al⌝ ^ = ⌜al0⌝ ^, #(aσ to # al0 + 1) ≠ ⌜1⌝ + ⌜# al0⌝ , ⌜al0⌝ ^ ≠ [], al0 ≠ [], astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), ¬ ⌜# al0⌝ < # aσ, ⌜n⌝ < ⌜# al0⌝ + # α0 → astepf(aσ[n], (⌜al0⌝ + α0)[n], aσ[n + 1]), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

Used simplifier rules: ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ¬ n∞ + n∞1 < n∞1; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 65 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

asl.last = as, csl.last = cs0, ⌜al⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl.last), cstartf(csl[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 66 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl[0]), cstartf(csl.last), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: csl.last abort: F discard: T computed: F

Additional information

Used terms: csl.last

Proof step 67 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl.last), cstartf(csl[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ csl.last = csl1.last ⊦

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 68 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl.last = csl1.last, ⌜al⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl1[0]), cstartf(csl[0]), cstartf(csl1.last), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: ⌜al0⌝ , csl, ⌜al1⌝ , csl1 abort: F discard: F computed: T

Additional information

Used terms: ⌜al0⌝ , csl, ⌜al1⌝ , csl1

Proof step 69 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl.last = csl1.last, ⌜al⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ), cstartf(csl1.last), cstartf(csl[0]), cstartf(csl1[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ finp(⌜al0⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ) ∧ cstartf(csl1[0]) ∧ finp(⌜al1⌝ ) ∧ csl1.last = csl.last ∧ csl1.last = csl1.last → ⌜al0⌝ = ⌜al1⌝ ∧ csl = csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦

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)

Proof step 70 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ), cstartf(csl1.last), cstartf(csl1[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: ⌜al1⌝ , csl1, [], csl1.last ' abort: F discard: T computed: F

Additional information

Used terms: ⌜al1⌝ , csl1, [], csl1.last '

Proof step 71 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al1⌝ ) ∧ cstartf(csl1[0]) ∧ finp(⌜al1⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1.last '⌝ , []) ∧ cstartf(csl1.last '[0]) ∧ finp([]) ∧ csl1.last '.last = csl1.last ∧ csl1.last = csl1.last '.last → ⌜al1⌝ = [] ∧ csl1 = csl1.last ', ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 72 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al⌝ ^ = [], csl1 = csl1.last ', afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-empty-equiv, seq: ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ), subst:[α] → [⌜al⌝ ], <all paths>

Additional information

Used terms: ⌜al⌝

Proof step 73 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)

A spec-lemma

Proof step 74 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 = csl1.last ', afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1.last), cstartf(csl1[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ⌜n⌝ < # ⌜al⌝ → ⌜al⌝ [n] = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 75 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 = csl1.last ', afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. n < # al → al[n] = τ ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[actionstream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [al, a, al0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al, a0, al0

Proof step 76 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al = [], csl1 = csl1.last ', afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1.last), cstartf(csl1[0]), ¬ astartf(asl.last), al ≠ [] → al.last ≠ τ, ∀ n. n < # al → al[n] = τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s)

Proof step 77 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 = csl1.last ', afrag(AIOAut(astartf, astepf))(⌜asl⌝ , []), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: [], ⌜asl⌝ , astepf, astartf

Proof step 78 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 79 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# ⌜asl⌝ = # [] + ⌜1⌝ , csl1 = csl1.last ', astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1.last), cstartf(csl1[0]), ¬ astartf(asl.last), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ⌜n⌝ < # [] → astepf(⌜asl⌝ [n], [][n], ⌜asl⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 80 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl = 1, csl1 = csl1.last ', astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: asl

Additional information

Used simplifier rules: astatelist freely generated by [], +;; ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ a '.last = a; (s) ⊦ # [] = 0; (s)

Proof step 81 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al = al0 + a ', csl1 = csl1.last ', al ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1.last), cstartf(csl1[0]), ¬ astartf(asl.last), al ≠ [] → a ≠ τ, ∀ n. n < # al → al[n] = τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ 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] ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 82 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 = csl1.last ', a ≠ τ, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ + ⌜a '⌝ ), astartf(asl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , []), cstartf(csl1[0]), cstartf(csl1.last), ¬ astartf(asl.last), ∀ n. ¬ # al0 < n → (al0 + a ')[n] = τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 9 terms: # al0

Additional information

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

Proof step 83 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

asl0.last = as0, csl0.last = cs2, ⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(cs1, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 84 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(cs1, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: cs1 abort: F discard: F computed: F

Additional information

Used terms: cs1

Proof step 85 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(cs1, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ cs1 = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ cs1 = csl1.last ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = cs1 ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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 86 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cstartf(csl1[0]), cstartf(csl0[0]), cstepf(csl1.last, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl1.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 10

Additional information

Proof step 87 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl0[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: csl0.last abort: F discard: F computed: F

Additional information

Used terms: csl0.last

Proof step 88 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cstartf(csl1[0]), cstartf(csl0[0]), cstepf(csl1.last, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl0.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ csl0.last = csl1.last ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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 89 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl0.last = csl.last, ⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl[0]), cstartf(csl0[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: ⌜al2⌝ , csl0, ⌜al0⌝ , csl abort: F discard: F computed: T

Additional information

Used terms: ⌜al2⌝ , csl0, ⌜al0⌝ , csl

Proof step 90 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl0.last = csl.last, ⌜al1⌝ ^ = ⌜al2⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl1[0]), cstartf(csl0[0]), cstartf(csl[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ finp(⌜al2⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ finp(⌜al0⌝ ) ∧ csl.last = csl0.last ∧ csl.last = csl.last → ⌜al2⌝ = ⌜al0⌝ ∧ csl0 = csl, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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)

Proof step 91 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl1[0]), cstartf(csl[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ csl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: ⌜al + a⌝ , csl1 + csl.last, ⌜al0⌝ , csl abort: F discard: T computed: F

Additional information

Used terms: ⌜al + a⌝ , csl1 + csl.last, ⌜al0⌝ , csl

Proof step 92 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, cfrag(CIOAut(cstartf, cstepf))(⌜csl1 + csl.last⌝ , ⌜al + a⌝ ) ∧ cstartf((csl1 + csl.last)[0]) ∧ finp(⌜al + a⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ finp(⌜al0⌝ ) ∧ csl.last = (csl1 + csl.last).last ∧ csl.last = csl.last → ⌜al + a⌝ = ⌜al0⌝ ∧ csl1 + csl.last = csl, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 93 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl1[0]), cstartf(csl[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ + ⌜csl.last '⌝ , ⌜al⌝ + ⌜a '⌝ ) ∧ cstartf((csl1 + csl.last ')[0]) → al + a ' = al0 ∧ csl1 + csl.last ' = csl, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 94 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ + ⌜csl.last '⌝ , ⌜al⌝ + ⌜a '⌝ ) ∧ cstartf((csl1 + csl.last ')[0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag-rec-end, seq:⊦ cfrag(CIOAut(startf, stepf))(⌜sl⌝ + ⌜s '⌝ , α + ⌜a '⌝ ) ↔ stepf(sl.last, a, s) ∧ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , α), subst:[α, stepf, a, startf, s, sl] → [⌜al⌝ , cstepf, a, cstartf, csl.last, csl1], <all paths>

Additional information

Used terms: a, ⌜al⌝ , csl.last, csl1, cstepf, cstartf

Proof step 95 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(⌜sl⌝ + ⌜s '⌝ , α + ⌜a '⌝ ) ↔ stepf(sl.last, a, s) ∧ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , α)

A spec-lemma

Proof step 96 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cstartf(csl1[0]), cstartf(csl[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)), (cstepf(csl1.last, a, csl.last) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ )) ∧ cstartf((csl1 + csl.last ')[0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 97 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), ¬ cstartf((csl1 + csl.last ')[0]), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceC-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, csl.last ', csl1], <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, csl.last ', csl1

Proof step 98 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 99 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

al + a ' = al0, csl1 + csl.last ' = csl, ⌜al1⌝ ^ = ⌜al0⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl[0]), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.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.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] 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[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 100 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl.last ' = csl, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, csl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(csl1[0]), cstartf(hd(csl)), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 101 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl.last ' = csl, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, csl = cs + csl0, csl ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl.last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.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[traceC-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s)

Proof step 102 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + (cs ' + csl0).last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, (cs ' + csl0).last), al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), cs ∈ csl1 ∨ cs = (cs ' + csl0).last ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ a ' = x + b ' ↔ a = b ∧ x = []; (ws) ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: csl0, cs '

Proof step 103 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 104 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), cs ∈ csl1 ∨ cs = csl0.last ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.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[traceC-IOstatestream] ⊦ a ∈ x → a ∈ x + y; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] inapp-07: ⊦ a ' + x = y + b ' ∧ x ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[traceC-IOstatestream]

Proof step 105 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, al1 ≠ [] → al1.last ≠ τ, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: al1 ≠ []

Additional information

Used formulas: al1 ≠ []

Proof step 106 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, al1 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 107 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, al1.last ≠ τ, al1 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[actionstream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [al1, a0, al2]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al1, a0, al2

Proof step 108 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, al1 = al2 + a0 ', a0 ≠ τ, al1 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.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[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 109 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ ^, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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] → [a], <all paths>

Additional information

Used terms: a

Proof step 110 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 111 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ ^, csl1 + csl0.last ' = cs ' + csl0, a = τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 112 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: asl0.last abort: F discard: T computed: T

Additional information

Used terms: asl0.last

Proof step 113 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^, csl1 + csl0.last ' = cs ' + csl0, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ amove(AIOAut(astartf, astepf))(asl0.last, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0.last ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 114 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0.last ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: asl0, csl1, al2 + a0, al abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ x + a ' ≠ []; (s) ⊦ x + a = x + a '; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: asl0, csl1, al2 + a0, al

Proof step 115 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ , csl1 + csl0.last ' = cs ' + csl0, a ≠ τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 116 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ , a ≠ τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:append-split, seq: ⊦ finp(σ) ∧ # σ = # σ1 → (σ + σ0 = σ1 + σ2 ↔ σ = σ1 ∧ σ0 = σ2), subst:[σ2, σ1, σ0, σ] → [⌜a '⌝ , ⌜al⌝ ^, ⌜a0 '⌝ , ⌜al2⌝ ^], <all paths>

Additional information

Used terms: ⌜a '⌝ , ⌜al⌝ ^, ⌜a0 '⌝ , ⌜al2⌝ ^

Proof step 117 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ finp(σ) ∧ # σ = # σ1 → (σ + σ0 = σ1 + σ2 ↔ σ = σ1 ∧ σ0 = σ2)

A spec-lemma

Proof step 118 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ , csl1 + csl0.last ' = cs ' + csl0, a ≠ τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)), finp(⌜al2⌝ ^) ∧ # ⌜al2⌝ ^ = # ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 119 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ + ⌜a0 '⌝ = ⌜al⌝ ^ + ⌜a '⌝ , # ⌜al2⌝ ^ ≠ # ⌜al⌝ ^, a ≠ τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜al⌝ ^ + ⌜a '⌝ , ⌜al2⌝ ^ + ⌜a0 '⌝ ], <all paths>

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = 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: ⌜al⌝ ^ + ⌜a '⌝ , ⌜al2⌝ ^ + ⌜a0 '⌝

Proof step 120 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

Proof step 121 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# ⌜al2⌝ ^ = # ⌜al⌝ ^, csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜a0 '⌝ = ⌜a '⌝ , a ≠ τ, a0 ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a0 '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), finp(⌜al2⌝ ^), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜al⌝ ^); (s) ⊦ a ' = b ' ↔ a = b; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s)

Proof step 122 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜al2⌝ ^ = []

Additional information

Used formulas: ⌜al2⌝ ^ = []

Proof step 123 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜al2⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 124 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], ⌜al2⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: asl0[0] abort: F discard: T computed: F

Additional information

Used terms: asl0[0]

Proof step 125 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ amove(AIOAut(astartf, astepf))(asl0[0], ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0[0] ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 126 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], ⌜al2⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ amove(AIOAut(astartf, astepf))(asl0[0], ⌜a '⌝ , asl0.last), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedA], 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[0], astepf, ⌜a '⌝ , asl0.last, astartf], <all paths>

Additional information

Used terms: asl0.last, ⌜a '⌝ , asl0[0], astepf, astartf

Proof step 127 from proof cforest-and-leqstarrefine-implies-backward-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 128 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = [], ⌜al⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl0[0] = sl[0] ∧ asl0.last = sl.last ∧ α ^ = ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 129 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], ⌜al2⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ asl0[0] ≠ sl[0] ∨ asl0.last ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 16 terms: ⌜al2⌝ + ⌜a '⌝ , asl0 abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) finp(σ) ⊦ σ0 + σ = σ ↔ σ0 = []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜al2⌝ + ⌜a '⌝ , asl0

Proof step 130 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], ⌜al2⌝ ^ = [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0[0] ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: asl0[0] ', csl1, [], al abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ a '[0] = a; (s) ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) Used terms: asl0[0] ', csl1, [], al

Proof step 131 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜al2⌝ ^ ≠ [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 132 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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] → [⌜al2⌝ , ⌜al⌝ ^.l]

Additional information

Used terms: ⌜al2⌝ , ⌜al⌝ ^.l

Proof step 133 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 134 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ⌜al2⌝ ^ = ⌜⌜al⌝ ^.l⌝ ∧ ⌜al⌝ ^.l ≠ [] → (∃ al0, α. ⌜al2⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜⌜al⌝ ^.l⌝ ∧ al0.last = ⌜al⌝ ^.l.last ∧ α ^ = []), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜⌜al⌝ ^.l⌝ = ⌜al⌝ ^; (s) ⊦ ⌜al1⌝ ^.l = [] ↔ ⌜al1⌝ ^ = []; (s)

Proof step 135 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al2⌝ ^ = ⌜al⌝ ^, ⌜al0⌝ ^ = ⌜al⌝ ^, α ^ = [], ⌜al2⌝ = ⌜al0⌝ + α, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

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

Proof step 136 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, α ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al2⌝ ^ = ⌜al⌝ ^, α = ⌜al1⌝ , ⌜al2⌝ = ⌜al0⌝ + α, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al2⌝ + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

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

Proof step 137 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: asl0[# al0] abort: F discard: T computed: F

Additional information

Used terms: asl0[# al0]

Proof step 138 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ amove(AIOAut(astartf, astepf))(asl0[# al0], ⌜a '⌝ , asl0.last) ∧ (∃ asl, csl, al, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0[# al0] ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al1⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 139 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ amove(AIOAut(astartf, astepf))(asl0[# al0], ⌜a '⌝ , asl0.last), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedA], 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[# al0], astepf, ⌜a '⌝ , asl0.last, astartf], <all paths>

Additional information

Used terms: asl0.last, ⌜a '⌝ , asl0[# al0], astepf, astartf

Proof step 140 from proof cforest-and-leqstarrefine-implies-backward-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 141 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ asl0[# al0] = sl[0] ∧ asl0.last = sl.last ∧ α ^ = ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 142 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ asl0[# al0] ≠ sl[0] ∨ asl0.last ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 19 terms: ⌜al1 + a⌝ , asl0 from # al0 abort: F discard: T computed: F

Additional information

Used terms: ⌜al1 + a⌝ , asl0 from # al0

Proof step 143 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al0⌝ , ⌜al1 + a⌝ ) ∨ ¬ finp(⌜al1 + a⌝ ) ∨ asl0[# al0] ≠ (asl0 from # al0)[0] ∨ asl0.last ≠ (asl0 from # al0).last ∨ ⌜al1 + a⌝ ^ ≠ ⌜a '⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 144 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al0⌝ , ⌜al1⌝ + ⌜a '⌝ ) ∨ asl0[# al0] ≠ (asl0 from # al0)[0] ∨ asl0.last ≠ (asl0 from # al0).last ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ , ⌜asl0⌝ , astepf, astartf

Proof step 145 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 146 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# ⌜asl0⌝ = #((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ) + ⌜1⌝ , csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ n. ⌜n⌝ < #((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ) → astepf(⌜asl0⌝ [n], ((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ )[n], ⌜asl0⌝ [n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al0⌝ , ⌜al1⌝ + ⌜a '⌝ ) ∨ asl0[# al0] ≠ (asl0 from # al0)[0] ∨ asl0.last ≠ (asl0 from # al0).last ⊦

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⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) 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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 147 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al0⌝ , ⌜al1⌝ + ⌜a '⌝ ) ∨ asl0[# al0] ≠ (asl0 from # al0)[0] ∨ asl0.last ≠ (asl0 from # al0).last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 20

Additional information

Proof step 148 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from # al0⌝ , ⌜al1⌝ + ⌜a '⌝ ), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ⌜al1⌝ + ⌜a '⌝ , ⌜asl0 from # al0⌝ , astepf, astartf

Proof step 149 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 150 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), # ⌜asl0 from # al0⌝ ≠ #(⌜al1⌝ + ⌜a '⌝ ) + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < #(⌜al1⌝ + ⌜a '⌝ ) → astepf(⌜asl0 from # al0⌝ [n], (⌜al1⌝ + ⌜a '⌝ )[n], ⌜asl0 from # al0⌝ [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) 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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) 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) ¬ # x < n ⊦ #(x from n) = # x - n; (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⌝ = ⌜# x⌝ ; (s)

Proof step 151 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), 2 + # al1 ≠ # asl0 - # al0 ∨ ¬(¬ # al1 < n → astepf((asl0 from # al0)[n], (al1 + a ')[n], (asl0 from # al0)[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] → [# asl0, # al0, n0]

Additional information

Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) 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 n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: # asl0, # al0, n0

Proof step 152 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl0 = n0 + # al0, csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # al0 ≤ # asl0, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), 2 + # al1 ≠ n0 ∨ ¬(¬ # al1 < n → astepf((asl0 from # al0)[n], (al1 + a ')[n], (asl0 from # al0)[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 eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic

Proof step 153 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # al0 ≤ # asl0, n ≤ # al1, ¬ astepf((asl0 from # al0)[n], (al1 + a ')[n], (asl0 from # al0)[n + 1]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceA-IOstatestream], name:get-from-01, seq:m + m0 < # x ⊦ (x from m)[m0] = x[m + m0], subst:[m0, m, x] → [n, # al0, asl0], <all paths>

Additional information

Used terms: n, # al0, asl0

Proof step 154 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]

A spec-lemma

Proof step 155 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al1, # al0 ≤ # asl0, ¬ # al0 + n < # asl0, ¬ astepf((asl0 from # al0)[n], (al1 + a ')[n], (asl0 from # al0)[n + 1]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

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) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 156 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # asl0 ≤ # al0 + n, n ≤ # al1, # al0 ≤ # asl0, ¬ astepf((asl0 from # al0)[n], (al1 + a ')[n], (asl0 from # al0)[n + 1]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

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 + n0 ↔ n ≤ n0; (s) ⊦ m ≤ m + n; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m + m0 ≤ m ↔ m0 = 0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 157 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], # al0 + n < # asl0, astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al1, # al0 ≤ # asl0, ¬ astepf(asl0[# al0 + n], (al1 + a ')[n], (asl0 from # al0)[n + 1]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

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 n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m = n + 1 → ¬ m ≤ n; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ m; (s) n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 158 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], asl0 ≠ [], csl0 ≠ [], n < 2 + # al1, astartf(hd(asl0)), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # al0 ≤ # asl0, n ≤ # al1, ¬ astepf(asl0[# al0 + n], (al1 + a ')[n], asl0[# al0 + n + 1]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 159 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, asl0 = as + asl, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], asl0 ≠ [], csl0 ≠ [], n < 2 + # al1, astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al1, # al0 ≤ # asl0, ¬ astepf(asl0[# al0 + n], (al1 + a ')[n], asl0[# al0 + n + 1]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] 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 +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s)

Proof step 160 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl = # al0 + # al1 + 1, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], n < 2 + # al1, astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al1, # al0 ≤ # asl + 1, ¬ astepf((as ' + asl)[# al0 + n], (al1 + a ')[n], asl[# al0 + n]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n0. ¬ # al0 + # al1 < n0 → astepf((as ' + asl)[n0], (al0 + al1 + a ')[n0], asl[n0]) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 23 terms: # al0 + n abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ (x + y)[n + # x] = y[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: # al0 + n

Proof step 161 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, asl0[# al0] ≠ (asl0 from # al0)[0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceA-IOstatestream], name:get-from-01, seq:m + m0 < # x ⊦ (x from m)[m0] = x[m + m0], subst:[m0, m, x] → [0, # al0, asl0], <all paths>

Additional information

Used simplifier rules: ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: 0, # al0, asl0

Proof step 162 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]

A spec-lemma

Proof step 163 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], asl0[# al0] ≠ (asl0 from # al0)[0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ # al0 + 0 < # asl0, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[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) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)

Proof step 164 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, asl0[# al0] ≠ (asl0 from # al0)[0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # asl0 ≤ # al0, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + m0 ≤ m ↔ m0 = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 165 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, asl0.last ≠ (asl0 from # al0).last, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: asl0, as, asl

Proof step 166 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], asl0 = asl + as ', ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], as ≠ (asl0 from # al0).last, asl0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[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[traceA-IOstatestream] ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)

Proof step 167 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl = # al0 + # al1 + 1, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], as ≠ (asl + as ' from # al0).last, csl0 ≠ [], astartf((asl + as ')[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf((asl + as ')[n], (al0 + al1 + a ')[n], (asl + as ')[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-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: # al0, as ', asl

Proof step 168 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 169 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ asl, csl, al, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = asl0[# al0] ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al1⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: asl0 to # al0 + 1, csl1, al0, al abort: F discard: T computed: F

Additional information

Used terms: asl0 to # al0 + 1, csl1, al0, al

Proof step 170 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al0 + 1⌝ , ⌜al0⌝ ) ∧ astartf((asl0 to # al0 + 1)[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ) ∧ cstartf(csl1[0]) ∧ (asl0 to # al0 + 1).last = asl0[# al0] ∧ csl1.last = csl1.last ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ ∧ (al0 ≠ [] → al0.last ≠ τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 171 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al0 + 1⌝ , ⌜al0⌝ ) ∧ astartf((asl0 to # al0 + 1)[0]) ∧ (asl0 to # al0 + 1).last = asl0[# al0] ∧ al0.last ≠ τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: (⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ , ⌜asl0⌝ , astepf, astartf

Proof step 172 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 173 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# ⌜asl0⌝ = #((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ) + ⌜1⌝ , csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ n. ⌜n⌝ < #((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ ) → astepf(⌜asl0⌝ [n], ((⌜al0⌝ + ⌜al1⌝ ) + ⌜a '⌝ )[n], ⌜asl0⌝ [n +1]) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al0 + 1⌝ , ⌜al0⌝ ) ∧ astartf((asl0 to # al0 + 1)[0]) ∧ (asl0 to # al0 + 1).last = asl0[# al0] ∧ al0.last ≠ τ

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⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) 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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 174 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]) ⊦ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al0 + 1⌝ , ⌜al0⌝ ) ∧ astartf((asl0 to # al0 + 1)[0]) ∧ (asl0 to # al0 + 1).last = asl0[# al0] ∧ al0.last ≠ τ

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌜al⌝ ^ ≠ [] → ⌜al⌝ ^.l.last ≠ τ; (s)

Proof step 175 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 to # al0 + 1⌝ , ⌜al0⌝ ), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 176 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 177 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), # ⌜asl0 to # al0 + 1⌝ ≠ # ⌜al0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al0⌝ → astepf(⌜asl0 to # al0 + 1⌝ [n], ⌜al0⌝ [n], ⌜asl0 to # al0 + 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 178 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), # al0 + 1 ≠ #(asl0 to # al0 + 1) ∨ ¬(n < # al0 → astepf((asl0 to # al0 + 1)[n], al0[n], (asl0 to # al0 + 1)[n + 1])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: # al0 + 1, asl0

Proof step 179 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 180 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], # asl0 < # al0 + 1, astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), # al0 + 1 ≠ #(asl0 to # al0 + 1) ∨ ¬(n < # al0 → astepf((asl0 to # al0 + 1)[n], al0[n], (asl0 to # al0 + 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 181 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # asl0 ≤ # al0, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), # al0 + 1 ≠ #(asl0 to # al0 + 1) ∨ ¬(n < # al0 → astepf((asl0 to # al0 + 1)[n], al0[n], (asl0 to # al0 + 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 + m0 ≤ m ↔ m0 = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 182 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ # asl0 < # al0 + 1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), # al0 + 1 ≠ # al0 + 1 ∨ ¬(n < # al0 → astepf((asl0 to # al0 + 1)[n], al0[n], (asl0 to # al0 + 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) n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic 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) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ n < m; (s)

Proof step 183 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], asl0 ≠ [], csl0 ≠ [], # al0 < # asl0, n < # al0, n + 1 < # asl0, n < # asl0, astartf(hd(asl0)), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al0 + # al1, ¬ astepf(asl0[n], al0[n], asl0[n + 1]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 184 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], asl0 = as + asl, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], asl0 ≠ [], csl0 ≠ [], n < # asl0, n + 1 < # asl0, n < # al0, # al0 < # asl0, astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, n ≤ # al0 + # al1, ¬ astepf(asl0[n], al0[n], asl0[n + 1]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[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 ≤ n → (n < m ↔ false); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ a + x = a ' + x; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ a ' + x ≠ []; (s) n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s)

Proof step 185 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl = # al0 + # al1 + 1, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], asl ≠ [], csl0 ≠ [], n < # asl, n < # al0, astartf(as), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # al0 ≤ # asl, n ≤ # al0 + # al1, ¬ astepf((as ' + asl)[n], al0[n], asl[n]), ∀ n0. ¬ # al0 + # al1 < n0 → astepf((as ' + asl)[n0], (al0 + al1 + a ')[n0], asl[n0]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 23 terms: n

Additional information

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

Proof step 186 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ astartf((asl0 to # al0 + 1)[0]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0, # al0 + 1, asl0

Proof step 187 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 188 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ astartf((asl0 to # al0 + 1)[0]), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]) ⊦ ¬ # asl0 < # al0 + 1 ∧ 0 < # al0 + 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 189 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # asl0 ≤ # al0, ¬ astartf((asl0 to # al0 + 1)[0]), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + m0 ≤ m ↔ m0 = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 190 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, (asl0 to # al0 + 1).last ≠ asl0[# al0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 191 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 192 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, 2 + # al0 + # al1 = # asl0, al0.last = ⌜al⌝ ^.l.last, ⌜al0⌝ ^ = ⌜al⌝ ^, ⌜al1⌝ ^ = [], (asl0 to # al0 + 1).last ≠ asl0[# al0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, ¬ # al0 < # asl0, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[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 193 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

2 + # al0 + # al1 = # asl0, csl1 + csl0.last ' = cs ' + csl0, al0.last = ⌜al⌝ ^.l.last, ⌜al1⌝ ^ = [], ⌜al0⌝ ^ = ⌜al⌝ ^, (asl0 to # al0 + 1).last ≠ asl0[# al0], ⌜al⌝ ^ ≠ [], a ≠ τ, al0 ≠ [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, # asl0 ≤ # al0, ∀ n. ¬ # al0 + # al1 < n → astepf(asl0[n], (al0 + al1 + a ')[n], asl0[n + 1]), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: ⊦ m + m0 ≤ m ↔ m0 = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 194 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al1⌝ ^ = ⌜al⌝ ^ + ⌜a '⌝ ^, al1 = [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al1⌝ ), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜a '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, a, csl0.last), cs ∈ csl1, al1 ≠ [] → al1.last ≠ τ, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 195 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , []), astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: [], ⌜asl0⌝ , astepf, astartf

Proof step 196 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 197 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# ⌜asl0⌝ = # [] + ⌜1⌝ , csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ n. ⌜n⌝ < # [] → astepf(⌜asl0⌝ [n], [][n], ⌜asl0⌝ [n +1]) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 198 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl0 = 1, csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: asl0

Additional information

Used simplifier rules: astatelist freely generated by [], +;; ⊦ # [] = 0; (s)

Proof step 199 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

# asl0 = 1, csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], asl0 = as0 + asl1, csl0 ≠ [], astartf(asl0[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], asl0.last) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 200 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], astartf(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: as0

Proof step 201 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], astartf(as0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cstartf(cs), cstartf(csl1[0]), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ amove(AIOAut(astartf, astepf))(as0, [], as0) ∧ (∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as0 ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 202 from proof cforest-and-leqstarrefine-implies-backward-aux (previous step) (back to tree)

csl1 + csl0.last ' = cs ' + csl0, ⌜al⌝ ^ = [], csl0 ≠ [], astartf(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜al⌝ + ⌜τ '⌝ ), cstartf(csl1[0]), cstartf(cs), cstepf(csl1.last, τ, csl0.last), cs ∈ csl1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ s2. (∃ α, csl1. cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , α) ∧ cstartf(csl1[0]) ∧ finp(α) ∧ s2 = csl1.last) ∧ (∀ α1, sl1, α2, sl2. cfrag(CIOAut(cstartf, cstepf))(⌜sl1⌝ , α1) ∧ cstartf(sl1[0]) ∧ finp(α1) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜sl2⌝ , α2) ∧ cstartf(sl2[0]) ∧ finp(α2) ∧ sl2.last = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ asl, csl, al, al0. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ) ∧ cstartf(csl[0]) ∧ asl.last = as0 ∧ csl.last = csl1.last ∧ ⌜al⌝ ^ = ⌜al0⌝ ^ ∧ (al ≠ [] → al.last ≠ τ)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as0 ', csl1, [], al abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ afrag(AIOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ a '[0] = a; (s) ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) Used terms: as0 ', csl1, [], al

Proof Tree for cforest-and-leqstarrefine-implies-backward-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