| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(CIOAut(cstartf, cstepf)) ⊦ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(CIOAut(cstartf, cstepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(CIOAut(cstartf, cstepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ |
⊦ cstepdet(CIOAut(startf, stepf)) ↔ (∀ s, a0, a1, s0, s1. stepf(s, a0, s0) ∧ stepf(s, a1, s1) → a0 = a1 ∧ s0 = s1)
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦
Used terms: cstepf, cstartf
| ⊦ cstepdet(CIOAut(startf, stepf)) ↔ (∀ s, a0, a1, s0, s1. stepf(s, a0, s0) ∧ stepf(s, a1, s1) → a0 = a1 ∧ s0 = s1) |
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦ |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ aexec(AIOAut(astartf, astepf))(aσ, α1) ∧ cexec(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^)))
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦ ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ aexec(AIOAut(astartf, astepf))(aσ, α1) ∧ cexec(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦
Used terms: cstartf, cstepf, astartf, astepf
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ aexec(AIOAut(astartf, astepf))(aσ, α1) ∧ cexec(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) |
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦ ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepf(cs, a0, cs0), cstepf(cs, a1, cs1), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦ a0 = a1 ∧ cs0 = cs1
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepf(cs, a0, cs0), cstepf(cs, a1, cs1), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1 ⊦ a0 = a1 ∧ cs0 = cs1 |
Used terms: cs, a0, a1, cs0, cs1
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ aexec(AIOAut(astartf, astepf))(aσ, α1) ∧ cexec(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦ |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦
Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦ |
⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r))
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, ∀ r. ¬ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦
Used terms: AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)
| ⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r)) |
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ s, a0, a1, s0, s1. cstepf(s, a0, s0) ∧ cstepf(s, a1, s1) → a0 = a1 ∧ s0 = s1, ∀ r. ¬ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r), fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) ⊦ |
Used terms: λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))
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.