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