[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 cstepdet-maxfrag-unique (conclusion) (back to tree)

∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cσ[0] = cσ0[0], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

Additional information

Used formulas: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

Proof step 4 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

Additional information

Used formulas: ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

Proof step 6 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 6, left 7

Additional information

Proof step 8 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ0, ⌜n0⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. m < n0 → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: n0

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 9 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], n0 = n1 +1, cσ[n] ≠ cσ0[n], cσ[n0] ≠ cσ0[n0], ⌜n0⌝ < # cσ, ⌜n0⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n0 → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

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 + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 10 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α0, cσ0, cstepf, cstartf], <all paths>

Additional information

Used terms: α0, cσ0, cstepf, cstartf

Proof step 11 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 12 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ + ⌜1⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 13 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 14 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: n1 abort: F discard: T computed: T

Additional information

Used terms: n1

Proof step 15 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α0 → cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ + ⌜1⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α, cσ, cstepf, cstartf], <all paths>

Additional information

Used terms: α, cσ, cstepf, cstartf

Proof step 17 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 18 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ + ⌜1⌝ < # cσ, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: n1 abort: F discard: T computed: T

Additional information

Used terms: n1

Proof step 20 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m. ¬ n1 < m → cσ[m] = cσ0[m] ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. ¬ n1 < m → cσ[m] = cσ0[m], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: n1 abort: F discard: T computed: T

Additional information

Used terms: n1

Proof step 22 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α, ⌜n1⌝ < # α0, cstepf(cσ[n1], α[n1], cσ[n1 + 1]), cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ n1 < n1 → cσ[n1] = cσ0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < n; (s)

Proof step 23 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n1] = cσ0[n1], cσ[n] ≠ cσ0[n], cσ[n1 + 1] ≠ cσ0[n1 + 1], ⌜n1⌝ < # α0, ⌜n1⌝ < # α, cstepf(cσ0[n1], α0[n1], cσ0[n1 + 1]), cstepf(cσ0[n1], α[n1], cσ[n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: cσ0[n1], α[n1], α0[n1], cσ[n1 + 1], cσ0[n1 + 1]

Additional information

Used terms: cσ0[n1], α[n1], α0[n1], cσ[n1 + 1], cσ0[n1 + 1]

Proof step 24 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 8, right 1

Additional information

Proof step 25 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

User applied rule induction

And obtained the following new goals

Rule argument

indvar: n wfpred: <

Additional information

Used simplifier rules: <; (wellfounded) Used terms: n

Proof step 26 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: n abort: F discard: F computed: T

Additional information

Used terms: n

Proof step 28 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 29 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [n1, cσ, cσ0, cstartf, cstepf, α, α0] → [n0, cσ, cσ0, cstartf, cstepf, α, α0]

Additional information

Used simplifier rules: lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → ¬ n < m; (s) Used terms: n0, cσ, cσ0, cstartf, cstepf, α, α0

Proof step 30 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], ⌜n⌝ < # cσ0, ⌜n⌝ < # cσ, n0 < n, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m]), ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 31 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n0] ≠ cσ0[n0], cσ[n] ≠ cσ0[n], cσ[n1] ≠ cσ0[n1], ⌜n1⌝ < # cσ, ⌜n1⌝ < # cσ0, n0 < n, ⌜n⌝ < # cσ, ⌜n⌝ < # cσ0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m. m < n1 → cσ[m] = cσ0[m], ∀ n1, cσ, cσ0, cstartf, cstepf, α, α0. n1 < n → cσ[0] = cσ0[0] ∧ cσ[n1] ≠ cσ0[n1] ∧ ⌜n1⌝ < # cσ ∧ ⌜n1⌝ < # cσ0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) → (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n] ∧ (∀ m. m < n → cσ[m] = cσ0[m])

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n1 abort: F discard: T computed: T

Additional information

Used terms: n1

Proof step 32 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n]

Additional information

Used formulas: ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n]

Proof step 33 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 34 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: finp(cσ0)

Additional information

Used formulas: finp(cσ0)

Proof step 35 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream]

Proof step 36 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α0

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)

Proof step 37 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], α0 = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 38 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ cσ1, α1. ⌜csl⌝ + cσ1 = cσ ∧ ⌜al0⌝ + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: cσ from # csl, α from # al0 abort: F discard: T computed: F

Additional information

Used terms: cσ from # csl, α from # al0

Proof step 39 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜csl⌝ + (cσ from # csl) = cσ ∧ ⌜al0⌝ + (α from # al0) = α

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [cσ, ⌜csl⌝ + (cσ from # csl)], <all paths>

Additional information

Used terms: cσ, ⌜csl⌝ + (cσ from # csl)

Proof step 40 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 41 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (#(⌜csl⌝ + (cσ from # csl)) = # cσ ∧ (∀ n. ⌜n⌝ < #(⌜csl⌝ + (cσ from # csl)) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n])) ∧ ⌜al0⌝ + (α from # al0) = α

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[traceC-IOstatestream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 42 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜al0⌝ + (α from # al0) = α

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] → [α, ⌜al0⌝ + (α from # al0)], <all paths>

Additional information

Used terms: α, ⌜al0⌝ + (α from # al0)

Proof step 43 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 44 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ #(⌜al0⌝ + (α from # al0)) = # α ∧ (∀ n. ⌜n⌝ < #(⌜al0⌝ + (α from # al0)) → (⌜al0⌝ + (α from # al0))[n] = α[n])

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] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 45 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜# csl⌝ + #(cσ from # csl) = # cσ

Additional information

Used formulas: ⌜# csl⌝ + #(cσ from # csl) = # cσ

Proof step 46 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 47 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜# al0⌝ + #(α from # al0) = # α

Additional information

Used formulas: ⌜# al0⌝ + #(α from # al0) = # α

Proof step 48 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 49 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n, cσ from # csl, ⌜csl⌝ ], <all paths>

Additional information

Used terms: n, cσ from # csl, ⌜csl⌝

Proof step 50 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 51 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 52 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[m, σ1, σ] → [n, cσ from # csl, ⌜csl⌝ ], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: n, cσ from # csl, ⌜csl⌝

Proof step 53 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 54 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, ¬ ⌜n⌝ < # ⌜csl⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - (# ⌜csl⌝ ).n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ .n = n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)

Proof step 55 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n - # csl] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

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] → [n, # csl, n1]

Additional information

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

Proof step 56 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], n = n1 + # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), # csl ≤ n, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (cσ from # csl)[n1] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m ≤ m + n; (s)

Proof step 57 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n0, α from # al0, ⌜al0⌝ ], <all paths>

Additional information

Used terms: n0, α from # al0, ⌜al0⌝

Proof step 58 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 59 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)

Proof step 60 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic elimination 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] → [n0, # al0, n1]

Additional information

Used simplifier rules: ⊦ m ≤ m + n; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # al0, n1

Proof step 61 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

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 62 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: n0

Additional information

Used terms: n0

Proof step 63 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = csl[0], ⌜n⌝ < # ⌜csl⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → ⌜csl⌝ [n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 64 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, cσ[0] = hd(csl), csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl, cs2, csl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y

Proof step 65 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, ⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = cs2, csl = cs2 + csl0, csl ≠ [], n < # csl, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → csl[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 66 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1], (⌜n⌝ < # cσ → (cσ[0] ' + csl0)[n] = cσ[n]) ∧ (⌜n0⌝ < # α → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Proof step 67 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 68 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (cσ[0] ' + csl0)[n] ≠ cσ[n], ⌜n⌝ < # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n

Additional information

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

Proof step 69 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 70 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n0, α from # al0, ⌜al0⌝ ], <all paths>

Additional information

Used terms: n0, α from # al0, ⌜al0⌝

Proof step 71 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 72 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, (⌜al0⌝ + (α from # al0))[n0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, ¬ ⌜n0⌝ < # ⌜al0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)

Proof step 73 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# al0⌝ + #(α from # al0) = # α, (⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, (α from # al0)[n0 - # al0] ≠ α[n0], ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), n ≤ # csl0, # al0 ≤ n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1] ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

Heuristic elimination 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] → [n0, # al0, n2]

Additional information

Used simplifier rules: ⊦ m ≤ m + n; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, # al0, n2

Proof step 74 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, ⌜al0⌝ [n0] ≠ α[n0], ⌜n0⌝ < # α, ⌜n0⌝ < # ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

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 75 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

(⌜# csl0⌝ + ⌜1⌝ ) + #(cσ from # csl0 + 1) = # cσ, ⌜# al0⌝ + #(α from # al0) = # α, al0[n0] ≠ α[n0], al0 ≠ [], n0 < # al0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜cσ[0] '⌝ + ⌜csl0⌝ , ⌜al0⌝ ), n ≤ # csl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al0 → ⌜n1⌝ < # α ∧ cσ[n1] = (cσ[0] ' + csl0)[n1] ∧ α[n1] = al0[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n1. ⌜n1⌝ < # cσ ∧ ¬ # csl0 < n1 ∧ cσ[n1] ≠ (cσ[0] ' + csl0)[n1]

User applied rule all left

And closed the goal!

Rule argument

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

Additional information

Used terms: n0

Proof step 76 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], (⌜n⌝ < # cσ → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 77 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cσ

Additional information

Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 78 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 79 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 80 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 81 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl + #(csl0 from # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:length-from, seq:¬ # x < n ⊦ #(x from n) = # x - n, subst:[n, x] → [# csl, csl0], <all paths>

Additional information

Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: # csl, csl0

Proof step 82 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

¬ # x < n ⊦ #(x from n) = # x - n

A spec-lemma

Proof step 83 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl + (# csl0 - # csl) = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), ¬ # csl0 < # csl, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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 n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 84 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf

Proof step 85 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 86 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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 87 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al1⌝ , ⌜csl0⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al1⌝ , ⌜csl0⌝ , cstepf, cstartf

Proof step 88 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 89 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# ⌜csl0⌝ = # ⌜al1⌝ + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al1⌝ → cstepf(⌜csl0⌝ [n], ⌜al1⌝ [n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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 90 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # al0 + #(al1 from # al0) ≠ # al1, # csl ≤ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 2, flags: rotate, discard

Additional information

Used simplifier rules: ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m = n + 1 → ¬ m ≤ n; (s) n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 91 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

⌜# csl⌝ + #(cσ from # csl) = # cσ, cσ[0] = csl[0], cσ = ⌜csf0⌝ , ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 92 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csl[0], ⌜# al0⌝ + #(α from # al0) ≠ # α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csf0(n) = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. n < # csl ∧ csf0(n) ≠ csl[n]

User applied rule constructor cut

And closed the goal!

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 93 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n], ⌜# csl⌝ + #(cσ from # csl) = # cσ ∧ (⌜n⌝ < ⌜# csl⌝ + #(cσ from # csl) → (⌜csl⌝ + (cσ from # csl))[n] = cσ[n]) ∧ ⌜# al0⌝ + #(α from # al0) = # α ∧ (⌜n0⌝ < ⌜# al0⌝ + #(α from # al0) → (⌜al0⌝ + (α from # al0))[n0] = α[n0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 94 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cσ

Additional information

Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 95 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csl[0], cσ = ⌜csl0⌝ , ⌜# csl⌝ + #(cσ from # csl) ≠ # cσ, cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ cσ[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ n < # csl ∧ cσ[n] ≠ csl[n]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 96 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n] ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al0⌝ , ⌜csl⌝ , cstepf, cstartf

Proof step 97 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 98 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# ⌜csl⌝ = # ⌜al0⌝ + ⌜1⌝ , csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # ⌜al0⌝ → cstepf(⌜csl⌝ [n], ⌜al0⌝ [n], ⌜csl⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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 99 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α, ⌜csl0⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: α, ⌜csl0⌝ , cstepf, cstartf

Proof step 100 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 101 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# ⌜csl0⌝ = # α + ⌜1⌝ , # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(⌜csl0⌝ [n], α[n], ⌜csl0⌝ [n +1]) ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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⌝ = ⌜# x⌝ ; (s)

Proof step 102 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, csl0[0] = csl[0], ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s)

Proof step 103 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, csl0[0] = csl[0], α = ⌜al1⌝ , ⌜# csl0⌝ = # α + ⌜1⌝ , # csl + #(csl0 from # csl) ≠ # csl0, ∀ n. ⌜n⌝ < # α → cstepf(csl0[n], α[n], csl0[n + 1]), ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → ⌜n⌝ < # α ∧ csl0[n] = csl[n] ∧ α[n] = al0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 104 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:length-from, seq:¬ # x < n ⊦ #(x from n) = # x - n, subst:[n, x] → [# csl, csl0], <all paths>

Additional information

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

Proof step 105 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

¬ # x < n ⊦ #(x from n) = # x - n

A spec-lemma

Proof step 106 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = csl[0], # csl + #(csl0 from # csl) ≠ # csl0, # csl0 < # csl, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

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

Proof step 107 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al1 + 1 = # csl0, # al0 + 1 = # csl, csl0[0] = hd(csl), # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n], ∃ a, cs0. cstepf(csl0.last, a, cs0)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl, cs2, csl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y

Proof step 108 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 + 1 = # csl, # al1 + 1 = # csl0, csl0[0] = cs2, csl = cs2 + csl1, # csl + #(csl0 from # csl) ≠ # csl0, csl ≠ [], # csl0 < # csl, # csl0 ≤ # al0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 → cstepf(csl[n], al0[n], csl[n + 1]), ∀ n. n < # al0 → n < # al1 ∧ csl0[n] = csl[n] ∧ al1[n] = al0[n], ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ n < # csl ∧ csl0[n] ≠ csl[n]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)

Proof step 109 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# al0 = # csl1, # al1 + 1 = # csl0, (# csl1 + 1) + #(csl0 from # csl1 + 1) ≠ # csl0, # csl0 ≤ # csl1, ∀ n. n < # al1 → cstepf(csl0[n], al1[n], csl0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # csl1 → n < # al1 ∧ csl0[n] = (csl0[0] ' + csl1)[n] ∧ al1[n] = al0[n], ∀ n. n < # csl1 → cstepf((csl0[0] ' + csl1)[n], al0[n], csl1[n]) ⊦ ∃ a, cs0. cstepf(csl0.last, a, cs0), ∃ n. n < # csl0 ∧ ¬ # csl1 < n ∧ csl0[n] ≠ (csl0[0] ' + csl1)[n]

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: # al1

Additional information

Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al1

Proof step 110 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), ¬ finp(cσ0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)

Proof step 111 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: finp(cσ)

Additional information

Used formulas: finp(cσ)

Proof step 112 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream]

Proof step 113 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)

Proof step 114 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl[0] = csf(0), α = ⌜al0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csl[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 115 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n] ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α0

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 116 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl[0] = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ csl[n] ≠ csf(n)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 117 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csl[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al0 ∧ csl[n] = csf(n) ∧ al0[n] = af0(n) ⊦ ∃ n. n < # csl ∧ csl[n] ≠ csf(n), ∃ a, cs0. cstepf(csl.last, a, cs0)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: # al0

Additional information

Used simplifier rules: ⊦ ¬ n < n; (s) Used terms: # al0

Proof step 118 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = csf(0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ¬ finp(cσ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ cσ[n] ≠ csf(n), ⌜csf⌝ = cσ ∧ (∃ α1. α0 + α1 = α)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)

Proof step 119 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n), csf = csf0 ∧ (∃ α1. α0 + α1 = α)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Proof step 120 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), csf ≠ csf0, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 121 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), csf(n) ≠ csf0(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ n. csf0(n) ≠ csf(n)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n

Additional information

Used terms: n

Proof step 122 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n), ∃ α1. α0 + α1 = α

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α0

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 123 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), α0 = ⌜af0⌝ , cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , α0), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = α0[n] ⊦ ∃ α1. α0 + α1 = α, ∃ n. csf0(n) ≠ csf(n)

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] ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 124 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 125 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), α = ⌜af1⌝ , ⌜af0⌝ ≠ α, cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , α), ∀ n. ⌜n⌝ < # α ∧ csf0(n) = csf(n) ∧ α[n] = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s)

Proof step 126 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), af0 ≠ af1, cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n) ⊦ ∃ n. csf0(n) ≠ csf(n)

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 127 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

csf0(0) = csf(0), af0(n) ≠ af1(n), cfrag(CIOAut(cstartf, cstepf))(⌜csf⌝ , ⌜af0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csf0⌝ , ⌜af1⌝ ), ∀ n. csf0(n) = csf(n) ∧ af1(n) = af0(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. csf0(n) ≠ csf(n)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: n

Additional information

Used terms: n

Proof step 128 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∀ n. ⌜n⌝ < # α0 → ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n], ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 129 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], ⌜n⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n⌝ < # α ∧ cσ[n] = cσ0[n] ∧ α[n] = α0[n]

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 130 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], ⌜0⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜0⌝ < # α ∧ cσ[0] = cσ0[0] ∧ α[0] = α0[0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 131 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α0, cσ0, cstepf, cstartf], <all paths>

Additional information

Used terms: α0, cσ0, cstepf, cstartf

Proof step 132 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 133 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 134 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α, cσ, cstepf, cstartf], <all paths>

Additional information

Used terms: α, cσ, cstepf, cstartf

Proof step 135 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 136 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 137 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0

Proof step 138 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α0 → cstepf(cσ0[0], α0[0], cσ0[0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

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 ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 139 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0

Proof step 140 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # α → cstepf(cσ[0], α[0], cσ[0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

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 ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 141 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], α ≠ [] ∧ α[0] = α0[0]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α ≠ []

Additional information

Used formulas: α ≠ []

Proof step 142 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 143 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α0 ≠ []

Additional information

Used formulas: α0 ≠ []

Proof step 144 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α[0], cσ[1]), cstepf(cσ0[0], α0[0], cσ0[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 145 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], α[0] ≠ α0[0], α ≠ [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: cσ0[0], α[0], α0[0], cσ[1], cσ0[1]

Additional information

Used terms: cσ0[0], α[0], α0[0], cσ[1], cσ0[1]

Proof step 146 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], α = [], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), α ≠ [] → cstepf(cσ0[0], α[0], cσ[1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, α ≠ [] ∧ α[0] = α0[0]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # [] = ⌜0⌝ ; (s)

Proof step 147 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl = 1, # cσ0 = # α0 + ⌜1⌝ , csl[0] = cσ0[0], α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = [], ∃ a, cs0. cstepf(csl.last, a, cs0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ # [] = 0; (s)

Proof step 148 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # csl = 1, csl[0] = cσ0[0], csl = cs0 + csl0, α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = []

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[traceC-IOstatestream] ⊦ σ + [] = σ; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ x + [] = x; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ (a ' + x)[0] = a; (s)

Proof step 149 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , α0 ≠ [], cstepf(cσ0[0], α0[0], cσ0[1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs. cstepf(cσ0[0], a, cs), ∃ cσ1, α1. cσ0 + cσ1 = ⌜cσ0[0] '⌝ ∧ α0 + α1 = []

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: α0[0], cσ0[1]

Additional information

Used terms: α0[0], cσ0[1]

Proof step 150 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], ⌜n0 +1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0] ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0 +1⌝ < # α ∧ cσ[n0 +1] = cσ0[n0 +1] ∧ α[n0 +1] = α0[n0 +1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 151 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cσ, cσ0, α0, cstartf, cstepf, α. cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: cσ, cσ0, α0, cstartf, cstepf, α abort: F discard: T computed: T

Additional information

Used terms: cσ, cσ0, α0, cstartf, cstepf, α

Proof step 152 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cσ[0] = cσ0[0] ∧ ⌜n0⌝ < # α0 ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α0) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α) ∨ (∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n]) ∨ ⌜n0⌝ < # α ∧ cσ[n0] = cσ0[n0] ∧ α[n0] = α0[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf

Proof step 153 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ0, α0), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α0, cσ0, cstepf, cstartf], <all paths>

Additional information

Used terms: α0, cσ0, cstepf, cstartf

Proof step 154 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 155 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 156 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cfrag(CIOAut(cstartf, cstepf))(cσ, α), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[restrictedC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α, cσ, cstepf, cstartf], <all paths>

Additional information

Used terms: α, cσ, cstepf, cstartf

Proof step 157 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

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

A spec-lemma

Proof step 158 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 159 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 160 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 161 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 162 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ < # α0 → cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 163 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: cσ0[n0], α0[n0], α0[n0], cσ[n0 + 1], cσ0[n0 + 1] abort: F discard: F computed: T

Additional information

Used terms: cσ0[n0], α0[n0], α0[n0], cσ[n0 + 1], cσ0[n0 + 1]

Proof step 164 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cstepf(cσ0[n0], α0[n0], cσ[n0 + 1]) ∧ cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]) → α0[n0] = α0[n0] ∧ cσ[n0 + 1] = cσ0[n0 + 1], ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ cσ[n0 + 1] = cσ0[n0 + 1] ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 165 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → cstepf(cσ0[n], α0[n], cσ0[n + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0 + 1

Proof step 166 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α0 → cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[(n0 + 1) + 1]), ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

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 + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 167 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]) ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0 + 1

Proof step 168 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0 + 1⌝ < # α → cstepf(cσ[n0 + 1], α[n0 + 1], cσ[(n0 + 1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

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 + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 169 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜n0⌝ + ⌜1⌝ < # α

Additional information

Used formulas: ⌜n0⌝ + ⌜1⌝ < # α

Proof step 170 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 171 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , cσ[0] = cσ0[0], cσ[n0] = cσ0[n0], α[n0] = α0[n0], cσ[n0 + 1] = cσ0[n0 + 1], α[n0 + 1] ≠ α0[n0 + 1], ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, ⌜n0⌝ < # α, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 16 terms: cσ0[n0 + 1], α[n0 + 1], α0[n0 + 1], cσ[2 + n0], cσ0[2 + n0]

Additional information

Used terms: cσ0[n0 + 1], α[n0 + 1], α0[n0 + 1], cσ[2 + n0], cσ0[2 + n0]

Proof step 172 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ = # α + ⌜1⌝ , # cσ0 = # α0 + ⌜1⌝ , cσ[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], cσ[n0] = cσ0[n0], cσ[0] = cσ0[0], ⌜n0⌝ < # α, ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ¬ ⌜n0⌝ + ⌜1⌝ < # α, ⌜n0⌝ + ⌜1⌝ < # α → cstepf(cσ0[n0 + 1], α[n0 + 1], cσ[2 + n0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = cσ ∧ α0 + α1 = α, ∃ n. ⌜n⌝ < # cσ ∧ ⌜n⌝ < # cσ0 ∧ cσ[n] ≠ cσ0[n], ⌜n0⌝ + ⌜1⌝ < # α ∧ α[n0 + 1] = α0[n0 + 1]

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞ = ⌜m⌝ + ⌜n⌝ → (n∞ = ∞ ↔ false); (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ¬ n < n; (s) ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss)

Proof step 173 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[n0 + 1] = cσ0[n0 + 1], α[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], ⌜# csl⌝ = # α + ⌜1⌝ , ⌜n0⌝ < # α0, # α < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α, ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(csl.last, a, cs0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s)

Proof step 174 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , ⌜n0⌝ + ⌜1⌝ = # α, csl[0] = cσ0[0], csl[n0] = cσ0[n0], α[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], α = ⌜al0⌝ , ⌜# csl⌝ = # α + ⌜1⌝ , # α < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < # csl ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = α

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⌝ + ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 175 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, 2 + n0 = # csl, csl[0] = cσ0[0], csl[n0] = cσ0[n0], al0[n0] = α0[n0], csl[n0 + 1] = cσ0[n0 + 1], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 176 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , 2 + n0 = # csl, n0 + 1 = # al0, csl[n0 + 1] = cσ0[n0 + 1], al0[n0] = α0[n0], csl[n0] = cσ0[n0], csl[0] = cσ0[0], csl = csl0 + cs2 ', csl ≠ [], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ csl[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cs2, a, cs0)

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[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s) ⊦ n = # x → (x + a ')[n] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ x ≠ [] → x[0] = hd(x); (s)

Proof step 177 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# cσ0 = # α0 + ⌜1⌝ , # csl0 = n0 + 1, n0 + 1 = # al0, al0[n0] = α0[n0], (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], hd(csl0 + cσ0[n0 + 1] ') = cσ0[0], ⌜n0⌝ + ⌜1⌝ < # α0, ⌜n0⌝ < # α0, cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝ , ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl0 + cσ0[n0 + 1] ', cs2, csl]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl0 + cσ0[n0 + 1] ', cs2, y

Proof step 178 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , n0 + 1 = # al0, csl0 + cσ0[n0 + 1] ' = cs2 + csl, (csl0 + cσ0[n0 + 1] ')[n0] = cσ0[n0], al0[n0] = α0[n0], cs2 = cσ0[0], csl0 + cσ0[n0 + 1] ' ≠ [], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (csl0 + cσ0[n0 + 1] ')[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝

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[traceC-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 179 from proof cstepdet-maxfrag-unique (previous step) (back to tree)

# csl0 = n0 + 1, # cσ0 = # α0 + ⌜1⌝ , csl0 + cσ0[n0 + 1] ' = cσ0[0] ' + csl, n0 + 1 = # al0, (cσ0[0] ' + csl)[n0] = cσ0[n0], al0[n0] = α0[n0], ⌜n0⌝ < # α0, ⌜n0⌝ + ⌜1⌝ < # α0, cstepf(cσ0[n0], α0[n0], cσ0[n0 + 1]), cstepf(cσ0[n0 + 1], α0[n0 + 1], cσ0[2 + n0]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cσ0[n0 + 1] = cσ0[0] ∨ cσ0[n0 + 1] ∈ csl, cσ0[0] ∈ csl0 ∨ cσ0[0] = cσ0[n0 + 1] ⊦ ∃ a, cs0. cstepf(cσ0[n0 + 1], a, cs0), ∃ n. n < 2 + n0 ∧ ⌜n⌝ < # cσ0 ∧ (cσ0[0] ' + csl)[n] ≠ cσ0[n], ∃ cσ1, α1. cσ0 + cσ1 = ⌜csl0⌝ + ⌜cσ0[n0 + 1] '⌝ ∧ α0 + α1 = ⌜al0⌝

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: α0[n0 + 1], cσ0[2 + n0]

Additional information

Used terms: α0[n0 + 1], cσ0[2 + n0]

Proof Tree for cstepdet-maxfrag-unique (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