| ⊦ A_≤*T_C(aioaut, cioaut) ↔ abeh(aioaut) ≤*T cbeh(cioaut) |
¬(A_≤*T_C(aioaut, cioaut) ↔ abeh(aioaut) ≤*T cbeh(cioaut)) ⊦
| ¬(A_≤*T_C(aioaut, cioaut) ↔ abeh(aioaut) ≤*T cbeh(cioaut)) ⊦ |
aioaut = AIOAut(astartf0, astepf0), ¬(A_≤*T_C(aioaut, cioaut) ↔ abeh(aioaut) ≤*T cbeh(cioaut)) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), ¬(A_≤*T_C(aioaut, cioaut) ↔ abeh(aioaut) ≤*T cbeh(cioaut)) ⊦ |
¬(A_≤*T_C(AIOAut(astartf0, astepf0), cioaut) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(cioaut)) ⊦
| ¬(A_≤*T_C(AIOAut(astartf0, astepf0), cioaut) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(cioaut)) ⊦ |
cioaut = CIOAut(cstartf0, cstepf0), ¬(A_≤*T_C(AIOAut(astartf0, astepf0), cioaut) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(cioaut)) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cstartf0, cstepf0), ¬(A_≤*T_C(AIOAut(astartf0, astepf0), cioaut) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(cioaut)) ⊦ |
¬(A_≤*T_C(AIOAut(astartf0, astepf0), CIOAut(cstartf0, cstepf0)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0))) ⊦
| ¬(A_≤*T_C(AIOAut(astartf0, astepf0), CIOAut(cstartf0, cstepf0)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0))) ⊦ |
⊦ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atrace*(AIOAut(astartf, astepf))(α) → ctrace*(CIOAut(cstartf, cstepf))(α))
⊦ (∀ α. atrace*(AIOAut(astartf0, astepf0))(α) → ctrace*(CIOAut(cstartf0, cstepf0))(α)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0))
Used terms: cstepf0, cstartf0, astepf0, astartf0
| ⊦ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atrace*(AIOAut(astartf, astepf))(α) → ctrace*(CIOAut(cstartf, cstepf))(α)) |
| ⊦ (∀ α. atrace*(AIOAut(astartf0, astepf0))(α) → ctrace*(CIOAut(cstartf0, cstepf0))(α)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0)) |
⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0))
Used simplifier rules: ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s)
| ⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ abeh(AIOAut(astartf0, astepf0)) ≤*T cbeh(CIOAut(cstartf0, cstepf0)) |
⊦ tP ≤*T tQ ↔ (∀ α. finp(α) ∧ tP(α) → tQ(α))
⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ (∀ α. finp(α) ∧ abeh(AIOAut(astartf0, astepf0))(α) → cbeh(CIOAut(cstartf0, cstepf0))(α))
Used terms: cbeh(CIOAut(cstartf0, cstepf0)), abeh(AIOAut(astartf0, astepf0))
| ⊦ tP ≤*T tQ ↔ (∀ α. finp(α) ∧ tP(α) → tQ(α)) |
| ⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ (∀ α. finp(α) ∧ abeh(AIOAut(astartf0, astepf0))(α) → cbeh(CIOAut(cstartf0, cstepf0))(α)) |
⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ (∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α))
Used simplifier rules: ⊦ cbeh(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α); (s) ⊦ abeh(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α); (s)
| ⊦ (∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) ↔ (∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)) |
∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ ∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)
∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ ∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α)
| ∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ ∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) |
atrace(AIOAut(astartf0, astepf0))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ), ∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| atrace(AIOAut(astartf0, astepf0))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ), ∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| ∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ ∀ α. atrace(AIOAut(astartf0, astepf0))(α) ∧ finp(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) |
atrace(AIOAut(astartf0, astepf0))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ), ∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| atrace(AIOAut(astartf0, astepf0))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf0, cstepf0))(⌜al⌝ ), ∀ α. finp(α) ∧ atrace(AIOAut(astartf0, astepf0))(α) → ctrace(CIOAut(cstartf0, cstepf0))(α) ⊦ |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
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.