| frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ frag(IOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ) |
sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ¬ frag(IOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ) ⊦
| sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ¬ frag(IOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), #(⌜sl.butlast⌝ + ⌜sl0⌝ ) ≠ #(⌜al⌝ + ⌜al0⌝ ) + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < #(⌜al⌝ + ⌜al0⌝ ) → stepf((⌜sl.butlast⌝ + ⌜sl0⌝ )[n], (⌜al⌝ + ⌜al0⌝ )[n], (⌜sl.butlast⌝ + ⌜sl0⌝ )[n +1]))) ⊦
Used terms: ⌜al⌝ + ⌜al0⌝ , ⌜sl.butlast⌝ + ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), #(⌜sl.butlast⌝ + ⌜sl0⌝ ) ≠ #(⌜al⌝ + ⌜al0⌝ ) + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < #(⌜al⌝ + ⌜al0⌝ ) → stepf((⌜sl.butlast⌝ + ⌜sl0⌝ )[n], (⌜al⌝ + ⌜al0⌝ )[n], (⌜sl.butlast⌝ + ⌜sl0⌝ )[n +1]))) ⊦ |
sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), # al + # al0 + 1 ≠ # sl.butlast + # sl0 ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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 ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ + ⌜n2⌝ ↔ n1 + n + m = n0 + n2; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), # al + # al0 + 1 ≠ # sl.butlast + # sl0 ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl0⌝ = # ⌜al0⌝ + ⌜1⌝ , sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ∀ n. ⌜n⌝ < # ⌜al0⌝ → stepf(⌜sl0⌝ [n], ⌜al0⌝ [n], ⌜sl0⌝ [n +1]), # al + # al0 + 1 ≠ # sl.butlast + # sl0 ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦
Used terms: ⌜al0⌝ , ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl0⌝ = # ⌜al0⌝ + ⌜1⌝ , sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ∀ n. ⌜n⌝ < # ⌜al0⌝ → stepf(⌜sl0⌝ [n], ⌜al0⌝ [n], ⌜sl0⌝ [n +1]), # al + # al0 + 1 ≠ # sl.butlast + # sl0 ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦ |
# al0 + 1 = # sl0, sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 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 = m + n0 ↔ n = n0; (s) ⊦ ⌜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 = # sl0, sl0[0] = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , # al0 + 1 = # sl0, sl0[0] = sl.last, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦
Used terms: ⌜al⌝ , ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , # al0 + 1 = # sl0, sl0[0] = sl.last, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦ |
# al0 + 1 = # sl0, # al + 1 = # sl, sl0[0] = sl.last, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦
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 = # sl0, # al + 1 = # sl, sl0[0] = sl.last, ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), # al ≠ # sl.butlast ∨ ¬(n < # al + # al0 → stepf((sl.butlast + sl0)[n], (al + al0)[n], (sl.butlast + sl0)[n + 1])) ⊦ |
# al + 1 = # sl, # al0 + 1 = # sl0, sl0[0] = a, sl = sl1 + a ', sl ≠ [], ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), # al ≠ # sl1 ∨ ¬(n < # al + # al0 → stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1])) ⊦
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) 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: sl, a, y
| # al + 1 = # sl, # al0 + 1 = # sl0, sl0[0] = a, sl = sl1 + a ', sl ≠ [], ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), # al ≠ # sl1 ∨ ¬(n < # al + # al0 → stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1])) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, n < # sl1 + # al0, ¬ stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)
| # al = # sl1, # al0 + 1 = # sl0, n < # sl1 + # al0, ¬ stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# al = # sl1, # al0 + 1 = # sl0, n < # sl1, n < # sl1 + # al0, ¬ stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
# al = # sl1, # al0 + 1 = # sl0, n < # sl1 + # al0, ¬ n < # sl1, ¬ stepf(sl0[n - # sl1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used terms: n, sl0, sl1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # al = # sl1, # al0 + 1 = # sl0, n < # sl1, n < # sl1 + # al0, ¬ stepf((sl1 + sl0)[n], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ n < # x → (x + y)[n] = x[n]; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ n < # x → (x + y)[n] = x[n]; (s)
| # al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1 + # al0, n < # sl1, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
Used terms: n
| # al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1 + # al0, n < # sl1, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, ¬ n + 1 < # sl1, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
# al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, n + 1 < # sl1, ¬ stepf(sl1[n], al[n], sl1[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
Used terms: n + 1, sl0, sl1
| ⊦ n < # x → (x + y)[n] = x[n] |
| # al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, ¬ n + 1 < # sl1, ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
# al = n + 1, # sl1 = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. ¬ n < n0 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 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 ≤ m + n; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ m + n < m; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # al = n + 1, # sl1 = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. ¬ n < n0 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
# sl1 = n + 1, # al = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ¬ n < n → stepf(sl1[n], al[n], (sl1 + sl0[0] ')[n + 1]) ⊦
Used terms: n
| # sl1 = n + 1, # al = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ¬ n < n → stepf(sl1[n], al[n], (sl1 + sl0[0] ')[n + 1]) ⊦ |
# al = n + 1, # sl1 = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], stepf(sl1[n], al[n], sl0[0]), ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ ¬ n < n; (s)
| # al = n + 1, # sl1 = n + 1, # al0 + 1 = # sl0, sl1 ≠ [], stepf(sl1[n], al[n], sl0[0]), ¬ stepf(sl1[n], al[n], (sl1 + sl0)[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ m - m = 0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ m < n → ¬ m + m0 < n; (s) Used terms: sl1, sl0, n + 1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # al = # sl1, # al0 + 1 = # sl0, sl1 ≠ [], n < # sl1, n < # sl1 + # al0, n + 1 < # sl1, ¬ stepf(sl1[n], al[n], sl1[n + 1]), n < # al0 → stepf(sl0[n], al0[n], sl0[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
Used simplifier rules: ⊦ n < # x → (x + a ')[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: n
| # al = # sl1, # al0 + 1 = # sl0, n < # sl1 + # al0, ¬ n < # sl1, ¬ stepf(sl0[n - # sl1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n < # sl1 + # al0, # sl1 ≤ n, ¬ stepf(sl0[n - # sl1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n < # sl1 + # al0, # sl1 ≤ n, ¬ stepf(sl0[n - # sl1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, n = n1 + # sl1, al0 ≠ [], n < # sl1 + # al0, # sl1 ≤ n, ¬ stepf(sl0[n1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n, # sl1, n1
| # al = # sl1, # al0 + 1 = # sl0, n = n1 + # sl1, al0 ≠ [], n < # sl1 + # al0, # sl1 ≤ n, ¬ stepf(sl0[n1], (al + al0)[n], (sl1 + sl0)[n + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (x + y)[n + # x] = y[n]; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m ≤ m + n; (s)
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]), ∀ n0. n0 < # sl1 → stepf(sl1[n0], al[n0], (sl1 + sl0[0] ')[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used terms: n1
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], (al + al0)[n1 + # sl1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ n1 + # sl1 < # al, ¬ stepf(sl0[n1], al0[n1 + # sl1 - # al], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦
Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ # x = 0 ↔ 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: n1 + # sl1, al0, al
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ n1 + # sl1 < # al, ¬ stepf(sl0[n1], al0[n1 + # sl1 - # al], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
# al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 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 - m = n; (s) ⊦ m ≤ m + n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # al = # sl1, # al0 + 1 = # sl0, al0 ≠ [], n1 < # al0, ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), n1 < # sl1 → stepf(sl1[n1], al[n1], (sl1 + sl0[0] ')[n1 + 1]), ∀ n0. n0 < # al0 → stepf(sl0[n0], al0[n0], sl0[n0 + 1]) ⊦ |
Used terms: n1
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.