| ≤F(cioaut, aioaut) ⊦ C_≤T_A(cioaut, aioaut) |
≤F(cioaut, aioaut), ¬ C_≤T_A(cioaut, aioaut) ⊦
| ≤F(cioaut, aioaut), ¬ C_≤T_A(cioaut, aioaut) ⊦ |
cioaut = CIOAut(cstartf0, cstepf0), ≤F(cioaut, aioaut), ¬ C_≤T_A(cioaut, aioaut) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cstartf0, cstepf0), ≤F(cioaut, aioaut), ¬ C_≤T_A(cioaut, aioaut) ⊦ |
≤F(CIOAut(cstartf0, cstepf0), aioaut), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut) ⊦
| ≤F(CIOAut(cstartf0, cstepf0), aioaut), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
aioaut = AIOAut(astartf0, astepf0), ≤F(CIOAut(cstartf0, cstepf0), aioaut), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), ≤F(CIOAut(cstartf0, cstepf0), aioaut), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦
| ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦ |
⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α))
≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ∃ α. ¬(ctrace(CIOAut(cstartf0, cstepf0))(α) → atrace(AIOAut(astartf0, astepf0))(α)) ⊦
Used terms: astepf0, astartf0, cstepf0, cstartf0
| ⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α)) |
| ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ∃ α. ¬(ctrace(CIOAut(cstartf0, cstepf0))(α) → atrace(AIOAut(astartf0, astepf0))(α)) ⊦ |
ctrace(CIOAut(cstartf0, cstepf0))(α), ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α) ⊦
| ctrace(CIOAut(cstartf0, cstepf0))(α), ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α) ⊦ |
⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))
≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α), ∃ σ, β. α = β ^ ∧ cexec(CIOAut(cstartf0, cstepf0))(σ, β) ⊦
Used terms: α, cstepf0, cstartf0
| ⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)) |
| ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α), ∃ σ, β. α = β ^ ∧ cexec(CIOAut(cstartf0, cstepf0))(σ, β) ⊦ |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦
Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ |
⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r))
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∃ r. fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r) ⊦
Used terms: AIOAut(astartf0, astepf0), CIOAut(cstartf0, cstepf0)
| ⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r)) |
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∃ r. fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r) ⊦ |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n, as. ∃ asl. cstepf0(cσ[n], α0[n], cσ[n + 1]) ∧ r(as, cσ[n]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ # al + 1 = # asl ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as) ⊦
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ ∀ n, as. ∃ asl. cstepf0(cσ[n], α0[n], cσ[n + 1]) ∧ r(as, cσ[n]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ # al + 1 = # asl ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as)
Used formulas: ∀ n, as. ∃ asl. cstepf0(cσ[n], α0[n], cσ[n + 1]) ∧ r(as, cσ[n]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ # al + 1 = # asl ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as)
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n, as. ∃ asl. cstepf0(cσ[n], α0[n], cσ[n + 1]) ∧ r(as, cσ[n]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ # al + 1 = # asl ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as) ⊦ |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∃ as. r(as, cσ[0]) ∧ astartf0(as) ⊦
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as)
Used formulas: ∃ as. r(as, cσ[0]) ∧ astartf0(as)
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∃ as. r(as, cσ[0]) ∧ astartf0(as) ⊦ |
astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
| astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
⊦ ∃ lf. lf(0) = a ' ∧ (∀ n. lf(n + 1) = nextl(n, lf(n).last))
astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∃ lf. lf(0) = as ' ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) ⊦
Used terms: as, f2_n_astate->astatelist
| ⊦ ∃ lf. lf(0) = a ' ∧ (∀ n. lf(n + 1) = nextl(n, lf(n).last)) |
| astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∃ lf. lf(0) = as ' ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
cσ = ⌜csl0⌝ , lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦
cσ = ⌜csf0⌝ , lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦
Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;;
| cσ = ⌜csl0⌝ , lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , α0), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], α0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , α0), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], α0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
lf(0) = as ', α0 = ⌜al0⌝ , astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , α0), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(csl0[n0], α0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| lf(0) = as ', α0 = ⌜al0⌝ , astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , α0), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(csl0[n0], α0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), cexec*(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ⊦ ∃ asl, al0. r(asl.last, csl.last) ∧ aexec*(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∃ asl, al1. r(asl.last, csl0.last) ∧ aexec*(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^ ⊦
Used simplifier rules: ⊦ cexec*(CIOAut(startf, stepf))(σ, β) ↔ cexec(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) Used terms: cstartf0, cstepf0, astartf0, astepf0, r, csl0, al0
| fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), cexec*(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ⊦ ∃ asl, al0. r(asl.last, csl.last) ∧ aexec*(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ |
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∃ asl, al1. r(asl.last, csl0.last) ∧ aexec*(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ ⌜al1⌝ ^ = ⌜al0⌝ ^ ⊦ |
⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(as), astartf0(asl[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), r(asl.last, csl0.last), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ aexec*(AIOAut(startf, stepf))(σ, β) ↔ aexec(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(as), astartf0(asl[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), r(asl.last, csl0.last), ¬ atrace(AIOAut(astartf0, astepf0))(⌜al0⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))
⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(asl[0]), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(asl.last, csl0.last), r(as, csl0[0]), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ σ, β. ¬(⌜al0⌝ ^ = β ^ ∧ aexec(AIOAut(astartf0, astepf0))(σ, β)) ⊦
Used terms: ⌜al0⌝ ^, astepf0, astartf0
| ⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)) |
| ⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(asl[0]), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(asl.last, csl0.last), r(as, csl0[0]), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ σ, β. ¬(⌜al0⌝ ^ = β ^ ∧ aexec(AIOAut(astartf0, astepf0))(σ, β)) ⊦ |
⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(as), astartf0(asl[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), r(asl.last, csl0.last), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ σ, β. ⌜al0⌝ ^ ≠ β ^ ∨ ¬ afrag(AIOAut(astartf0, astepf0))(σ, β) ∨ ¬ astartf0(σ[0]) ⊦
Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| ⌜al1⌝ ^ = ⌜al0⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ), astartf0(as), astartf0(asl[0]), cfrag(CIOAut(cstartf0, cstepf0))(⌜csl0⌝ , ⌜al0⌝ ), cstartf0(csl0[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csl0[0]), r(asl.last, csl0.last), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csl0[n0], al0[n0], csl0[n0 + 1]) ∧ r(as0, csl0[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜al0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csl0[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ σ, β. ⌜al0⌝ ^ ≠ β ^ ∨ ¬ afrag(AIOAut(astartf0, astepf0))(σ, β) ∨ ¬ astartf0(σ[0]) ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) Used terms: ⌜asl⌝ , ⌜al1⌝
| cσ = ⌜csf0⌝ , lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , α0), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), α0[n0], csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , α0), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), α0[n0], csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
lf(0) = as ', α0 = ⌜f_n->action⌝ , astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , α0), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(csf0(n0), α0[n0], csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| lf(0) = as ', α0 = ⌜f_n->action⌝ , astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , α0), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(csf0(n0), α0[n0], csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ []
Used formulas: ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ []
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
Used formulas: ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
startf(sf(0)), ∀ n. amove(AIOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ atrace(AIOAut(startf, stepf))(⌜af⌝ ^)
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ astartf0(hd(lf(0 + 1))) ∧ (∀ n. amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf((n + 1) + 1))))
Used terms: astartf0, λ n. hd(lf(n + 1)), astepf0, f_n->action
| startf(sf(0)), ∀ n. amove(AIOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ atrace(AIOAut(startf, stepf))(⌜af⌝ ^) |
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ astartf0(hd(lf(0 + 1))) ∧ (∀ n. amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf((n + 1) + 1)))) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ astartf0(hd(lf(1))) ∧ amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf(2 + n)))
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ astartf0(hd(lf(1))) ∧ amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf(2 + n))) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf(2 + n))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(0), f_n->action(0), csf0(0 + 1)) ∧ r(as, csf0(0)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ) ∧ # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as) ∧ ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^ ∧ r(f2_n_astate->astatelist(0, as).last, csf0(0 + 1)) ∧ hd(f2_n_astate->astatelist(0, as)) = as, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
Used terms: 0, as
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(0), f_n->action(0), csf0(0 + 1)) ∧ r(as, csf0(0)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ) ∧ # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as) ∧ ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^ ∧ r(f2_n_astate->astatelist(0, as).last, csf0(0 + 1)) ∧ hd(f2_n_astate->astatelist(0, as)) = as, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(0), f_n->action(0), csf0(1)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ) ∧ # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as) ∧ ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^ ∧ r(f2_n_astate->astatelist(0, as).last, csf0(1)) ∧ hd(f2_n_astate->astatelist(0, as)) = as, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(0), f_n->action(0), csf0(1)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ) ∧ # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as) ∧ ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^ ∧ r(f2_n_astate->astatelist(0, as).last, csf0(1)) ∧ hd(f2_n_astate->astatelist(0, as)) = as, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
# f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(0, as).last, csf0(1)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csf0⌝ = # ⌜f_n->action⌝ + ⌜1⌝ , lf(0) = as ', astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. ⌜n⌝ < # ⌜f_n->action⌝ → cstepf0(⌜csf0⌝ [n], ⌜f_n->action⌝ [n], ⌜csf0⌝ [n +1]) ⊦
Used terms: ⌜f_n->action⌝ , ⌜csf0⌝ , cstepf0, cstartf0
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csf0⌝ = # ⌜f_n->action⌝ + ⌜1⌝ , lf(0) = as ', astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. ⌜n⌝ < # ⌜f_n->action⌝ → cstepf0(⌜csf0⌝ [n], ⌜f_n->action⌝ [n], ⌜csf0⌝ [n +1]) ⊦ |
lf(0) = as ', astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (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⌝ + ∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| lf(0) = as ', astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(0), f_n->action(0), csf0(1)), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: 0
| # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(0, as).last, csf0(1)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', lf(0) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(0, as).last, csf0(1)), r(as, csf0(0)), r(lf(0).last, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
Used terms: 0
| # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', lf(0) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(0, as).last, csf0(1)), r(as, csf0(0)), r(lf(0).last, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
# f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(0, as).last, csf0(1)), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a ' ≠ []; (s)
| # f2_n_astate->actionlist(0, as) + 1 = # f2_n_astate->astatelist(0, as), ⌜f2_n_astate->actionlist(0, as)⌝ ^ = ⌜f_n->action(0) '⌝ ^, hd(f2_n_astate->astatelist(0, as)) = as, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(0, as)⌝ , ⌜f2_n_astate->actionlist(0, as)⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(0, as).last, csf0(1)), r(as, csf0(0)), ¬ astartf0(hd(lf(1))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a '.last = a; (s) Used terms: 0
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ amove(AIOAut(astartf0, astepf0))(hd(lf(n + 1)), ⌜f_n->action(n) '⌝ ^, hd(lf(2 + n))), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬(afrag*(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∧ hd(lf(n + 1)) = sl[0] ∧ hd(lf(2 + n)) = sl.last ∧ α ^ = ⌜f_n->action(n) '⌝ ^) ⊦
Used terms: hd(lf(2 + n)), ⌜f_n->action(n) '⌝ ^, hd(lf(n + 1)), astepf0, astartf0
| ⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬(afrag*(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∧ hd(lf(n + 1)) = sl[0] ∧ hd(lf(2 + n)) = sl.last ∧ α ^ = ⌜f_n->action(n) '⌝ ^) ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜f_n->action(n) '⌝ ^ ⊦
Used simplifier rules: ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜f_n->action(n) '⌝ ^ ⊦ |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜f_n->action(n) '⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦
Used terms: n
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜f_n->action(n) '⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) ⊦ |
# al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
| # al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
Used terms: n
| # al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ¬ afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ) ∨ ¬ finp(⌜al⌝ ) ∨ hd(lf(n + 1)) ≠ lf(n + 1)[0] ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ∨ ⌜al⌝ ^ ≠ ⌜al⌝ ^ ⊦
Used terms: ⌜al⌝ , lf(n + 1)
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ¬ afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ) ∨ ¬ finp(⌜al⌝ ) ∨ hd(lf(n + 1)) ≠ lf(n + 1)[0] ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ∨ ⌜al⌝ ^ ≠ ⌜al⌝ ^ ⊦ |
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, hd(lf(n + 1)) ≠ lf(n + 1)[0] ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, hd(lf(n + 1)) ≠ lf(n + 1)[0] ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ⊦ |
⊦ x ≠ [] → x[0] = hd(x)
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], hd(lf(n + 1)) ≠ hd(lf(n + 1)) ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ⊦
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: lf(n + 1)
| ⊦ x ≠ [] → x[0] = hd(x) |
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], hd(lf(n + 1)) ≠ hd(lf(n + 1)) ∨ hd(lf(2 + n)) ≠ lf(n + 1).last ⊦ |
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', hd(lf(2 + n)) ≠ lf(n + 1).last, lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(0) = as ', hd(lf(2 + n)) ≠ lf(n + 1).last, lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(n + 1).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ hd(lf(n + 1)) ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(n + 1) = as0 + x0, hd(lf(2 + n)) ≠ lf(n + 1).last, lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: lf(n + 1), head, tail
| # al + 1 = # lf(n + 1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), lf(n + 1) = as0 + x0, hd(lf(2 + n)) ≠ lf(n + 1).last, lf(n + 1) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜lf(n + 1)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(lf(n + 1).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] ⊦ a + x = a ' + x; (s)
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, lf((n + 1) + 1) = f2_n_astate->astatelist(n + 1, lf(n + 1).last), hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
Used terms: n + 1
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, lf((n + 1) + 1) = f2_n_astate->astatelist(n + 1, lf(n + 1).last), hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', lf(2 + n) = f2_n_astate->astatelist(n + 1, (as0 ' + x0).last), hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', lf(2 + n) = f2_n_astate->astatelist(n + 1, (as0 ' + x0).last), hd(lf(2 + n)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(lf(2 + n)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, lf(n + 1).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n + 1, lf(n + 1).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^ ∧ r(lf((n + 1) + 1).last, csf0((n + 1) + 1)) ⊦
Used terms: n + 1
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r((as0 ' + x0).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, lf(n + 1).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n + 1, lf(n + 1).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^ ∧ r(lf((n + 1) + 1).last, csf0((n + 1) + 1)) ⊦ |
# al = # x0, # al0 + 1 = # f2_n_astate->astatelist(n + 1, (as0 ' + x0).last), as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # al = # x0, # al0 + 1 = # f2_n_astate->astatelist(n + 1, (as0 ' + x0).last), as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = as0 ' + x0, lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)) ≠ (as0 ' + x0).last, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, (as0 ' + x0).last)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r((as0 ' + x0).last, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^ ⊦ |
# al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, as0 ' + x0 ≠ [], hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: as0 ' + x0, as2, y
| # al = # x0, as0 ' + x0 = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = as0 ' + x0, as0 ' + x0 ≠ [], hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ |
# al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceA-IOstatestream] ⊦ a ' + x ≠ []; (s)
| # al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜f2_n_astate->actionlist(n, as1)⌝ ) ∧ # f2_n_astate->actionlist(n, as1) + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜f2_n_astate->actionlist(n, as1)⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦ |
# al = # x0, x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = x1 + as2 ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n + 1), f_n->action(n + 1), csf0((n + 1) + 1)) ∧ r(as2, csf0(n + 1)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜f2_n_astate->actionlist(n + 1, as2)⌝ ) ∧ # f2_n_astate->actionlist(n + 1, as2) + 1 = # f2_n_astate->astatelist(n + 1, as2) ∧ ⌜f2_n_astate->actionlist(n + 1, as2)⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^ ∧ r(f2_n_astate->astatelist(n + 1, as2).last, csf0((n + 1) + 1)) ∧ hd(f2_n_astate->astatelist(n + 1, as2)) = as2, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], as0 ∈ x1 ∨ as0 = as2, as2 = as0 ∨ as2 ∈ x0 ⊦
Used terms: n + 1, as2
| # al = # x0, x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = x1 + as2 ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n + 1), f_n->action(n + 1), csf0((n + 1) + 1)) ∧ r(as2, csf0(n + 1)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜f2_n_astate->actionlist(n + 1, as2)⌝ ) ∧ # f2_n_astate->actionlist(n + 1, as2) + 1 = # f2_n_astate->astatelist(n + 1, as2) ∧ ⌜f2_n_astate->actionlist(n + 1, as2)⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^ ∧ r(f2_n_astate->astatelist(n + 1, as2).last, csf0((n + 1) + 1)) ∧ hd(f2_n_astate->astatelist(n + 1, as2)) = as2, ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], as0 ∈ x1 ∨ as0 = as2, as2 = as0 ∨ as2 ∈ x0 ⊦ |
# al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csf0⌝ = # ⌜f_n->action⌝ + ⌜1⌝ , # al = # x0, x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = x1 + as2 ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. ⌜n⌝ < # ⌜f_n->action⌝ → cstepf0(⌜csf0⌝ [n], ⌜f_n->action⌝ [n], ⌜csf0⌝ [n +1]), as0 ∈ x1 ∨ as0 = as2, as2 = as0 ∨ as2 ∈ x0 ⊦
Used terms: cstartf0, cstepf0, ⌜csf0⌝ , ⌜f_n->action⌝
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csf0⌝ = # ⌜f_n->action⌝ + ⌜1⌝ , # al = # x0, x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), as0 ' + x0 = x1 + as2 ', ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, lf(0) = as ', lf(n + 1) = x1 + as2 ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(lf(2 + n).last, csf0(2 + n)), r(as, csf0(0)), r(as2, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. ⌜n⌝ < # ⌜f_n->action⌝ → cstepf0(⌜csf0⌝ [n], ⌜f_n->action⌝ [n], ⌜csf0⌝ [n +1]), as0 ∈ x1 ∨ as0 = as2, as2 = as0 ∨ as2 ∈ x0 ⊦ |
# al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)), as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (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⌝ + ∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| # al = # x0, as0 ' + x0 = x1 + as2 ', # al0 + 1 = # f2_n_astate->astatelist(n + 1, as2), x1 + as2 ' = f2_n_astate->astatelist(n, lf(n).last), ⌜al0⌝ ^ = ⌜f_n->action(n + 1) '⌝ ^, ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, lf(n + 1) = x1 + as2 ', lf(0) = as ', hd(f2_n_astate->astatelist(n + 1, as2)) ≠ as2, afrag(AIOAut(astartf0, astepf0))(⌜as0 '⌝ + ⌜x0⌝ , ⌜al⌝ ), afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n + 1, as2)⌝ , ⌜al0⌝ ), astartf0(as), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as2, csf0(n + 1)), r(as, csf0(0)), r(lf(2 + n).last, csf0(2 + n)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ cstepf0(csf0(n + 1), f_n->action(n + 1), csf0(2 + n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ α, sl. ¬ afrag(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ as0 ≠ sl[0] ∨ hd(f2_n_astate->astatelist(n + 1, (sl[0] ' + x0).last)) ≠ sl.last ∨ α ^ ≠ ⌜al⌝ ^, ∀ n0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)), as2 = as0 ∨ as2 ∈ x0, as0 ∈ x1 ∨ as0 = as2 ⊦ |
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic Used terms: n + 1
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∀ n. ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl = # al + 1 ↔ true); (ss)
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
Used terms: n, lf(n).last
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n)) → afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, lf(n).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n))
# al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(lf(n).last, csf0(n)) |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ r(lf(n).last, csf0(n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
Used simplifier rules: ⊦ ¬ stepf(sf(n), af(n), sf(n + 1)) → (cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜af⌝ ) ↔ false); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ r(lf(n).last, csf0(n)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
Used terms: n
| # al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
# al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1))
Used terms: al
| # al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] ⊦ afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(lf(n + 1).last, csf0(n + 1)) |
# al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ r(lf(n + 1).last, csf0(n + 1)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦
| # al + 1 = # f2_n_astate->astatelist(n, lf(n).last), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, lf(n).last)) = lf(n).last, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, lf(n).last)⌝ , ⌜al⌝ ), astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), r(f2_n_astate->astatelist(n, lf(n).last).last, csf0(n + 1)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ¬ r(lf(n + 1).last, csf0(n + 1)), ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ |
Used terms: n + 1
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∀ n. r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] |
lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n).last, csf0(n)) ∧ lf(n) ≠ []
| lf(0) = as ', astartf0(as), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, csf0(0)), ¬ atrace(AIOAut(astartf0, astepf0))(⌜f_n->action⌝ ^), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n).last, csf0(n)) ∧ lf(n) ≠ []
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n).last, csf0(n)) ∧ lf(n) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ lf, as, cstartf0, cstepf0, csf0, f_n->action, r, astartf0, astepf0, f2_n_astate->astatelist. lf(0) = as ' ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ) ∧ cstartf0(csf0(0)) ∧ r(as, csf0(0)) ∧ (∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0)) ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [] ⊦ r(lf(n0 +1).last, csf0(n0 +1)) ∧ lf(n0 +1) ≠ []
Used simplifier rules: nat freely generated by 0, +1;; ⊦ a '.last = a; (s) ⊦ a ' ≠ []; (s)
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ lf, as, cstartf0, cstepf0, csf0, f_n->action, r, astartf0, astepf0, f2_n_astate->astatelist. lf(0) = as ' ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ) ∧ cstartf0(csf0(0)) ∧ r(as, csf0(0)) ∧ (∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0)) ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [] ⊦ r(lf(n0 +1).last, csf0(n0 +1)) ∧ lf(n0 +1) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ lf0, as0, cstartf, cstepf, csf, f_n->action0, r0, astartf, astepf, f2_n_astate->astatelist0. lf0(0) = as0 ' ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜f_n->action0⌝ ) ∧ cstartf(csf(0)) ∧ r0(as0, csf(0)) ∧ (∀ n, as1. cstepf(csf(n), f_n->action0(n), csf(n + 1)) ∧ r0(as1, csf(n)) → (∃ al. afrag(AIOAut(astartf, astepf))(⌜f2_n_astate->astatelist0(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action0(n) '⌝ ^ ∧ r0(f2_n_astate->astatelist0(n, as1).last, csf(n + 1)) ∧ hd(f2_n_astate->astatelist0(n, as1)) = as1)) ∧ (∀ n. lf0(n + 1) = f2_n_astate->astatelist0(n, lf0(n).last)) → r0(lf0(n0).last, csf(n0)) ∧ lf0(n0) ≠ [] ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
Used simplifier rules: ⊦ m +1 = m + 1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl = # al + 1 ↔ true); (ss)
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ lf0, as0, cstartf, cstepf, csf, f_n->action0, r0, astartf, astepf, f2_n_astate->astatelist0. lf0(0) = as0 ' ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜f_n->action0⌝ ) ∧ cstartf(csf(0)) ∧ r0(as0, csf(0)) ∧ (∀ n, as1. cstepf(csf(n), f_n->action0(n), csf(n + 1)) ∧ r0(as1, csf(n)) → (∃ al. afrag(AIOAut(astartf, astepf))(⌜f2_n_astate->astatelist0(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action0(n) '⌝ ^ ∧ r0(f2_n_astate->astatelist0(n, as1).last, csf(n + 1)) ∧ hd(f2_n_astate->astatelist0(n, as1)) = as1)) ∧ (∀ n. lf0(n + 1) = f2_n_astate->astatelist0(n, lf0(n).last)) → r0(lf0(n0).last, csf(n0)) ∧ lf0(n0) ≠ [] ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), lf(0) = as ' ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ) ∧ cstartf0(csf0(0)) ∧ r(as, csf0(0)) ∧ (∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1)) ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
Used terms: lf, as, cstartf0, cstepf0, csf0, f_n->action, r, astartf0, astepf0, f2_n_astate->astatelist
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), lf(0) = as ' ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ) ∧ cstartf0(csf0(0)) ∧ r(as, csf0(0)) ∧ (∀ n, as1. cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1)) ∧ (∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [], ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ( cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [], ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), ( cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1)) → r(lf(n0).last, csf0(n0)) ∧ lf(n0) ≠ [], ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as1, csf0(n)), r(as, csf0(0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
lf(0) = as ', lf(n0) ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), r(lf(n0).last, csf0(n0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as1, csf0(n)), r(as, csf0(0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as, csf0(0)), r(as1, csf0(n)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
Used terms: n, as1
| lf(0) = as ', cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as, csf0(0)), r(as1, csf0(n)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)) ∧ r(as1, csf0(n)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n, as1) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^ ∧ r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)) ∧ hd(f2_n_astate->astatelist(n, as1)) = as1, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
# al + 1 = # f2_n_astate->astatelist(n, as1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, as1)) = as1, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as1, csf0(n)), r(as, csf0(0)), r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al0. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
| # al + 1 = # f2_n_astate->astatelist(n, as1), ⌜al⌝ ^ = ⌜f_n->action(n) '⌝ ^, hd(f2_n_astate->astatelist(n, as1)) = as1, lf(0) = as ', afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n), f_n->action(n), csf0(n + 1)), r(as1, csf0(n)), r(as, csf0(0)), r(f2_n_astate->astatelist(n, as1).last, csf0(n + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ ∃ al0. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n, as1)⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^, r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
Used terms: al
| lf(0) = as ', lf(n0) ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(as, csf0(0)), r(lf(n0).last, csf0(n0)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last), ∀ n0, as0. cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(as0, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
lf(0) = as ', lf(n0) ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(lf(n0).last, csf0(n0)), r(as, csf0(0)), cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(lf(n0).last, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, lf(n0).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, lf(n0).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, lf(n0).last).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, lf(n0).last)) = lf(n0).last), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
Used terms: n0, lf(n0).last
| lf(0) = as ', lf(n0) ≠ [], cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), r(lf(n0).last, csf0(n0)), r(as, csf0(0)), cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)) ∧ r(lf(n0).last, csf0(n0)) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, lf(n0).last)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, lf(n0).last) ∧ ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, lf(n0).last).last, csf0(n0 + 1)) ∧ hd(f2_n_astate->astatelist(n0, lf(n0).last)) = lf(n0).last), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
# al + 1 = # f2_n_astate->astatelist(n0, lf(n0).last), ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^, hd(f2_n_astate->astatelist(n0, lf(n0).last)) = lf(n0).last, lf(0) = as ', lf(n0) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, lf(n0).last)⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)), r(lf(n0).last, csf0(n0)), r(as, csf0(0)), r(f2_n_astate->astatelist(n0, lf(n0).last).last, csf0(n0 + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ []
Used simplifier rules: ⊦ ¬ stepf(sf(n), af(n), sf(n + 1)) → (cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜af⌝ ) ↔ false); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| # al + 1 = # f2_n_astate->astatelist(n0, lf(n0).last), ⌜al⌝ ^ = ⌜f_n->action(n0) '⌝ ^, hd(f2_n_astate->astatelist(n0, lf(n0).last)) = lf(n0).last, lf(0) = as ', lf(n0) ≠ [], afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, lf(n0).last)⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(⌜csf0⌝ , ⌜f_n->action⌝ ), cstartf0(csf0(0)), cstepf0(csf0(n0), f_n->action(n0), csf0(n0 + 1)), r(lf(n0).last, csf0(n0)), r(as, csf0(0)), r(f2_n_astate->astatelist(n0, lf(n0).last).last, csf0(n0 + 1)), ∀ n. lf(n + 1) = f2_n_astate->astatelist(n, lf(n).last) ⊦ r(lf(n0 + 1).last, csf0(n0 + 1)) ∧ lf(n0 + 1) ≠ [] |
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as) |
⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as)
Used terms: r, astepf0, astartf0, cstepf0, cstartf0
| ⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0))) |
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as) |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as)
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ n0, as0. cstepf0(cσ[n0], α0[n0], cσ[n0 + 1]) ∧ r(as0, cσ[n0]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜f2_n_astate->astatelist(n0, as0)⌝ , ⌜al⌝ ) ∧ # al + 1 = # f2_n_astate->astatelist(n0, as0) ∧ ⌜al⌝ ^ = ⌜α0[n0] '⌝ ^ ∧ r(f2_n_astate->astatelist(n0, as0).last, cσ[n0 + 1]) ∧ hd(f2_n_astate->astatelist(n0, as0)) = as0) ⊦ ∃ as. r(as, cσ[0]) ∧ astartf0(as) |
Used terms: cσ[0]
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ ∀ n, as. ∃ asl. cstepf0(cσ[n], α0[n], cσ[n + 1]) ∧ r(as, cσ[n]) → (∃ al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ # al + 1 = # asl ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as) |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl = # al + 1 ↔ true); (ss)
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
Used terms: r, astepf0, astartf0, cstepf0, cstartf0
| ⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0))) |
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs, a, cs0, as. r(as, cs) ∧ cstepf0(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), r(as, cσ[n]) ∧ cstepf0(cσ[n], α0[n], cσ[n + 1]) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜α0[n] '⌝ ^, as0) ∧ r(as0, cσ[n + 1])), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
Used terms: cσ[n], α0[n], cσ[n + 1], as
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), r(as, cσ[n]) ∧ cstepf0(cσ[n], α0[n], cσ[n + 1]) → (∃ as0. amove(AIOAut(astartf0, astepf0))(as, ⌜α0[n] '⌝ ^, as0) ∧ r(as0, cσ[n + 1])), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
amove(AIOAut(astartf0, astepf0))(as, ⌜α0[n] '⌝ ^, as0), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), r(as0, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
| amove(AIOAut(astartf0, astepf0))(as, ⌜α0[n] '⌝ ^, as0), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as, cσ[n]), r(as0, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as0, cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∃ α, sl. afrag*(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∧ as = sl[0] ∧ as0 = sl.last ∧ α ^ = ⌜α0[n] '⌝ ^ ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as
Used terms: as0, ⌜α0[n] '⌝ ^, as, astepf0, astartf0
| ⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(as0, cσ[n + 1]), r(as, cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)), ∃ α, sl. afrag*(AIOAut(astartf0, astepf0))(⌜sl⌝ , α) ∧ as = sl[0] ∧ as0 = sl.last ∧ α ^ = ⌜α0[n] '⌝ ^ ⊦ ∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜α0[n] '⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = as |
⌜al⌝ ^ = ⌜α0[n] '⌝ ^, afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl[0], cσ[n]), r(asl.last, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl0, al0. afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ ∧ r(asl0.last, cσ[n + 1]) ∧ hd(asl0) = asl[0]
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al⌝ ^ = ⌜α0[n] '⌝ ^, afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl[0], cσ[n]), r(asl.last, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ ∃ asl0, al0. afrag(AIOAut(astartf0, astepf0))(⌜asl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ ∧ r(asl0.last, cσ[n + 1]) ∧ hd(asl0) = asl[0] |
⌜al⌝ ^ = ⌜α0[n] '⌝ ^, afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl.last, cσ[n + 1]), r(asl[0], cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜al⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = asl[0]
Used terms: asl, al
| ⌜al⌝ ^ = ⌜α0[n] '⌝ ^, afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl.last, cσ[n + 1]), r(asl[0], cσ[n]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜al⌝ ^ ∧ r(asl.last, cσ[n + 1]) ∧ hd(asl) = asl[0] |
⌜al⌝ ^ = ⌜α0[n] '⌝ ^, hd(asl) ≠ asl[0], afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl[0], cσ[n]), r(asl.last, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦
| ⌜al⌝ ^ = ⌜α0[n] '⌝ ^, hd(asl) ≠ asl[0], afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ), cfrag(CIOAut(cstartf0, cstepf0))(cσ, α0), cstartf0(cσ[0]), cstepf0(cσ[n], α0[n], cσ[n + 1]), r(asl[0], cσ[n]), r(asl.last, cσ[n + 1]), ¬ atrace(AIOAut(astartf0, astepf0))(α0 ^), ∀ cs. cstartf0(cs) → (∃ as. r(as, cs) ∧ astartf0(as)) ⊦ |
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: asl, head, tail
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.