| ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cσ[0] = cσ0[0], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]
Used formulas: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
Used formulas: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ0, ⌜n0⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. m < n0 → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ0, ⌜n0⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. m < n0 → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], n0 = n1 +1, cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: nat freely generated by 0, +1;;
| cσ[0] = cσ0[0], n0 = n1 +1, cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ + ⌜1⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used terms: α0, cσ0, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ + ⌜1⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: ⊦ m +1 = m + 1; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s)
| # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α0 → cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used terms: n1
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α0 → cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: ⊦ m +1 = m + 1; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s)
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used terms: n1
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ[n1], α[n1], cσ[n1 + 1]), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ n1 < n1 → cσ[n1] = cσ0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used terms: n1
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ[n1], α[n1], cσ[n1 + 1]), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ n1 < n1 → cσ[n1] = cσ0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n1] = cσ0[n1], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ0[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: ⊦ ¬ n < n; (s)
| # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n1] = cσ0[n1], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ0[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
Used terms: cσ0[n1], α[n1], α0[n1], cσ[n1 + 1], cσ0[n1 + 1]
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
Used simplifier rules: <; (wellfounded) Used terms: n
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
Used terms: n
| cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, n0 < n, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
Used simplifier rules: lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → ¬ n < m; (s) Used terms: n0, cσ, cσ0, cstartf, cstepf, α, α0
| cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, n0 < n, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], cσ[n1] ≠ cσ0[n1], ⌜n1⌝ < # cσ, ⌜n1⌝ < # cσ0, n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n1 → cσ[m] = cσ0[m], ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])
| cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], cσ[n1] ≠ cσ0[n1], ⌜n1⌝ < # cσ, ⌜n1⌝ < # cσ0, n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n1 → cσ[m] = cσ0[m], ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) |
Used terms: n1
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used formulas: ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n]
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] |
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), ¬ finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used formulas: finp(cσ0)
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream]
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
cσ[0] = csl[0], α0 = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| cσ[0] = csl[0], α0 = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ ⌜al0⌝ + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ ⌜al0⌝ + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜csl⌝ + (cσ from # csl) = cσ ∧ ⌜al0⌝ + (α from # al0) = α
Used terms: cσ from # csl, α from # al0
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜csl⌝ + (cσ from # csl) = cσ ∧ ⌜al0⌝ + (α from # al0) = α |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (#(⌜csl⌝ + (cσ from # csl)) = # cσ ∧ (∀ n. ⌜n⌝ < #(⌜csl⌝ + (cσ from # csl)) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n])) ∧ ⌜al0⌝ + (α from # al0) = α
Used terms: cσ, ⌜csl⌝ + (cσ from # csl)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (#(⌜csl⌝ + (cσ from # csl)) = # cσ ∧ (∀ n. ⌜n⌝ < #(⌜csl⌝ + (cσ from # csl)) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n])) ∧ ⌜al0⌝ + (α from # al0) = α |
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜al0⌝ + (α from # al0) = α
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜al0⌝ + (α from # al0) = α |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ #(⌜al0⌝ + (α from # al0)) = # α ∧ (∀ n. ⌜n⌝ < #(⌜al0⌝ + (α from # al0)) → (⌜al0⌝ + (α from # al0))[n] = α[n])
Used terms: α, ⌜al0⌝ + (α from # al0)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ #(⌜al0⌝ + (α from # al0)) = # α ∧ (∀ n. ⌜n⌝ < #(⌜al0⌝ + (α from # al0)) → (⌜al0⌝ + (α from # al0))[n] = α[n]) |
cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used formulas: ⌜# csl⌝ + #(cσ from # csl) = # cσ
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used formulas: ⌜# al0⌝ + #(α from # al0) = # α
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜n⌝ < # ⌜csl⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → ⌜csl⌝ [n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used terms: n, cσ from # csl, ⌜csl⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - (# ⌜csl⌝ ).n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: n, cσ from # csl, ⌜csl⌝
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - (# ⌜csl⌝ ).n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - # csl] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - # csl] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], n = n1 + # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n1] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n, # csl, n1
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], n = n1 + # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n1] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m ≤ m + n; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used terms: n0, α from # al0, ⌜al0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
Used simplifier rules: ⊦ m ≤ m + n; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # al0, n1
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
Used terms: n0
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜n⌝ < # ⌜csl⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → ⌜csl⌝ [n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = hd(csl), csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = hd(csl), csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = cs2, csl = cs2 + csl0, csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y
| ⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = cs2, csl = cs2 + csl0, csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1], (⌜n⌝ < # cσ → (cσ[0] ' + csl0)[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])
Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1], (⌜n⌝ < # cσ → (cσ[0] ' + csl0)[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
| (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
| ⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: n
| (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
| ⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
Used terms: n0, α from # al0, ⌜al0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)
| ⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
Used simplifier rules: ⊦ m ≤ m + n; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # al0, n2
| (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1] |
Used terms: n0
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csf0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s)
| # csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s)
| # csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s)
| # csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
¬ # x < n ⊦ #(x from n) = # x - n
# csl + (# csl0 - # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), ¬ # csl0 < # csl, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: # csl, csl0
| ¬ # x < n ⊦ #(x from n) = # x - n |
| # csl + (# csl0 - # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), ¬ # csl0 < # csl, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used terms: ⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csl0⌝ = # ⌜al1⌝ + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al1⌝ → cstepf(⌜csl0⌝ [n], ⌜al1⌝ [n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used terms: ⌜al1⌝ , ⌜csl0⌝ , cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csl0⌝ = # ⌜al1⌝ + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al1⌝ → cstepf(⌜csl0⌝ [n], ⌜al1⌝ [n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
Used simplifier rules: ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m = n + 1 → ¬ m ≤ n; (s) n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csf0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
csf0(0) = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csf0(n) = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. n < # csl ∧ csf0(n) ≠ csl[n]
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s)
| csf0(0) = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csf0(n) = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. n < # csl ∧ csf0(n) ≠ csl[n] |
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0]) |
cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
| cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]
Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s)
| cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n] |
csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s)
| csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used terms: ⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜csl0⌝ = # α + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(⌜csl0⌝ [n], α[n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used terms: α, ⌜csl0⌝ , cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜csl0⌝ = # α + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(⌜csl0⌝ [n], α[n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, csl0[0] = csl[0], ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 + 1 = # csl, csl0[0] = csl[0], ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
# al0 + 1 = # csl, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]), ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s)
| # al0 + 1 = # csl, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]), ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s)
| # al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
¬ # x < n ⊦ #(x from n) = # x - n
# al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, # csl0 < # csl, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: # csl, csl0
| ¬ # x < n ⊦ #(x from n) = # x - n |
| # al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, # csl0 < # csl, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = hd(csl), # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| # al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = hd(csl), # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0) |
# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = cs2, csl = cs2 + csl1, # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y
| # al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = cs2, csl = cs2 + csl1, # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n] |
# al0 = # csl1, # al1 + 1 = # csl0, (# csl1 + 1) + #(csl0 from # csl1 + 1) ≠ # csl0, # csl0 ≤ # csl1, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # csl1 → n < # al1 ∧ csl0[n] = (csl0[0] ' + csl1)[n] ∧ al1[n] = al0[n], ∀ n. n < # csl1 → cstepf((csl0[0] ' + csl1)[n], al0[n], csl1[n]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ ¬ # csl1 < n ∧ csl0[n] ≠ (csl0[0] ' + csl1)[n]
Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)
| # al0 = # csl1, # al1 + 1 = # csl0, (# csl1 + 1) + #(csl0 from # csl1 + 1) ≠ # csl0, # csl0 ≤ # csl1, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # csl1 → n < # al1 ∧ csl0[n] = (csl0[0] ' + csl1)[n] ∧ al1[n] = al0[n], ∀ n. n < # csl1 → cstepf((csl0[0] ' + csl1)[n], al0[n], csl1[n]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ ¬ # csl1 < n ∧ csl0[n] ≠ (csl0[0] ' + csl1)[n] |
Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al1
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), ¬ finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)
| cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α) |
cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)
cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ¬ finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)
Used formulas: finp(cσ)
| cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α) |
csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream]
| csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0) |
csl[0] = csf(0), α = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| csl[0] = csf(0), α = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n) |
csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0) |
csl[0] = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| csl[0] = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n) |
csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = af0(n) ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = af0(n) ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0) |
Used simplifier rules: ⊦ ¬ n < n; (s) Used terms: # al0
| cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ¬ finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α) |
csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n), csf = csf0 ∧ (∃ α1. α0 + α1 = α)
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)
| csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n), csf = csf0 ∧ (∃ α1. α0 + α1 = α) |
csf0(0) = csf(0), csf ≠ csf0, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)
csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n), ∃ α1. α0 + α1 = α
| csf0(0) = csf(0), csf ≠ csf0, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n) |
csf0(0) = csf(0), csf(n) ≠ csf0(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n)
| csf0(0) = csf(0), csf(n) ≠ csf0(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n) |
Used terms: n
| csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n), ∃ α1. α0 + α1 = α |
csf0(0) = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ α1. α0 + α1 = α, ∃ n. csf0(n) ≠ csf(n)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| csf0(0) = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ α1. α0 + α1 = α, ∃ n. csf0(n) ≠ csf(n) |
csf0(0) = csf(0), ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n)
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| csf0(0) = csf(0), ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n) |
csf0(0) = csf(0), α = ⌜af1⌝ , ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| csf0(0) = csf(0), α = ⌜af1⌝ , ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n) |
csf0(0) = csf(0), af0 ≠ af1, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n)
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s)
| csf0(0) = csf(0), af0 ≠ af1, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n) |
csf0(0) = csf(0), af0(n) ≠ af1(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)
| csf0(0) = csf(0), af0(n) ≠ af1(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n) |
Used terms: n
| cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
cσ[0] = cσ0[0], ⌜n⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n]
| cσ[0] = cσ0[0], ⌜n⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] |
cσ[0] = cσ0[0], ⌜0⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜0⌝ < # α ∧ cσ[0] = cσ0[0] ∧ α[0] = α0[0]
cσ[0] = cσ0[0], ⌜n0 +1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0 +1⌝ < # α ∧ cσ[n0 +1] = cσ0[n0 +1] ∧ α[n0 +1] = α0[n0 +1]
Used simplifier rules: nat freely generated by 0, +1;;
| cσ[0] = cσ0[0], ⌜0⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜0⌝ < # α ∧ cσ[0] = cσ0[0] ∧ α[0] = α0[0] |
cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]
Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
Used terms: α0, cσ0, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α0 → cstepf(cσ0[0], α0[0], cσ0[0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
Used terms: 0
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α0 → cstepf(cσ0[0], α0[0], cσ0[0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α → cstepf(cσ[0], α[0], cσ[0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
Used terms: 0
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α → cstepf(cσ[0], α[0], cσ[0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α = [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]
Used formulas: α ≠ []
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α[0], cσ[1]), cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
Used formulas: α0 ≠ []
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α[0], cσ[1]), cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] |
Used terms: cσ0[0], α[0], α0[0], cσ[1], cσ0[1]
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α = [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0] |
# csl = 1, # cσ0 = # α0 + ⌜1⌝ , csl[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = [], ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # [] = ⌜0⌝ ; (s)
| # csl = 1, # cσ0 = # α0 + ⌜1⌝ , csl[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = [], ∃ a, cs0. cstepf(csl.last, a, cs0) |
# cσ0 = # α0 + ⌜1⌝ , # csl = 1, csl[0] = cσ0[0], csl = cs0 + csl0, α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = []
Used simplifier rules: cstatelist freely generated by [], +;; ⊦ # [] = 0; (s)
| # cσ0 = # α0 + ⌜1⌝ , # csl = 1, csl[0] = cσ0[0], csl = cs0 + csl0, α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = [] |
# cσ0 = # α0 + ⌜1⌝ , α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs. cstepf(cσ0[0], a, cs), ∃ cσ1, α1. cσ0 + cσ1 = ⌜cσ0[0] '⌝ ∧ α0 + α1 = []
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ σ + [] = σ; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ x + [] = x; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ (a ' + x)[0] = a; (s)
| # cσ0 = # α0 + ⌜1⌝ , α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs. cstepf(cσ0[0], a, cs), ∃ cσ1, α1. cσ0 + cσ1 = ⌜cσ0[0] '⌝ ∧ α0 + α1 = [] |
Used terms: α0[0], cσ0[1]
| cσ[0] = cσ0[0], ⌜n0 +1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0 +1⌝ < # α ∧ cσ[n0 +1] = cσ0[n0 +1] ∧ α[n0 +1] = α0[n0 +1] |
cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: ⊦ m +1 = m + 1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: cσ, cσ0, α0, cstartf, cstepf, α
| cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: α0, cσ0, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: n0
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: n0
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]) ∧ cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) → α0[n0] = α0[n0] ∧ cσ[n0 + 1] = cσ0[n0 + 1], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: cσ0[n0], α0[n0], α0[n0], cσ[n0 + 1], cσ0[n0 + 1]
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]) ∧ cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) → α0[n0] = α0[n0] ∧ cσ[n0 + 1] = cσ0[n0 + 1], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α0 → cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[(n0 + 1) + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: n0 + 1
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α0 → cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[(n0 + 1) + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α → cstepf(cσ[n0 + 1], α[n0 + 1], cσ[(n0 + 1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
Used terms: n0 + 1
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α → cstepf(cσ[n0 + 1], α[n0 + 1], cσ[(n0 + 1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ¬ ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]
Used formulas: ⌜n0⌝ + ⌜1⌝ < # α
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], α[n0 + 1] ≠ α0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α
| # cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], α[n0 + 1] ≠ α0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α |
Used terms: cσ0[n0 + 1], α[n0 + 1], α0[n0 + 1], cσ[2 + n0], cσ0[2 + n0]
| # cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ¬ ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1] |
# cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], ⌜# csl⌝ = # α + ⌜1⌝ , ⌜n0⌝ < # α0, # α < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α, ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞ = ⌜m⌝ + ⌜n⌝ → (n∞ = ∞ ↔ false); (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ¬ n < n; (s) ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss)
| # cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], ⌜# csl⌝ = # α + ⌜1⌝ , ⌜n0⌝ < # α0, # α < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α, ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(csl.last, a, cs0) |
# cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[0] = cσ0[0], csl[n0] = cσ0[n0], α[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], α = ⌜al0⌝ , ⌜# csl⌝ = # α + ⌜1⌝ , # α < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s)
| # cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[0] = cσ0[0], csl[n0] = cσ0[n0], α[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], α = ⌜al0⌝ , ⌜# csl⌝ = # α + ⌜1⌝ , # α < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α |
# cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, 2 + n0 = # csl, csl[0] = cσ0[0], csl[n0] = cσ0[n0], al0[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| # cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, 2 + n0 = # csl, csl[0] = cσ0[0], csl[n0] = cσ0[n0], al0[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝ |
# cσ0 = # α0 + ⌜1⌝ , 2 + n0 = # csl, n0 + 1 = # al0, csl[n0 + 1] = cσ0[n0 + 1], al0[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], csl = csl0 + cs2 ', csl ≠ [], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cs2, a, cs0)
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: csl, cs2, y
| # cσ0 = # α0 + ⌜1⌝ , 2 + n0 = # csl, n0 + 1 = # al0, csl[n0 + 1] = cσ0[n0 + 1], al0[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], csl = csl0 + cs2 ', csl ≠ [], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cs2, a, cs0) |
# cσ0 = # α0 + ⌜1⌝ , # csl0 = n0 + 1, n0 + 1 = # al0, al0[n0] = α0[n0], (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], hd(csl0 + cσ0[n0 + 1] ') = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s) ⊦ n = # x → (x + a ')[n] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ x ≠ [] → x[0] = hd(x); (s)
| # cσ0 = # α0 + ⌜1⌝ , # csl0 = n0 + 1, n0 + 1 = # al0, al0[n0] = α0[n0], (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], hd(csl0 + cσ0[n0 + 1] ') = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0) |
# csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, csl0 + cσ0[n0 + 1] ' = cs2 + csl, (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], al0[n0] = α0[n0], cs2 = cσ0[0], csl0 + cσ0[n0 + 1] ' ≠ [], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl0 + cσ0[n0 + 1] ', cs2, y
| # csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, csl0 + cσ0[n0 + 1] ' = cs2 + csl, (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], al0[n0] = α0[n0], cs2 = cσ0[0], csl0 + cσ0[n0 + 1] ' ≠ [], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝ |
# csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , csl0 + cσ0[n0 + 1] ' = cσ0[0] ' + csl, n0 + 1 = # al0, (cσ0[0] ' + csl)[n0] = cσ0[n0], al0[n0] = α0[n0], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cσ0[n0 + 1] = cσ0[0] ∨ cσ0[n0 + 1] ∈ csl, cσ0[0] ∈ csl0 ∨ cσ0[0] = cσ0[n0 + 1] ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (cσ0[0] ' + csl)[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)
| # csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , csl0 + cσ0[n0 + 1] ' = cσ0[0] ' + csl, n0 + 1 = # al0, (cσ0[0] ' + csl)[n0] = cσ0[n0], al0[n0] = α0[n0], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cσ0[n0 + 1] = cσ0[0] ∨ cσ0[n0 + 1] ∈ csl, cσ0[0] ∈ csl0 ∨ cσ0[0] = cσ0[n0 + 1] ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (cσ0[0] ' + csl)[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝ |
Used terms: α0[n0 + 1], cσ0[2 + 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.