| ⊦ ls(g)(a, b) ∧ ls(g)(b, c) → ls(g)(a, c) |
ls(g)(a, b), ls(g)(b, c), ¬ ls(g)(a, c) ⊦
| ls(g)(a, b), ls(g)(b, c), ¬ ls(g)(a, c) ⊦ |
ls(g)(b, c), ls(g)(a, b), ¬ ls(g)(a, c) ⊦
| ls(g)(b, c), ls(g)(a, b), ¬ ls(g)(a, c) ⊦ |
⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))
ls(g)(a, b), ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦
Used terms: c, a, g
| ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) |
| ls(g)(a, b), ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦ |
⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))
ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦
Used terms: b, a, g
| ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) |
| ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦ |
ls(g)(b, c), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦
| ls(g)(b, c), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦ |
⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))
pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜b '⌝ ) ⊦
Used terms: c, b, g
| ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) |
| pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜b '⌝ ) ⊦ |
pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦
| pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦ |
pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), ¬ pathp(g)(⌜c '⌝ + ⌜y0 + (b + y)⌝ + ⌜a '⌝ ) ⊦
Used terms: y0 + (b + y)
| pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), ¬ pathp(g)(⌜c '⌝ + ⌜y0 + (b + y)⌝ + ⌜a '⌝ ) ⊦ |
pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ¬ pathp(g)(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s)
| pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ¬ pathp(g)(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), (∃ n. ¬(⌜n⌝ < #(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]))) ∨ (∃ n. ¬ ( ⌜n + 1⌝ < #(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n], (⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n + 1]))) ⊦
Used terms: ⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), (∃ n. ¬(⌜n⌝ < #(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]))) ∨ (∃ n. ¬ ( ⌜n + 1⌝ < #(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n], (⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n + 1]))) ⊦ |
pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (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 ⊦ ⌜n1⌝ < ⌜n0⌝ + ⌜n⌝ + ⌜m⌝ ↔ n1 < n0 + n + m; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ n. ⌜n⌝ < #(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ) → dom(g)((⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ) → edge(g)((⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n], (⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n + 1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦
Used terms: ⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ n. ⌜n⌝ < #(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ) → dom(g)((⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ) → edge(g)((⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n], (⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ )[n + 1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦ |
pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[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) 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) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n. ⌜n⌝ < #(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) → dom(g)((⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) → edge(g)((⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n], (⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n + 1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦
Used terms: ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n. ⌜n⌝ < #(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) → dom(g)((⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) → edge(g)((⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n], (⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n + 1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦ |
∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[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) 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) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ¬(n < 3 + # y0 + # y → dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n])) ∨ ¬(n0 < 2 + # y0 + # y → edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0])) ⊦ |
n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
| n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
n < 3 + # y0 + # y, ¬ ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
n < 3 + # y0 + # y, ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)(⌜c '⌝ [n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used terms: ⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| n < 3 + # y0 + # y, ¬ ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
n ≠ 0, n < 3 + # y0 + # y, ¬ ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n - (# ⌜c '⌝ ).n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: ⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| n ≠ 0, n < 3 + # y0 + # y, ¬ ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n - (# ⌜c '⌝ ).n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n - 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)
| n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n - 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n = n0 + 1, n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m
| n = n0 + 1, n ≠ 0, n < 3 + # y0 + # y, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s) ⊦ m + 1 ≠ 0; (s)
| n0 < (# y0 + # y) + 2, ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
n0 < (# y0 + # y) + 2, ¬ ⌜n0⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
n0 < (# y0 + # y) + 2, ⌜n0⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used terms: ⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , n0
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| n0 < (# y0 + # y) + 2, ¬ ⌜n0⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[(# y0 + # y) + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n → (n < m + 2 ↔ m + 1 = n); (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) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| ¬ dom(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[(# y0 + # y) + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
¬ ⌜(# y0 + # y) + 1⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)(⌜a '⌝ [(# y0 + # y) + 1 - (#(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )).n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ + ⌜n1⌝ ↔ n + m < n0 + n1; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < 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 Used terms: ⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , (# y0 + # y) + 1
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| ¬ ⌜(# y0 + # y) + 1⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)(⌜a '⌝ [(# y0 + # y) + 1 - (#(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )).n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
¬ dom(g)(a), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ a '[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m - m = 0; (s) ⊦ m + n - n + n1 = m - n1; (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⌝ .n = n; (s) n∞ ≠ ∞ ⊦ (⌜m⌝ + n∞).n = m + n∞.n; (s) ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ m ≤ m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ + ⌜n1⌝ ↔ n + m < n0 + n1; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ¬ dom(g)(a), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
¬ dom(g)(a), ¬ # y < # y → edge(g)((b ' + y + a ')[# y], (y + a ')[# y]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used terms: # y
| ¬ dom(g)(a), ¬ # y < # y → edge(g)((b ' + y + a ')[# y], (y + a ')[# y]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
edge(g)((b ' + y).last, a), ¬ dom(g)(a), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ (x + a ')[# x] = a; (s) ⊦ (a ' + x + y)[# x] = (a ' + x).last; (s) ⊦ ¬ n < n; (s)
| edge(g)((b ' + y).last, a), ¬ dom(g)(a), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
g = p_elem × p2_elem_elem, edge(g)((b ' + y).last, a), ¬ dom(g)(a), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: graph generated by ×;;
| g = p_elem × p2_elem_elem, edge(g)((b ' + y).last, a), ¬ dom(g)(a), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
edge(p_elem × p2_elem_elem)((b ' + y).last, a), ¬ p_elem(a), ∀ n1. ¬ # y < n1 → edge(p_elem × p2_elem_elem)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(p_elem × p2_elem_elem)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → p_elem((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → p_elem((c ' + y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ dom(vs × es) = vs; (s)
| edge(p_elem × p2_elem_elem)((b ' + y).last, a), ¬ p_elem(a), ∀ n1. ¬ # y < n1 → edge(p_elem × p2_elem_elem)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(p_elem × p2_elem_elem)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → p_elem((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → p_elem((c ' + y0 + b ')[n1]) ⊦ |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
Used terms: p_elem, p2_elem_elem, (b ' + y).last, a
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| n0 < (# y0 + # y) + 2, ⌜n0⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), ¬ dom(g)((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[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) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), n0 + 1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n0 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used terms: n0 + 1
| n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), n0 + 1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n0 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s)
| n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ n0 < # y0, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: y0, b ' + y, n0
| ⊦ n < # x → (x + y)[n] = x[n] |
| n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, ¬ n0 < # y0, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, # y0 ≤ n0, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
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) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) ⊦ m < m + n ↔ n ≠ 0; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| n0 < (# y0 + # y) + 2, # y0 ≤ n0, n0 ≤ # y0 + # y, ¬ dom(g)((y0 + b ' + y)[n0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, # y0 ≤ n0, ¬ n0 < # y0, ¬ dom(g)((b ' + y)[n0 - # y0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: y0, b ' + y, n0
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, # y0 ≤ n0, ¬ n0 < # y0, ¬ dom(g)((b ' + y)[n0 - # y0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 < (# y0 + # y) + 2, # y0 ≤ n0, n0 ≤ # y0 + # y, ¬ dom(g)((b ' + y)[n0 - # y0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)
| n0 < (# y0 + # y) + 2, # y0 ≤ n0, n0 ≤ # y0 + # y, ¬ dom(g)((b ' + y)[n0 - # y0]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 = n2 + # y0, n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, # y0 ≤ n0, ¬ dom(g)((b ' + y)[n2]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # y0, n
| n0 = n2 + # y0, n0 < (# y0 + # y) + 2, n0 ≤ # y0 + # y, # y0 ≤ n0, ¬ dom(g)((b ' + y)[n2]), ¬ # y0 < n0 → dom(g)((y0 + b ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n2 < # y + 2, n2 ≤ # y, ¬ dom(g)((b ' + y)[n2]), n2 = 0 → dom(g)(b), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ (x + a ')[# x] = a; (s) ⊦ n + 0 = n; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m ≤ m + n; (s)
| n2 < # y + 2, n2 ≤ # y, ¬ dom(g)((b ' + y)[n2]), n2 = 0 → dom(g)(b), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
n2 < # y + 2, n2 ≤ # y, ¬ n2 < # b ', ¬ dom(g)((b ' + y)[n2]), n2 = 0 → dom(g)(b), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ 0 ≤ m; (s) ⊦ 0 < m ↔ m ≠ 0; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a '[0] = a; (s) Used terms: b ', y, n2
| ⊦ n < # x → (x + y)[n] = x[n] |
| n2 < # y + 2, n2 ≤ # y, ¬ n2 < # b ', ¬ dom(g)((b ' + y)[n2]), n2 = 0 → dom(g)(b), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)((b ' + y)[n2]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s)
| n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)((b ' + y)[n2]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ n2 < # b ', ¬ dom(g)(y[n2 - # b ']), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: b ', y, n2
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ n2 < # b ', ¬ dom(g)(y[n2 - # b ']), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)(y[n2 - 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s)
| n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)(y[n2 - 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n2 = n0 + 1, n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)(y[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n2, m
| n2 = n0 + 1, n2 ≠ 0, n2 < # y + 2, n2 ≤ # y, ¬ dom(g)(y[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
y ≠ [], n0 < # y, ¬ dom(g)(y[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)
| y ≠ [], n0 < # y, ¬ dom(g)(y[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
Used simplifier rules: ⊦ m < m0 ∧ n < n0 → (m + n < m0 + n0 ↔ true); (ss) ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: n0 + 1
| n < 3 + # y0 + # y, ⌜n⌝ < # ⌜c '⌝ , ¬ dom(g)(⌜c '⌝ [n]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
¬ dom(g)(c), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ a '[0] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) ⊦ 0 < m ↔ m ≠ 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ¬ dom(g)(c), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: 0
| n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
n0 < 2 + # y0 + # y, ¬ ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
n0 < 2 + # y0 + # y, ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)(⌜c '⌝ [n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used terms: n0, (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , ⌜c '⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| n0 < 2 + # y0 + # y, ¬ ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)((⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0 - (# ⌜c '⌝ ).n], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: ⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n0
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0 - (# ⌜c '⌝ ).n], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0 - 1], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)
| n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n0 - 1], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 = n2 + 1, n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n0, m
| n0 = n2 + 1, n0 ≠ 0, n0 < 2 + # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n2 ≤ # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
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) n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s) ⊦ m + 1 ≠ 0; (s)
| n2 ≤ # y0 + # y, ¬ edge(g)(((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
⌜n2⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), n2 ≤ # y0 + # y, ¬ edge(g)((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ m ≤ n → (n < m ↔ false); (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 Used terms: ⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , n2
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| ⌜n2⌝ < #(⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ), n2 ≤ # y0 + # y, ¬ edge(g)((⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ )[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n2 ≤ # y0 + # y, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[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 ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| n2 ≤ # y0 + # y, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
n2 ≤ # y0 + # y, ¬ n2 < # y0, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
n2 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used terms: y0, b ' + y, n2
| ⊦ n < # x → (x + y)[n] = x[n] |
| n2 ≤ # y0 + # y, ¬ n2 < # y0, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
# y0 ≤ n2, n2 ≤ # y0 + # y, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
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) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # y0 ≤ n2, n2 ≤ # y0 + # y, ¬ edge(g)((y0 + b ' + y)[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
n2 ≤ # y0 + # y, # y0 ≤ n2, ¬ n2 < # y0, ¬ edge(g)((b ' + y)[n2 - # y0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: y0, b ' + y, n2
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| n2 ≤ # y0 + # y, # y0 ≤ n2, ¬ n2 < # y0, ¬ edge(g)((b ' + y)[n2 - # y0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
# y0 ≤ n2, n2 ≤ # y0 + # y, ¬ edge(g)((b ' + y)[n2 - # y0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)
| # y0 ≤ n2, n2 ≤ # y0 + # y, ¬ edge(g)((b ' + y)[n2 - # y0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n2 = n0 + # y0, n2 ≤ # y0 + # y, # y0 ≤ n2, ¬ edge(g)((b ' + y)[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n2, # y0, n0
| n2 = n0 + # y0, n2 ≤ # y0 + # y, # y0 ≤ n2, ¬ edge(g)((b ' + y)[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[(n0 + # y0) + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
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) ⊦ m ≤ m + n; (s)
| n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[(n0 + # y0) + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
n0 ≤ # y, ¬ ⌜(n0 + # y0) + 1⌝ < # ⌜y0⌝ , ¬ edge(g)((b ' + y)[n0], (⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[(n0 + # y0) + 1 - (# ⌜y0⌝ ).n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n1 + n + m < n0; (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 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 Used terms: ⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , (n0 + # y0) + 1
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| n0 ≤ # y, ¬ ⌜(n0 + # y0) + 1⌝ < # ⌜y0⌝ , ¬ edge(g)((b ' + y)[n0], (⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[(n0 + # y0) + 1 - (# ⌜y0⌝ ).n]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m + n - m = n; (s) ⊦ ⌜n⌝ .n = 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 ⊦ ¬ m + n < m; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n1 + n + m < n0; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ¬ # y < n0 → edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used terms: n0
| n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ¬ # y < n0 → edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)
| edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), n0 ≤ # y, ¬ n0 < # b ', ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ a '[0] = a; (s) ⊦ 0 ≤ m; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: b ', y + a ', n0
| ⊦ n < # x → (x + y)[n] = x[n] |
| edge(g)((b ' + y + a ')[n0], (y + a ')[n0]), n0 ≤ # y, ¬ n0 < # b ', ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
n0 ≠ 0, edge(g)((y + a ')[n0 - 1], (y + a ')[n0]), n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s)
| n0 ≠ 0, edge(g)((y + a ')[n0 - 1], (y + a ')[n0]), n0 ≤ # y, ¬ edge(g)((b ' + y)[n0], (y + a ')[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
Used simplifier rules: ⊦ m + 1 ≠ 0; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n0, m
| n2 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
y0 ≠ [], n2 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| y0 ≠ [], n2 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
y0 ≠ [], n2 < # y0, n2 ≤ # y0 + # y, ¬ ⌜n2 + 1⌝ < # ⌜y0⌝ , ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
y0 ≠ [], n2 < # y0, ⌜n2 + 1⌝ < # ⌜y0⌝ , n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], ⌜y0⌝ [n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used terms: ⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , n2 + 1
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| y0 ≠ [], n2 < # y0, n2 ≤ # y0 + # y, ¬ ⌜n2 + 1⌝ < # ⌜y0⌝ , ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
# y0 = n2 + 1, y0 ≠ [], ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ n2 + 1 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ m + n; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat 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 < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # y0 = n2 + 1, y0 ≠ [], ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ n2 + 1 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
# y0 = n2 + 1, y0 ≠ [], ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ¬ n2 + 1 < n2 + 1 → edge(g)((c ' + y0 + b ')[n2 + 1], (y0 + b ')[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦
Used terms: n2 + 1
| # y0 = n2 + 1, y0 ≠ [], ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ¬ n2 + 1 < n2 + 1 → edge(g)((c ' + y0 + b ')[n2 + 1], (y0 + b ')[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦ |
# y0 = n2 + 1, y0 ≠ [], edge(g)((y0 + b ')[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ 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 ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m + n < m + n0 ↔ n < n0; (s)
| # y0 = n2 + 1, y0 ≠ [], edge(g)((y0 + b ')[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# y0 = n2 + 1, y0 ≠ [], n2 < # y0, edge(g)(y0[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m < n ↔ ¬ n ≤ m; (ss) 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: y0, b ', n2
| ⊦ n < # x → (x + y)[n] = x[n] |
| # y0 = n2 + 1, y0 ≠ [], n2 < # y0, edge(g)(y0[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦ |
# y0 = n2 + 1, y0 ≠ [], edge(g)(y0[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| # y0 = n2 + 1, y0 ≠ [], edge(g)(y0[n2], b), ¬ edge(g)(y0[n2], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 3 + n2 → dom(g)((c ' + y0 + b ')[n1]) ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) 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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ 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 ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list 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: ⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , n2 + 1
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| y0 ≠ [], n2 < # y0, ⌜n2 + 1⌝ < # ⌜y0⌝ , n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], ⌜y0⌝ [n2 + 1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
y0 ≠ [], n2 < # y0, n2 + 1 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], y0[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (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) 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)
| y0 ≠ [], n2 < # y0, n2 + 1 < # y0, n2 ≤ # y0 + # y, ¬ edge(g)(y0[n2], y0[n2 + 1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n < # x → (x + a ')[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: n2 + 1
| n0 < 2 + # y0 + # y, ⌜n0⌝ < # ⌜c '⌝ , ¬ edge(g)(⌜c '⌝ [n0], (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[n0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
¬ edge(g)(c, (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ a '[0] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) ⊦ 0 < m ↔ m ≠ 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ¬ edge(g)(c, (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )[0]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
⌜0⌝ < # ⌜y0⌝ , ¬ edge(g)(c, ⌜y0⌝ [0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜0⌝ < n∞ ↔ n∞ ≠ ⌜0⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] + σ = σ; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ # [] = 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ a '[0] = a; (s) Used terms: 0, ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , ⌜y0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| ⌜0⌝ < # ⌜y0⌝ , ¬ edge(g)(c, ⌜y0⌝ [0]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
y0 ≠ [], ¬ edge(g)(c, y0.head), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = x.head; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ ⌜0⌝ < n∞ ↔ n∞ ≠ ⌜0⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| y0 ≠ [], ¬ edge(g)(c, y0.head), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]) ⊦ |
y0 = a0 + y1, y0 ≠ [], ¬ edge(g)(c, a0), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: y0, a0, y1
| y0 = a0 + y1, y0 ≠ [], ¬ edge(g)(c, a0), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y0 → dom(g)((c ' + y0 + b ')[n1]), ∀ n1. ¬ # y0 < n1 → edge(g)((c ' + y0 + b ')[n1], (y0 + b ')[n1]) ⊦ |
¬ edge(g)(c, a0), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y1 + 1 < n1 → edge(g)((c ' + (a0 ' + y1) + b ')[n1], ((a0 ' + y1) + b ')[n1]), ∀ n1. n1 < 3 + # y1 → dom(g)((c ' + (a0 ' + y1) + b ')[n1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ a + x = a ' + x; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s)
| ¬ edge(g)(c, a0), ∀ n1. ¬ # y < n1 → edge(g)((b ' + y + a ')[n1], (y + a ')[n1]), ∀ n1. n1 < 2 + # y → dom(g)((b ' + y + a ')[n1]), ∀ n1. ¬ # y1 + 1 < n1 → edge(g)((c ' + (a0 ' + y1) + b ')[n1], ((a0 ' + y1) + b ')[n1]), ∀ n1. n1 < 3 + # y1 → dom(g)((c ' + (a0 ' + y1) + b ')[n1]) ⊦ |
Used simplifier rules: n0 < n ⊦ ¬ m + (* n) < (* n0); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: 0
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.