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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ cs. ∃ cs0, a. (∃ a1, cs1. cstepf(cs, a1, cs1)) → cstepf(cs, a, cs0)

Additional information

Used formulas: ∀ cs. ∃ cs0, a. (∃ a1, cs1. cstepf(cs, a1, cs1)) → cstepf(cs, a, cs0)

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

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

User applied rule choice left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

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

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

Additional information

Used formulas: ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

Additional information

Used formulas: ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: right 1

Additional information

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1))) ⊦ ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1, ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ to n abort: F discard: T computed: F

Additional information

Used terms: ⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1, ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ to n

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), cs = (⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1)[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1, ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ to n) ∧ (finp(⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1) → ¬(∃ a, cs0. cstepf((⌜λ n. ((nextcs ^^ n))(cs)⌝ to n + 1).l.last, a, cs0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: iteratest-base: ⊦ ((nextcs ^^ 0))(cs) = cs; ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ finp(⌜nf to n⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

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

∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), cfrag(CIOAut(cstartf, cstepf))(⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ , ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ ) ∧ ¬ cstepf(((λ n. ((nextcs ^^ n))(cs)) to n + 1).last, a, cs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

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

¬ cfrag(CIOAut(cstartf, cstepf))(⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ , ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ ), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

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] → [⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ , ⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ , ⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ , cstepf, cstartf

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

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

A spec-lemma

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

∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), # ⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ ≠ # ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ + ⌜1⌝ ∨ (∃ n0. ¬ ( ⌜n0⌝ < # ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ → cstepf (⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ [n0], ⌜(λ n. nexta(((nextcs ^^ n))(cs))) to n⌝ [n0], ⌜(λ n. ((nextcs ^^ n))(cs)) to n + 1⌝ [n0 +1]))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: iteratest-rec: ⊦ ((nextcs ^^ (n + 1)))(cs) = nextcs(((nextcs ^^ n))(cs)); ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s)

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

n0 < n, ¬ cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

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

n0 < n, ¬ cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), n0 < n → (∃ a1, cs1. cstepf(((nextcs ^^ n0))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

n0 < n, cstepf(((nextcs ^^ n0))(cs), a1, cs1), ¬ cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: ((nextcs ^^ n0))(cs) abort: F discard: T computed: T

Additional information

Used terms: ((nextcs ^^ n0))(cs)

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

n0 < n, cstepf(((nextcs ^^ n0))(cs), a1, cs1), ¬ cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), (∃ a1, cs1. cstepf(((nextcs ^^ n0))(cs), a1, cs1)) → cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

n0 < n, cstepf(((nextcs ^^ n0))(cs), a1, cs1), ¬ cstepf(((nextcs ^^ n0))(cs), nexta(((nextcs ^^ n0))(cs)), nextcs(((nextcs ^^ n0))(cs))), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ a1, cs1. cstepf(((nextcs ^^ n0))(cs), a1, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: a1, cs1

Additional information

Used terms: a1, cs1

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

cstepf(((λ n. ((nextcs ^^ n))(cs)) to n + 1).last, a, cs0), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

cstepf(((λ n. ((nextcs ^^ n))(cs)) to n + 1).last, a, cs0), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:to-unwind-end-inf, seq: ⊦ nf to m + 1 = (nf to m) + nf(m) ', subst:[m, nf] → [n, λ n. ((nextcs ^^ n))(cs)], <all paths>

Additional information

Used terms: n, λ n. ((nextcs ^^ n))(cs)

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

⊦ nf to m + 1 = (nf to m) + nf(m) '

A spec-lemma

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

cstepf((((λ n. ((nextcs ^^ n))(cs)) to n) + ((nextcs ^^ n))(cs) ').last, a, cs0), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

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 + a ').last = a; (s)

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

cstepf(((nextcs ^^ n))(cs), a, cs0), ∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: a, cs0

Additional information

Used terms: a, cs0

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1))), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1

Additional information

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

⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

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 28 from proof maxfrag-exists (previous step) (back to tree)

∀ n1, cstepf, nextcs, cs, cstartf. n1 < n → true → (∃ a1, cs1. cstepf(((nextcs ^^ n1))(cs), a1, cs1)) ∨ (∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))) ∨ (∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

∀ n1, cstepf, nextcs, cs, cstartf. n1 < n → true → (∃ a1, cs1. cstepf(((nextcs ^^ n1))(cs), a1, cs1)) ∨ (∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))) ∨ (∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1))), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

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 30 from proof maxfrag-exists (previous step) (back to tree)

∀ n1, cstepf, nextcs, cs, cstartf. n1 < n → true → (∃ a1, cs1. cstepf(((nextcs ^^ n1))(cs), a1, cs1)) ∨ (∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))) ∨ (∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1))), ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

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 31 from proof maxfrag-exists (previous step) (back to tree)

n0 < n, ∀ n1, cstepf, nextcs, cs, cstartf. n1 < n → true → (∃ a1, cs1. cstepf(((nextcs ^^ n1))(cs), a1, cs1)) ∨ (∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))) ∨ (∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n0))(cs), a1, cs1), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1), ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))), ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) ∧ (∀ m. m < n → (∃ a1, cs1. cstepf(((nextcs ^^ m))(cs), a1, cs1)))

User applied rule apply induction

And closed the goal!

Rule argument

subst: [n1, cstepf, nextcs, cs, cstartf] → [n0, cstepf, nextcs, cs, cstartf]

Additional information

Used terms: n0, cstepf, nextcs, cs, cstartf

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 2 terms: ⌜λ n. ((nextcs ^^ n))(cs)⌝ , ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜λ n. ((nextcs ^^ n))(cs)⌝ , ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)), cs = ⌜λ n. ((nextcs ^^ n))(cs)⌝ [0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜λ n. ((nextcs ^^ n))(cs)⌝ , ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ ) ∧ (finp(⌜λ n. ((nextcs ^^ n))(cs)⌝ ) → ¬(∃ a, cs0. cstepf(⌜λ n. ((nextcs ^^ n))(cs)⌝ .l.last, a, cs0)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: iteratest-base: ⊦ ((nextcs ^^ 0))(cs) = cs; ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)

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

¬ cfrag(CIOAut(cstartf, cstepf))(⌜λ n. ((nextcs ^^ n))(cs)⌝ , ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ ), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

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] → [⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ , ⌜λ n. ((nextcs ^^ n))(cs)⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ , ⌜λ n. ((nextcs ^^ n))(cs)⌝ , cstepf, cstartf

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

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

A spec-lemma

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

∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)), # ⌜λ n. ((nextcs ^^ n))(cs)⌝ ≠ # ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ → cstepf(⌜λ n. ((nextcs ^^ n))(cs)⌝ [n], ⌜λ n. nexta(((nextcs ^^ n))(cs))⌝ [n], ⌜λ n. ((nextcs ^^ n))(cs)⌝ [n +1]))) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: iteratest-rec: ⊦ ((nextcs ^^ (n + 1)))(cs) = nextcs(((nextcs ^^ n))(cs)); c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜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⌝ = ∞; (s)

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

¬ cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))), ∀ cs0. (∃ a1, cs1. cstepf(cs0, a1, cs1)) → cstepf(cs0, nexta(cs0), nextcs(cs0)) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: ((nextcs ^^ n))(cs) abort: F discard: T computed: T

Additional information

Used terms: ((nextcs ^^ n))(cs)

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

¬ cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))), (∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)) → cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

¬ cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))) ⊦ ∃ n. ¬(∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

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

¬ cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))), ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

cstepf(((nextcs ^^ n))(cs), a1, cs1), ¬ cstepf(((nextcs ^^ n))(cs), nexta(((nextcs ^^ n))(cs)), nextcs(((nextcs ^^ n))(cs))) ⊦ ∃ a1, cs1. cstepf(((nextcs ^^ n))(cs), a1, cs1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: a1, cs1

Additional information

Used terms: a1, cs1

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: cs1, a1

Additional information

Used terms: cs1, a1

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