| ≤wB(cioaut, aioaut) ⊦ ≤BI(cioaut, aioaut) |
≤wB(cioaut, aioaut), ¬ ≤BI(cioaut, aioaut) ⊦
| ≤wB(cioaut, aioaut), ¬ ≤BI(cioaut, aioaut) ⊦ |
cioaut = CIOAut(cINV0, cstepf0), ≤wB(cioaut, aioaut), ¬ ≤BI(cioaut, aioaut) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cINV0, cstepf0), ≤wB(cioaut, aioaut), ¬ ≤BI(cioaut, aioaut) ⊦ |
≤wB(CIOAut(cINV0, cstepf0), aioaut), ¬ ≤BI(CIOAut(cINV0, cstepf0), aioaut) ⊦
| ≤wB(CIOAut(cINV0, cstepf0), aioaut), ¬ ≤BI(CIOAut(cINV0, cstepf0), aioaut) ⊦ |
aioaut = AIOAut(astartf0, astepf0), ≤wB(CIOAut(cINV0, cstepf0), aioaut), ¬ ≤BI(CIOAut(cINV0, cstepf0), aioaut) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), ≤wB(CIOAut(cINV0, cstepf0), aioaut), ¬ ≤BI(CIOAut(cINV0, cstepf0), aioaut) ⊦ |
≤wB(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)) ⊦
| ≤wB(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)), ¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)) ⊦ |
⊦ ≤wB(cioaut, aioaut) ↔ (∃ t, aINV. weakbwsim(cioaut, aioaut, t, aINV))
¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)), ∃ t, aINV. weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV) ⊦
Used terms: AIOAut(astartf0, astepf0), CIOAut(cINV0, cstepf0)
| ⊦ ≤wB(cioaut, aioaut) ↔ (∃ t, aINV. weakbwsim(cioaut, aioaut, t, aINV)) |
| ¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)), ∃ t, aINV. weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV) ⊦ |
weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)) ⊦
| weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ¬ ≤BI(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0)) ⊦ |
⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV))
weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV) ⊦
Used terms: AIOAut(astartf0, astepf0), CIOAut(cINV0, cstepf0)
| ⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV)) |
| weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV) ⊦ |
weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, λ cs. ∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ asl.last = as))
weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, λ cs. ∃ csl, al. cexec(CIOAut(cINV0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. aexec(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ asl.last = as)) ⊦
Used terms: cINV0, cstepf0, astartf0, astepf0, t, aINV
| weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, λ cs. ∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ asl.last = as)) |
| weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, λ cs. ∃ csl, al. cexec(CIOAut(cINV0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. aexec(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ asl.last = as)) ⊦ |
weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, λ cs. ∃ csl, al. cfrag(CIOAut(cINV0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∧ cINV0(csl[0]) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf0(asl[0]) ∧ asl.last = as)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| weakbwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, aINV), ∀ t, aINV, cINV. ¬ bwsim(CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, cINV, aINV), bwsim (CIOAut(cINV0, cstepf0), AIOAut(astartf0, astepf0), t, λ cs. ∃ csl, al. cfrag(CIOAut(cINV0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∧ cINV0(csl[0]) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf0(asl[0]) ∧ asl.last = as)) ⊦ |
Used terms: t, λ as. aINV(as) ∧ (∃ asl, al. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf0(asl[0]) ∧ asl.last = as), λ cs. ∃ csl, al. cfrag(CIOAut(cINV0, cstepf0))(⌜csl⌝ , ⌜al⌝ ) ∧ cINV0(csl[0]) ∧ csl.last = 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.