[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 moveone-splitstep (conclusion) (back to tree)

a ≠ τ, move(IOAut(startf, stepf))(s, ⌜a '⌝ , s2) ⊦ ∃ s0, s1. move(IOAut(startf, stepf))(s, [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof moveone-splitstep (previous step) (back to tree)

a ≠ τ, move(IOAut(startf, stepf))(s, ⌜a '⌝ , s2) ⊦ ∃ s0, s1. move(IOAut(startf, stepf))(s, [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, s2, ⌜a '⌝ , s], <all paths>

Additional information

Used terms: s2, ⌜a '⌝ , s, stepf, startf

Proof step 3 from proof moveone-splitstep (previous step) (back to tree)

⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

Lemma move

Proof step 4 from proof moveone-splitstep (previous step) (back to tree)

a ≠ τ, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s2 = sl.last ∧ α ^ = ⌜a '⌝ ⊦ ∃ s0, s1. move(IOAut(startf, stepf))(s, [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 5 from proof moveone-splitstep (previous step) (back to tree)

⌜al⌝ ^ = ⌜a '⌝ , a ≠ τ, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s0, s1. move(IOAut(startf, stepf))(sl[0], [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], sl.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-tofin, seq:∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [], subst:[β] → [⌜al⌝ ], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: ⌜al⌝

Proof step 6 from proof moveone-splitstep (previous step) (back to tree)

∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []

A spec-lemma

Proof step 7 from proof moveone-splitstep (previous step) (back to tree)

⌜al⌝ ^ = ⌜a '⌝ , a ≠ τ, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∀ n. ⌜n⌝ < # ⌜al⌝ → ⌜al⌝ [n] = τ, ∃ s0, s1. move(IOAut(startf, stepf))(sl[0], [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], sl.last)

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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 8 from proof moveone-splitstep (previous step) (back to tree)

⌜al⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s0, s1. move(IOAut(startf, stepf))(sl[0], [], s0) ∧ stepf(s0, a, s1) ∧ move(IOAut(startf, stepf))(s1, [], sl.last)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: sl[n], sl[n + 1] abort: F discard: T computed: F

Additional information

Used terms: sl[n], sl[n + 1]

Proof step 9 from proof moveone-splitstep (previous step) (back to tree)

⌜al⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜sl⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜sl⌝ , stepf, startf

Proof step 10 from proof moveone-splitstep (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 11 from proof moveone-splitstep (previous step) (back to tree)

# ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , ⌜al⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 12 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: al = (al to n + 1) + (al from n + 1)

Additional information

Used formulas: al = (al to n + 1) + (al from n + 1)

Proof step 13 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al⌝ ^ = ⌜a '⌝ , al = (al to n + 1) + (al from n + 1), al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard, [[1,2,1,1,1]]

Additional information

Proof step 14 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜(al to n + 1) + (al from n + 1)⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

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[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 15 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n + 1⌝ ^ + ⌜al from n + 1⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-unwind-end-fin, seq:m < # x ⊦ x to m + 1 = (x to m) + x[m] ', subst:[m, x] → [n, al], <all paths>

Additional information

Used terms: n, al

Proof step 16 from proof moveone-splitstep (previous step) (back to tree)

m < # x ⊦ x to m + 1 = (x to m) + x[m] '

A spec-lemma

Proof step 17 from proof moveone-splitstep (previous step) (back to tree)

⌜(al to n) + al[n] '⌝ ^ + ⌜al from n + 1⌝ ^ = ⌜a '⌝ , # al + 1 = # sl, al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

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[actionstream] ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 18 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, (⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜a '⌝ , (⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^], <all paths>

Additional information

Used terms: ⌜a '⌝ , (⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^

Proof step 19 from proof moveone-splitstep (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

Proof step 20 from proof moveone-splitstep (previous step) (back to tree)

#((⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^) = # ⌜a '⌝ , # al + 1 = # sl, al[n] ≠ τ, a ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ n0. ⌜n0⌝ < #((⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^) → ((⌜al to n⌝ ^ + ⌜al[n] '⌝ ) + ⌜al from n + 1⌝ ^)[n0] = ⌜a '⌝ [n0] ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s) ⊦ [] + σ = σ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ ⌜0⌝ < n∞ ↔ n∞ ≠ ⌜0⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # σ = ⌜0⌝ ↔ σ = []; (s) ⊦ n∞ + n∞1 = ⌜0⌝ ↔ n∞ = ⌜0⌝ ∧ n∞1 = ⌜0⌝ ; (ws) ⊦ m ≤ n → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ = n∞2); (s)

Proof step 21 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], al[n], sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: n abort: F discard: F computed: T

Additional information

Used terms: n

Proof step 22 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], al[n], sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 24 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ move(IOAut(startf, stepf))(sl[0], [], sl[n]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, sl[n], [], sl[0]], <all paths>

Additional information

Used terms: sl[n], [], sl[0], stepf, startf

Proof step 25 from proof moveone-splitstep (previous step) (back to tree)

⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

Lemma move

Proof step 26 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ α, sl0. ¬(frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[0] = sl0[0] ∧ sl[n] = sl0.last ∧ α ^ = []) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β);

Proof step 27 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ α, sl0. ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∨ ¬ finp(α) ∨ sl[0] ≠ sl0[0] ∨ sl[n] ≠ sl0.last ∨ α ^ ≠ [] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: ⌜al to n⌝ , sl to n + 1 abort: F discard: T computed: F

Additional information

Used terms: ⌜al to n⌝ , sl to n + 1

Proof step 28 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ∨ ¬ finp(⌜al to n⌝ ) ∨ sl[0] ≠ (sl to n + 1)[0] ∨ sl[n] ≠ (sl to n + 1).last ∨ ⌜al to n⌝ ^ ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m = m0 + n0 ∧ n < n0 → ¬ m < m0 + n; (s) ⊦ finp(⌜x⌝ ); (s)

Proof step 29 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ∨ sl[n] ≠ (sl to n + 1).last ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:to-unwind-end-fin, seq:m < # x ⊦ x to m + 1 = (x to m) + x[m] ', subst:[m, x] → [n, sl], <all paths>

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n, sl

Proof step 30 from proof moveone-splitstep (previous step) (back to tree)

m < # x ⊦ x to m + 1 = (x to m) + x[m] '

A spec-lemma

Proof step 31 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, n < # sl, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ frag(IOAut(startf, stepf))(⌜(sl to n) + sl[n] '⌝ , ⌜al to n⌝ ) ∨ sl[n] ≠ ((sl to n) + sl[n] ').last ⊦

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 → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 32 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n < # al, n < # sl, stepf(sl[n], al[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to n⌝ + ⌜sl[n] '⌝ , ⌜al to n⌝ ), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al to n⌝ , ⌜sl to n⌝ + ⌜sl[n] '⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜al to n⌝ , ⌜sl to n⌝ + ⌜sl[n] '⌝ , stepf, startf

Proof step 33 from proof moveone-splitstep (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 34 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n < # sl, n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), #(⌜sl to n⌝ + ⌜sl[n] '⌝ ) ≠ # ⌜al to n⌝ + ⌜1⌝ ∨ (∃ n0. ¬(⌜n0⌝ < # ⌜al to n⌝ → stepf((⌜sl to n⌝ + ⌜sl[n] '⌝ )[n0], ⌜al to n⌝ [n0], (⌜sl to n⌝ + ⌜sl[n] '⌝ )[n0 +1]))) ⊦

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 → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m +1 = m + 1; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m < n → n ≠ 0; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # x < n ⊦ #(x to 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 ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 35 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 + 1 < # al, n < # al, n < # sl, n0 < n, n0 < # al, n0 < # sl, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(((sl to n) + sl[n] ')[n0], al[n0], ((sl to n) + sl[n] ')[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ m < n → ¬ n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n0, sl[n] ', sl to n

Proof step 36 from proof moveone-splitstep (previous step) (back to tree)

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

A spec-lemma

Proof step 37 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 < # sl, n0 < # al, n0 < n, n < # sl, n < # al, n0 + 1 < # al, n0 < #(sl to n), stepf(sl[n], al[n], sl[n + 1]), ¬ stepf((sl to n)[n0], al[n0], ((sl to n) + sl[n] ')[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ m < n → ¬ n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s)

Proof step 38 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 + 1 < # al, n < # al, n < # sl, n0 < # al, n0 < # sl, n0 < n, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[n0], al[n0], ((sl to n) + sl[n] ')[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0 + 1, sl[n] ', sl to n

Proof step 39 from proof moveone-splitstep (previous step) (back to tree)

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

A spec-lemma

Proof step 40 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 < n, n0 < # sl, n0 < # al, n < # sl, n < # al, n0 + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ n0 + 1 < #(sl to n), ¬ stepf(sl[n0], al[n0], ((sl to n) + sl[n] ')[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) 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 eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m < n → ¬ n < m; (s)

Proof step 41 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n0 + 1⌝ ^ = [], ⌜al from 2 + n0⌝ ^ = [], al[n0 + 1] ≠ τ, al ≠ [], sl ≠ [], n0 < # sl, n0 < # al, n0 + 1 < # al, stepf(sl[n0 + 1], al[n0 + 1], sl[2 + n0]), ¬ stepf(sl[n0], al[n0], ((sl to n0 + 1) + sl[n0 + 1] ')[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 42 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from 2 + n0⌝ ^ = [], ⌜al to n0 + 1⌝ ^ = [], al[n0 + 1] ≠ τ, al ≠ [], sl ≠ [], n0 + 1 < # al, n0 < # al, n0 < # sl, stepf(sl[n0 + 1], al[n0 + 1], sl[2 + n0]), ¬ stepf(sl[n0], al[n0], ((sl to n0 + 1) + sl[n0 + 1] ')[n0 + 1]), n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n0 + 1⌝ ^ = [], ⌜al from 2 + n0⌝ ^ = [], al[n0 + 1] ≠ τ, al ≠ [], sl ≠ [], n0 < # sl, n0 < # al, n0 + 1 < # al, stepf(sl[n0 + 1], al[n0 + 1], sl[2 + n0]), stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ stepf(sl[n0], al[n0], ((sl to n0 + 1) + sl[n0 + 1] ')[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m = m0 + n0 ∧ n < n0 → ¬ m < m0 + n; (s) ¬ # x < n ⊦ #(x to n) = n; (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 '[0] = a; (s) Used terms: sl to n0 + 1, sl[n0 + 1] ', n0 + 1

Proof step 44 from proof moveone-splitstep (previous step) (back to tree)

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

A spec-lemma

Proof step 45 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 < n, n0 < # sl, n0 < # al, n < # sl, n < # al, n0 + 1 < # al, n0 + 1 < #(sl to n), stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[n0], al[n0], (sl to n)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

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 < m0 → m + n < m0 + n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m +1 = m + 1; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ m < n → ¬ n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s)

Proof step 46 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], 2 + n0 < # al, 2 + n0 < # sl, n < # al, n < # sl, n0 < # al, n0 < # sl, n0 < n, n0 + 1 < n, n0 + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 18 terms: n0

Additional information

Used terms: n0

Proof step 47 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, sl.last, [], sl[n + 1]], <all paths>

Additional information

Used terms: sl.last, [], sl[n + 1], stepf, startf

Proof step 48 from proof moveone-splitstep (previous step) (back to tree)

⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

Lemma move

Proof step 49 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ α, sl0. ¬(frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[n + 1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β);

Proof step 50 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ∀ α, sl0. ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∨ ¬ finp(α) ∨ sl[n + 1] ≠ sl0[0] ∨ sl.last ≠ sl0.last ∨ α ^ ≠ [] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: ⌜al from n + 1⌝ , sl from n + 1 abort: F discard: T computed: F

Additional information

Used terms: ⌜al from n + 1⌝ , sl from n + 1

Proof step 51 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl from n + 1⌝ , ⌜al from n + 1⌝ ) ∨ ¬ finp(⌜al from n + 1⌝ ) ∨ sl[n + 1] ≠ (sl from n + 1)[0] ∨ sl.last ≠ (sl from n + 1).last ∨ ⌜al from n + 1⌝ ^ ≠ [] ⊦

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 + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ finp(⌜x⌝ ); (s)

Proof step 52 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl from n + 1⌝ , ⌜al from n + 1⌝ ) ∨ sl.last ≠ (sl from n + 1).last ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al from n + 1⌝ , ⌜sl from n + 1⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜al from n + 1⌝ , ⌜sl from n + 1⌝ , stepf, startf

Proof step 53 from proof moveone-splitstep (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 54 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), ¬ ( # ⌜sl from n + 1⌝ = # ⌜al from n + 1⌝ + ⌜1⌝ ∧ (∀ n0. ⌜n0⌝ < # ⌜al from n + 1⌝ → stepf(⌜sl from n + 1⌝ [n0], ⌜al from n + 1⌝ [n0], ⌜sl from n + 1⌝ [n0 +1]))) ∨ sl.last ≠ (sl from n + 1).last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜x⌝ [n] = x[n]; (s) n0 ≤ n ⊦ m < n - n0 ↔ m + n0 < n; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (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 + n0 ↔ n = n0; (s) n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m = m0 + n0 ∧ n < n0 → ¬ m < m0 + n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 55 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]), # al ≠ n + (# sl - n + 1) ∨ ¬(n0 + n + 1 < # al → stepf((sl from n + 1)[n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1])) ∨ sl.last ≠ (sl from n + 1).last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 56 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], # al ≠ n + (# sl - n + 1), al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: # sl, n + 1, n1

Proof step 57 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n0 + n + 1 < # al, n < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf((sl from n + 1)[n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 58 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], n < # al, n0 + n + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf((sl from n + 1)[n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-from-01, seq:m + m0 < # x ⊦ (x from m)[m0] = x[m + m0], subst:[m0, m, x] → [n0, n + 1, sl], <all paths>

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0, n + 1, sl

Proof step 59 from proof moveone-splitstep (previous step) (back to tree)

m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]

A spec-lemma

Proof step 60 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], n0 + n + 1 < # al, n < # al, (n + 1) + n0 < # sl, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

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 < m0 → m + n < m0 + n0; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 61 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 + n + 1 < # al, n < # al, (n + 1) + n0 < # sl, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-from-01, seq:m + m0 < # x ⊦ (x from m)[m0] = x[m + m0], subst:[m0, m, x] → [n0 + 1, n + 1, sl], <all paths>

Additional information

Used terms: n0 + 1, n + 1, sl

Proof step 62 from proof moveone-splitstep (previous step) (back to tree)

m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]

A spec-lemma

Proof step 63 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ (n + 1) + n0 + 1 < # sl, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

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) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 64 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), # sl ≤ 2 + n + n0, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0 + n + 1

Proof step 65 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 + n + 1 < # al, n < # al, (n + 1) + n0 < # sl, stepf(sl[n], al[n], sl[n + 1]), # sl ≤ 2 + n + n0, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]), n0 + n + 1 < # al → stepf(sl[n0 + n + 1], al[n0 + n + 1], sl[(n0 + n + 1) + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 66 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), stepf(sl[n0 + n + 1], al[n0 + n + 1], sl[2 + n0 + n]), # sl ≤ 2 + n + n0, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-from-01, seq:m + m0 < # x ⊦ (x from m)[m0] = x[m + m0], subst:[x, m, m0] → [sl, n + 1, n0 + 1], <all paths>

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 → (n < m ↔ false); (s) Used terms: sl, n + 1, n0 + 1

Proof step 67 from proof moveone-splitstep (previous step) (back to tree)

m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]

A spec-lemma

Proof step 68 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], n0 + n + 1 < # al, n < # al, (n + 1) + n0 < # sl, stepf(sl[n0 + n + 1], al[n0 + n + 1], sl[2 + n0 + n]), stepf(sl[n], al[n], sl[n + 1]), # sl ≤ 2 + n + n0, ¬ (n + 1) + n0 + 1 < # sl, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 69 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), stepf(sl[n0 + n + 1], al[n0 + n + 1], sl[2 + n0 + n]), # sl ≤ 2 + n + n0, ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], (sl from n + 1)[n0 + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

Used simplifier rules: n < n0 ⊦ m + (* n) ≤ m0 + (* n0) ↔ m ≤ m0 + (n0 - n); (s) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 70 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, (n + 1) + n0 + 1 < # sl, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], sl[(n + 1) + n0 + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

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 n0 < n ⊦ m + (* n) < m0 + (* n0) ↔ m + (n - n0) < m0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic

Proof step 71 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, al ≠ [], sl ≠ [], 2 + n + n0 < # sl, (n + 1) + n0 < # sl, n < # al, n0 + n + 1 < # al, (n + n0) + 1 < # al, stepf(sl[n], al[n], sl[n + 1]), ¬ stepf(sl[(n + 1) + n0], al[(n + 1) + n0], sl[2 + n + n0]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 14 terms: (n + n0) + 1

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 Used terms: (n + n0) + 1

Proof step 72 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al to n⌝ ^ = [], ⌜al from n + 1⌝ ^ = [], sl.last ≠ (sl from n + 1).last, al[n] ≠ τ, al ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [sl, a, sl0]

Additional information

Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl, a, y

Proof step 73 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], sl = sl0 + a ', al[n] ≠ τ, a ≠ (sl from n + 1).last, al ≠ [], sl ≠ [], n < # al, stepf(sl[n], al[n], sl[n + 1]), ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦

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[IOstatestream] ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)

Proof step 74 from proof moveone-splitstep (previous step) (back to tree)

# al = # sl0, ⌜al from n + 1⌝ ^ = [], ⌜al to n⌝ ^ = [], al[n] ≠ τ, a ≠ (sl0 + a ' from n + 1).last, al ≠ [], sl0 ≠ [], n < # sl0, stepf(sl0[n], al[n], (sl0 + a ')[n + 1]), ∀ n0. n0 < # sl0 → stepf(sl0[n0], al[n0], (sl0 + a ')[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:append-from-le, seq: ⊦ n ≤ # x → x + y from n = (x from n) + y, subst:[n, y, x] → [n + 1, a ', sl0], <all paths>

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, a ', sl0

Proof step 75 from proof moveone-splitstep (previous step) (back to tree)

⊦ n ≤ # x → x + y from n = (x from n) + y

A spec-lemma

Proof step 76 from proof moveone-splitstep (previous step) (back to tree)

# al + 1 = # sl, ⌜al⌝ ^ = ⌜a '⌝ , al[n] ≠ τ, a ≠ τ, al ≠ (al to n + 1) + (al from n + 1), al ≠ [], n < # al, ∀ n0. n0 < # al → stepf(sl[n0], al[n0], sl[n0 + 1]) ⊦ move(IOAut(startf, stepf))(sl[0], [], sl[n]) ∧ stepf(sl[n], a, sl[n + 1]) ∧ move(IOAut(startf, stepf))(sl[n + 1], [], sl.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-plus-from-fin, seq: ⊦ n ≤ # x → (x to n) + (x from n) = x, subst:[n, x] → [n + 1, al], <all paths>

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, al

Proof step 77 from proof moveone-splitstep (previous step) (back to tree)

⊦ n ≤ # x → (x to n) + (x from n) = x

A spec-lemma

Proof Tree for moveone-splitstep (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