| cforest(cioaut), C_≤*T_A(cioaut, aioaut) ⊦ ≤B(cioaut, aioaut) |
C_≤*T_A(cioaut, aioaut), cforest(cioaut), ¬ ≤B(cioaut, aioaut) ⊦
| C_≤*T_A(cioaut, aioaut), cforest(cioaut), ¬ ≤B(cioaut, aioaut) ⊦ |
cioaut = CIOAut(cstartf0, cstepf0), C_≤*T_A(cioaut, aioaut), cforest(cioaut), ¬ ≤B(cioaut, aioaut) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cstartf0, cstepf0), C_≤*T_A(cioaut, aioaut), cforest(cioaut), ¬ ≤B(cioaut, aioaut) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), aioaut) ⊦
| C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
aioaut = AIOAut(astartf0, astepf0), C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), aioaut) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), C_≤*T_A(CIOAut(cstartf0, cstepf0), aioaut), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦ |
cforest(CIOAut(cstartf, cstepf)), C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ))
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦
Used terms: cstartf0, cstepf0, astartf0, astepf0
| cforest(CIOAut(cstartf, cstepf)), C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) |
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. aexec(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ cexec(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦ |
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf0(asl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf0(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ¬ ≤B(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf0(asl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf0(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦ |
⊦ ≤B(cioaut, aioaut) ↔ (∃ t. bwsim(cioaut, aioaut, t))
C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ∀ t. ¬ bwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), t), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf0(asl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf0(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦
Used terms: AIOAut(astartf0, astepf0), CIOAut(cstartf0, cstepf0)
| ⊦ ≤B(cioaut, aioaut) ↔ (∃ t. bwsim(cioaut, aioaut, t)) |
| C_≤*T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), cforest(CIOAut(cstartf0, cstepf0)), ∀ t. ¬ bwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), t), bwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf0(asl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf0(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)) ⊦ |
Used terms: λ cs, as. ∃ asl, csl, al1, al2. afrag(AIOAut(astartf0, astepf0))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf0(asl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf0(csl[0]) ∧ asl.last = as ∧ csl.last = cs ∧ ⌜al1⌝ ^ = ⌜al2⌝ ^ ∧ (al1 ≠ [] → al1.last ≠ τ)
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.