| ⊦ C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) |
¬ ( C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf))) ⊦
| ¬ ( C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf))) ⊦ |
⊦ (∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α))) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α))
Used simplifier rules: equivstar-def: ⊦ C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) ↔ atrace*(AIOAut(astartf, astepf))(α)); leqstar-def: ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)); leqstar-def-rev: ⊦ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atrace*(AIOAut(astartf, astepf))(α) → ctrace*(CIOAut(cstartf, cstepf))(α)); ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s)
| ⊦ (∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α))) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α)) |
∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α))
∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦ ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α))
| ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α)) |
∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ (ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (atrace(AIOAut(astartf, astepf))(α0) ∧ finp(α0) → ctrace(CIOAut(cstartf, cstepf))(α0))
| ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ (ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α)) ∧ (atrace(AIOAut(astartf, astepf))(α0) ∧ finp(α0) → ctrace(CIOAut(cstartf, cstepf))(α0)) |
ctrace(CIOAut(cstartf, cstepf))(α), finp(α), ¬ atrace(AIOAut(astartf, astepf))(α), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦
atrace(AIOAut(astartf, astepf))(α0), finp(α0), ¬ ctrace(CIOAut(cstartf, cstepf))(α0), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦
| ctrace(CIOAut(cstartf, cstepf))(α), finp(α), ¬ atrace(AIOAut(astartf, astepf))(α), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ |
ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| atrace(AIOAut(astartf, astepf))(α0), finp(α0), ¬ ctrace(CIOAut(cstartf, cstepf))(α0), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ |
atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) ⊦ |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦ ∀ α. finp(α) → (ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) |
¬(ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ) ↔ atrace(AIOAut(astartf, astepf))(⌜al⌝ )), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ¬(ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ) ↔ atrace(AIOAut(astartf, astepf))(⌜al⌝ )), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ |
ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦
atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦
| ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦ |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ∧ finp(α) → atrace(AIOAut(astartf, astepf))(α), ∀ α. atrace(AIOAut(astartf, astepf))(α) ∧ finp(α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦ |
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.