| C_≤*T_A(cioaut, aioaut) ⊦ ≤BI(hist(cioaut), aioaut) |
C_≤*T_A(cioaut, aioaut), ¬ ≤BI(hist(cioaut), aioaut) ⊦
| C_≤*T_A(cioaut, aioaut), ¬ ≤BI(hist(cioaut), aioaut) ⊦ |
cioaut = CIOAut(cstartf0, cstepf0), C_≤*T_A(cioaut, aioaut), ¬ ≤BI(hist(cioaut), aioaut) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cstartf0, cstepf0), C_≤*T_A(cioaut, aioaut), ¬ ≤BI(hist(cioaut), aioaut) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), aioaut) ⊦
| C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), aioaut) ⊦ |
aioaut = AIOAut(astartf0, astepf0), C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), aioaut) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), aioaut) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)) ⊦
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)) ⊦ |
C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ bwsim (hist(CIOAut(cstartf, cstepf)), AIOAut(astartf, astepf), λ αcs, as. ∃ aσ, α. aexec*(AIOAut(astartf, astepf))(aσ, α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(as)), λ αcs. ∃ cσ, α. cexec*(CIOAut(cstartf, cstepf))(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true)
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. aexec*(AIOAut(astartf0, astepf0))(aσ, α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(as)), λ αcs. ∃ cσ, α. cexec*(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦
Used terms: cstartf0, cstepf0, astartf0, astepf0
| C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ bwsim (hist(CIOAut(cstartf, cstepf)), AIOAut(astartf, astepf), λ αcs, as. ∃ aσ, α. aexec*(AIOAut(astartf, astepf))(aσ, α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf(as)), λ αcs. ∃ cσ, α. cexec*(CIOAut(cstartf, cstepf))(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) |
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. aexec*(AIOAut(astartf0, astepf0))(aσ, α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(as)), λ αcs. ∃ cσ, α. cexec*(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. afrag(AIOAut(astartf0, astepf0))(aσ, α) ∧ astartf0(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(aσ.l.last)), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦
Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ cexec*(CIOAut(startf, stepf))(σ, β) ↔ cexec(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ aexec*(AIOAut(startf, stepf))(σ, β) ↔ aexec(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0)), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. afrag(AIOAut(astartf0, astepf0))(aσ, α) ∧ astartf0(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(aσ.l.last)), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦ |
⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV))
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ∀ t, aINV, cINV. ¬ bwsim(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. afrag(AIOAut(astartf0, astepf0))(aσ, α) ∧ astartf0(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(aσ.l.last)), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦
Used terms: AIOAut(astartf0, astepf0), hist(CIOAut(cstartf0, cstepf0))
| ⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV)) |
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), ∀ t, aINV, cINV. ¬ bwsim(hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (hist(CIOAut(cstartf0, cstepf0)), AIOAut(astartf0, astepf0), λ αcs, as. ∃ aσ, α. afrag(AIOAut(astartf0, astepf0))(aσ, α) ∧ astartf0(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(aσ.l.last)), λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^, λ as. true) ⊦ |
Used terms: λ αcs, as. ∃ aσ, α. afrag(AIOAut(astartf0, astepf0))(aσ, α) ∧ astartf0(aσ[0]) ∧ finp(α) ∧ aσ.l.last = as ∧ α ^ = cactstream(αcs) ∧ (cactstream(αcs) = [] → astartf0(aσ.l.last)), λ as. true, λ αcs. ∃ cσ, α. cfrag(CIOAut(cstartf0, cstepf0))(cσ, α) ∧ cstartf0(cσ[0]) ∧ finp(α) ∧ cσ.l.last = cendstate(αcs) ∧ cactstream(αcs) = α ^
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.