[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof transitive (conclusion) (back to tree)

⊦ ls(g)(a, b) ∧ ls(g)(b, c) → ls(g)(a, c)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof transitive (previous step) (back to tree)

ls(g)(a, b), ls(g)(b, c), ¬ ls(g)(a, c) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof transitive (previous step) (back to tree)

ls(g)(b, c), ls(g)(a, b), ¬ ls(g)(a, c) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:order-def, seq: ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )), subst:[b, a, g] → [c, a, g], <all paths>

Additional information

Used terms: c, a, g

Proof step 4 from proof transitive (previous step) (back to tree)

⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))

Lemma order-def

Proof step 5 from proof transitive (previous step) (back to tree)

ls(g)(a, b), ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:order-def, seq: ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )), subst:[b, a, g] → [b, a, g], <all paths>

Additional information

Used terms: b, a, g

Proof step 6 from proof transitive (previous step) (back to tree)

⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))

Lemma order-def

Proof step 7 from proof transitive (previous step) (back to tree)

ls(g)(b, c), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof transitive (previous step) (back to tree)

ls(g)(b, c), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:order-def, seq: ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )), subst:[b, a, g] → [c, b, g], <all paths>

Additional information

Used terms: c, b, g

Proof step 9 from proof transitive (previous step) (back to tree)

⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))

Lemma order-def

Proof step 10 from proof transitive (previous step) (back to tree)

pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∃ y. pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜b '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof transitive (previous step) (back to tree)

pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ∀ y. ¬ pathp(g)(⌜c '⌝ + ⌜y⌝ + ⌜a '⌝ ) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: y0 + (b + y) abort: F discard: T computed: F

Additional information

Used terms: y0 + (b + y)

Proof step 12 from proof transitive (previous step) (back to tree)

pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), ¬ pathp(g)(⌜c '⌝ + ⌜y0 + (b + y)⌝ + ⌜a '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 13 from proof transitive (previous step) (back to tree)

pathp(g)(⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ ), pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ), ¬ pathp(g)(⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen, name:pathp-def, seq:⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])), subst:[σ, g] → [⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , g], <all paths>

Additional information

Used terms: ⌜c '⌝ + (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , g

Proof step 14 from proof transitive (previous step) (back to tree)

⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))

A spec-lemma

Proof step 15 from proof transitive (previous step) (back to tree)

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]))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 16 from proof transitive (previous step) (back to tree)

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])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen, name:pathp-def, seq:⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])), subst:[σ, g] → [⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ , g], <all paths>

Additional information

Used terms: ⌜c '⌝ + ⌜y0⌝ + ⌜b '⌝ , g

Proof step 17 from proof transitive (previous step) (back to tree)

⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))

A spec-lemma

Proof step 18 from proof transitive (previous step) (back to tree)

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])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 19 from proof transitive (previous step) (back to tree)

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])) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen, name:pathp-def, seq:⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])), subst:[σ, g] → [⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , g], <all paths>

Additional information

Used terms: ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , g

Proof step 20 from proof transitive (previous step) (back to tree)

⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))

A spec-lemma

Proof step 21 from proof transitive (previous step) (back to tree)

∀ 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])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 22 from proof transitive (previous step) (back to tree)

∀ 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])) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 23 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 24 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n], <all paths>

Additional information

Used terms: ⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n

Proof step 25 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 26 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 27 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[σ, σ1, m] → [⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n], <all paths>

Additional information

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

Proof step 28 from proof transitive (previous step) (back to tree)

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

Proof step 29 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)

Proof step 30 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n, n0]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m

Proof step 31 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 32 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , n0], <all paths>

Additional information

Used terms: ⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , n0

Proof step 33 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 34 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 35 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[σ, σ1, m] → [⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , (# y0 + # y) + 1], <all paths>

Additional information

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

Proof step 36 from proof transitive (previous step) (back to tree)

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

Proof step 37 from proof transitive (previous step) (back to tree)

¬ ⌜(# 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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 38 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: # y abort: F discard: F computed: T

Additional information

Used terms: # y

Proof step 39 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 40 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: g

Additional information

Used simplifier rules: graph generated by ×;;

Proof step 41 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ dom(vs × es) = vs; (s)

Proof step 42 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen-basic, name:edge-def, seq: ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b), subst:[vs, es, a, b] → [p_elem, p2_elem_elem, (b ' + y).last, a], <all paths>

Additional information

Used terms: p_elem, p2_elem_elem, (b ' + y).last, a

Proof step 43 from proof transitive (previous step) (back to tree)

⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)

A spec-lemma

Proof step 44 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 45 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: n0 + 1 abort: F discard: T computed: F

Additional information

Used terms: n0 + 1

Proof step 46 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 47 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [y0, b ' + y, n0], <all paths>

Additional information

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

Proof step 48 from proof transitive (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 49 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 50 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[x, y, n] → [y0, b ' + y, n0], <all paths>

Additional information

Used simplifier rules: ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: y0, b ' + y, n0

Proof step 51 from proof transitive (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 52 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)

Proof step 53 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n0, # y0, n2]

Additional information

Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # y0, n

Proof step 54 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 55 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [b ', y, n2], <all paths>

Additional information

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

Proof step 56 from proof transitive (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 57 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s)

Proof step 58 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[x, y, n] → [b ', y, n2], <all paths>

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: b ', y, n2

Proof step 59 from proof transitive (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 60 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s)

Proof step 61 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n2, n0]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n2, m

Proof step 62 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 63 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: n0 + 1 abort: F discard: T computed: F

Additional information

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

Proof step 64 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 65 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: 0 abort: F discard: T computed: F

Additional information

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

Proof step 66 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 67 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n0, (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , ⌜c '⌝ ], <all paths>

Additional information

Used terms: n0, (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , ⌜c '⌝

Proof step 68 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 69 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 70 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[σ, σ1, m] → [⌜c '⌝ , (⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ ) + ⌜a '⌝ , n0], <all paths>

Additional information

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

Proof step 71 from proof transitive (previous step) (back to tree)

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

Proof step 72 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)

Proof step 73 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n0, n2]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n0, m

Proof step 74 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 75 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜y0⌝ + ⌜b '⌝ + ⌜y⌝ , ⌜a '⌝ , n2], <all paths>

Additional information

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

Proof step 76 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 77 from proof transitive (previous step) (back to tree)

⌜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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 78 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [y0, b ' + y, n2], <all paths>

Additional information

Used terms: y0, b ' + y, n2

Proof step 79 from proof transitive (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 80 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 81 from proof transitive (previous step) (back to tree)

# 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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[x, y, n] → [y0, b ' + y, n2], <all paths>

Additional information

Used simplifier rules: ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: y0, b ' + y, n2

Proof step 82 from proof transitive (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 83 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)

Proof step 84 from proof transitive (previous step) (back to tree)

# 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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n2, # y0, n0]

Additional information

Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n2, # y0, n0

Proof step 85 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 86 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[σ, σ1, m] → [⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , (n0 + # y0) + 1], <all paths>

Additional information

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

Proof step 87 from proof transitive (previous step) (back to tree)

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

Proof step 88 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 89 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: n0 abort: F discard: T computed: T

Additional information

Used terms: n0

Proof step 90 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s)

Proof step 91 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [b ', y + a ', n0], <all paths>

Additional information

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

Proof step 92 from proof transitive (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 93 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 94 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n0, n2]

Additional information

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

Proof step 95 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 96 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , n2 + 1], <all paths>

Additional information

Used terms: ⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , n2 + 1

Proof step 97 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 98 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 99 from proof transitive (previous step) (back to tree)

# 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]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: n2 + 1 abort: F discard: T computed: T

Additional information

Used terms: n2 + 1

Proof step 100 from proof transitive (previous step) (back to tree)

# 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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 101 from proof transitive (previous step) (back to tree)

# 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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del, name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[x, y, n] → [y0, b ', n2], <all paths>

Additional information

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

Proof step 102 from proof transitive (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 103 from proof transitive (previous step) (back to tree)

# 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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 104 from proof transitive (previous step) (back to tree)

# 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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[σ, σ1, m] → [⌜y0⌝ , ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , n2 + 1], <all paths>

Additional information

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

Proof step 105 from proof transitive (previous step) (back to tree)

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

Proof step 106 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 107 from proof transitive (previous step) (back to tree)

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]) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: n2 + 1 abort: F discard: T computed: F

Additional information

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

Proof step 108 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 109 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [0, ⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ , ⌜y0⌝ ], <all paths>

Additional information

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⌝

Proof step 110 from proof transitive (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 111 from proof transitive (previous step) (back to tree)

⌜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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 112 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data, name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [y0, a0, y1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: y0, a0, y1

Proof step 113 from proof transitive (previous step) (back to tree)

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]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 114 from proof transitive (previous step) (back to tree)

¬ 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]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: 0

Additional information

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

Proof Tree for transitive (View conclusion)

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.

the proof tree