[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 bwinv-leqstar (conclusion) (back to tree)

≤BI(cioaut, aioaut) ⊦ C_≤*T_A(cioaut, aioaut)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof bwinv-leqstar (previous step) (back to tree)

≤BI(cioaut, aioaut), ¬ C_≤*T_A(cioaut, aioaut) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: cioaut

Additional information

Used simplifier rules: CIOAutomaton freely generated by CIOAut;;

Proof step 3 from proof bwinv-leqstar (previous step) (back to tree)

cioaut = CIOAut(cstartf, cstepf), ≤BI(cioaut, aioaut), ¬ C_≤*T_A(cioaut, aioaut) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 4 from proof bwinv-leqstar (previous step) (back to tree)

≤BI(CIOAut(cstartf, cstepf), aioaut), ¬ C_≤*T_A(CIOAut(cstartf, cstepf), aioaut) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: aioaut

Additional information

Used simplifier rules: AIOAutomaton freely generated by AIOAut;;

Proof step 5 from proof bwinv-leqstar (previous step) (back to tree)

aioaut = AIOAut(astartf, astepf), ≤BI(CIOAut(cstartf, cstepf), aioaut), ¬ C_≤*T_A(CIOAut(cstartf, cstepf), aioaut) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 6 from proof bwinv-leqstar (previous step) (back to tree)

≤BI(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV, name:backwardsiminv-def, seq: ⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV)), subst:[aioaut, cioaut] → [AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)], <all paths>

Additional information

Used terms: AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)

Proof step 7 from proof bwinv-leqstar (previous step) (back to tree)

⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV))

A spec-lemma

Proof step 8 from proof bwinv-leqstar (previous step) (back to tree)

¬ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∃ t, aINV, cINV. bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof bwinv-leqstar (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), ¬ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def, name:leqstar-def, seq:⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)), subst:[astepf, astartf, cstepf, cstartf] → [astepf, astartf, cstepf, cstartf], <all paths>

Additional information

Used terms: astepf, astartf, cstepf, cstartf

Proof step 10 from proof bwinv-leqstar (previous step) (back to tree)

⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α))

A spec-lemma

Proof step 11 from proof bwinv-leqstar (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), ∃ α. ¬(ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ atrace*(AIOAut(startf, stepf))(α) ↔ atrace(AIOAut(startf, stepf))(α) ∧ finp(α); (s) ⊦ ctrace*(CIOAut(startf, stepf))(α) ↔ ctrace(CIOAut(startf, stepf))(α) ∧ finp(α); (s)

Proof step 12 from proof bwinv-leqstar (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), ctrace(CIOAut(cstartf, cstepf))(⌜al⌝ ), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:trace, seq:⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: ⌜al⌝ , cstepf, cstartf

Proof step 13 from proof bwinv-leqstar (previous step) (back to tree)

⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 14 from proof bwinv-leqstar (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∃ σ, β. ⌜al⌝ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 15 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-to-strong, seq: ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^), subst:[α, n] → [α, # al]

Additional information

Used terms: α, # al

Proof step 16 from proof bwinv-leqstar (previous step) (back to tree)

⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)

A spec-lemma

Proof step 17 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ # α ^ < ⌜# al⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to # al = (α to m)^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 18 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: cexec(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m)

Additional information

Used formulas: cexec(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m)

Proof step 19 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cexec(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 20 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:preserve-INV, seq:cfrag(CIOAut(startf, stepf))(σ, α), startf(σ[0]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦ ∀ n. ⌜n⌝ < # σ → iNV(σ[n]), subst:[α, stepf, iNV, startf, σ] → [α, cstepf, cstartf0, cstartf, cσ]

Additional information

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

Proof step 21 from proof bwinv-leqstar (previous step) (back to tree)

cfrag(CIOAut(startf, stepf))(σ, α), startf(σ[0]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦ ∀ n. ⌜n⌝ < # σ → iNV(σ[n])

A spec-lemma

Proof step 22 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦ (∀ s. cstartf(s) → cstartf0(s)) ∧ (∀ s, a, s0. cstartf0(s) ∧ cstepf(s, a, s0) → cstartf0(s0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦ (cstartf(cs) → cstartf0(cs)) ∧ (cstartf0(cs0) ∧ cstepf(cs0, a, cs1) → cstartf0(cs1))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV, name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, aINV, t, cINV, astepf] → [cstartf, cstepf, astartf, astartf0, t, cstartf0, astepf], <all paths>

Additional information

Used terms: astartf0, cstartf0, t, astepf, astartf, cstepf, cstartf

Proof step 24 from proof bwinv-leqstar (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

A spec-lemma

Proof step 25 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ (cstartf(cs) → cstartf0(cs)) ∧ (cstartf0(cs0) ∧ cstepf(cs0, a, cs1) → cstartf0(cs1))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 26 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦ (cstartf(cs) → cstartf0(cs)) ∧ (cstartf0(cs0) ∧ cstepf(cs0, a, cs1) → cstartf0(cs1))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 27 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cs), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf0(cs), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 28 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf(cs), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf0(cs), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 17 terms: cs

Additional information

Used terms: cs

Proof step 29 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cs0), cstepf(cs0, a, cs1), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf0(cs1), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cs0), cstepf(cs0, a, cs1), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf0(cs1), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 16 terms: cs0, a, cs1

Additional information

Used terms: cs0, a, cs1

Proof step 31 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ n. ⌜n⌝ < # cσ → cstartf0(cσ[n]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: m

Proof step 32 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ⌜m⌝ < # cσ → cstartf0(cσ[m]) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 33 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ ⌜m⌝ < # cσ, ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ cfrag(CIOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf

Proof step 34 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = ⌜nf⌝ ^, ⌜al⌝ = ⌜nf to m⌝ ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜nf⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, ⌜nf to m⌝ ), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), ¬ ⌜m⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: cσ

Additional information

Used simplifier rules: cstatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)

Proof step 35 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV, name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, aINV, t, cINV, astepf] → [cstartf, cstepf, astartf, astartf0, t, cstartf0, astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, t, cstartf0, astartf0

Proof step 36 from proof bwinv-leqstar (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

A spec-lemma

Proof step 37 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0) ↔ (∀ cs. cstartf(cs) → cstartf0(cs)) ∧ (∀ as. astartf(as) → astartf0(as)) ∧ (∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0)) ∧ (∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0)) ∧ (∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs. cstartf0(cs) → (∃ as. t(cs, as) ∧ astartf0(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 15 terms: cσ[m] abort: F discard: T computed: T

Additional information

Used terms: cσ[m]

Proof step 39 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), cstartf0(cσ[m]) → (∃ as. t(cσ[m], as) ∧ astartf0(as)), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 40 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV, name:lemma_3-15, seq:bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as), subst:[al, cstartf, cs, cstepf, astartf, aINV, t, as0, cINV, cs0, astepf] → [al, cstartf, cσ[0], cstepf, astartf, astartf0, t, as, cstartf0, cσ[m], astepf]

Additional information

Used terms: cstartf, cstepf, astartf, astepf, t, cstartf0, astartf0, cσ[0], al, cσ[m], as

Proof step 41 from proof bwinv-leqstar (previous step) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as)

A spec-lemma

Proof step 42 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦ cstartf0(cσ[0]) ∧ cmove(CIOAut(cstartf, cstepf))(cσ[0], ⌜al⌝ , cσ[m])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 43 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf0(cσ[0]), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 14 terms: cσ[0]

Additional information

Used terms: cσ[0]

Proof step 44 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cmove(CIOAut(cstartf, cstepf))(cσ[0], ⌜al⌝ , cσ[m]), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:move, seq:⊦ cmove(CIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. cfrag*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s2, startf, s1, β] → [cstepf, cσ[m], cstartf, cσ[0], ⌜al⌝ ], <all paths>

Additional information

Used terms: cσ[m], ⌜al⌝ , cσ[0], cstepf, cstartf

Proof step 45 from proof bwinv-leqstar (previous step) (back to tree)

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

A spec-lemma

Proof step 46 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ α, sl. ¬(cfrag*(CIOAut(cstartf, cstepf))(⌜sl⌝ , α) ∧ cσ[0] = sl[0] ∧ cσ[m] = sl.last ∧ α ^ = ⌜al⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ cfrag*(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 47 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ α0, sl. ¬ cfrag(CIOAut(cstartf, cstepf))(⌜sl⌝ , α0) ∨ ¬ finp(α0) ∨ cσ[0] ≠ sl[0] ∨ cσ[m] ≠ sl.last ∨ α0 ^ ≠ ⌜al⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 19 terms: α to m, (cσ to m + 1).l abort: F discard: T computed: F

Additional information

Used terms: α to m, (cσ to m + 1).l

Proof step 48 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ¬ cfrag(CIOAut(cstartf, cstepf))(⌜(cσ to m + 1).l⌝ , α to m) ∨ ¬ finp(α to m) ∨ cσ[0] ≠ (cσ to m + 1).l[0] ∨ cσ[m] ≠ (cσ to m + 1).l.last ∨ (α to m)^ ≠ ⌜al⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s)

Proof step 49 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ¬ cfrag(CIOAut(cstartf, cstepf))(⌜(cσ to m + 1).l⌝ , α to m) ∨ cσ[0] ≠ (cσ to m + 1).l[0] ∨ cσ[m] ≠ (cσ to m + 1).l.last ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream-basic[traceC-IOstatestream], name:sel-embed-fin, seq: ⊦ finp(σ) → ⌜σ.l⌝ = σ, subst:[σ] → [cσ to m + 1], <all paths>

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (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 ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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 m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ finp(σ to m); (s) Used terms: cσ to m + 1

Proof step 50 from proof bwinv-leqstar (previous step) (back to tree)

⊦ finp(σ) → ⌜σ.l⌝ = σ

A spec-lemma

Proof step 51 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), finp(cσ to m + 1), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ¬ cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m) ∨ cσ[0] ≠ (cσ to m + 1).l[0] ∨ cσ[m] ≠ (cσ to m + 1).l.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ cfrag(CIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → (cfrag(CIOAut(startf, stepf))(σ to n + 1, α to n) ↔ true); (ss) ⊦ finp(σ to m); (s)

Proof step 52 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), cσ[0] ≠ (cσ to m + 1).l[0] ∨ cσ[m] ≠ (cσ to m + 1).l.last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 19

Additional information

Proof step 53 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, cσ[0] ≠ (cσ to m + 1).l[0], astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0, m + 1, cσ

Proof step 54 from proof bwinv-leqstar (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m]

A spec-lemma

Proof step 55 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, cσ[0] ≠ (cσ to m + 1).l[0], astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ 0 < m + 1 ∧ ¬ # cσ < ⌜m + 1⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ cfrag(CIOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf 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⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 56 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = ⌜nf⌝ ^, ⌜al⌝ = ⌜nf to m⌝ ^, cσ[0] ≠ (cσ to m + 1).l[0], astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜nf⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, ⌜nf to m⌝ ), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ ⌜m⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ # ⌜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 ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (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 ⊦ ¬ ∞ < n∞; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n).l[m] = σ[m]; (s) Used terms: ⌜nf⌝ , cσ, cstepf, cstartf

Proof step 57 from proof bwinv-leqstar (previous step) (back to tree)

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

A spec-lemma

Proof step 58 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, cσ[m] ≠ (cσ to m + 1).l.last, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[traceC-IOstatestream], name:to-unwind-end, seq:⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝ , subst:[n, σ] → [m, cσ], <all paths>

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ finp(σ to m); (s) finp(σ), finp(σ0) ⊦ (σ0 + σ).l = σ0.l + σ.l; (s) ⊦ ⌜x⌝ .l = x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] Used terms: m, cσ

Proof step 59 from proof bwinv-leqstar (previous step) (back to tree)

⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝

A spec-lemma

Proof step 60 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, cσ[m] ≠ (cσ to m + 1).l.last, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ ⌜m⌝ < # cσ, ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ cfrag(CIOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf

Proof step 61 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = ⌜nf⌝ ^, ⌜al⌝ = ⌜nf to m⌝ ^, cσ[m] ≠ (cσ to m + 1).l.last, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜nf⌝ ), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, ⌜nf to m⌝ ), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ ⌜m⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜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 ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (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 ⊦ ¬ ∞ < n∞; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m⌝ < ∞; (s) Used terms: ⌜nf⌝ , cσ, cstepf, cstartf

Proof step 62 from proof bwinv-leqstar (previous step) (back to tree)

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

A spec-lemma

Proof step 63 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ∃ as1. astartf0(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as) ∧ t(cσ[0], as1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 64 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as), astartf0(as1), astartf0(as), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[0], as1), t(cσ[m], as), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move, seq:⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[s1, stepf, β, s2, startf] → [as1, astepf, ⌜al⌝ , as, astartf], <all paths>

Additional information

Used terms: as, ⌜al⌝ , as1, astepf, astartf

Proof step 65 from proof bwinv-leqstar (previous step) (back to tree)

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

A spec-lemma

Proof step 66 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, astartf0(as), astartf0(as1), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], as), t(cσ[0], as1), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ∃ α, sl. afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ as1 = sl[0] ∧ as = sl.last ∧ α ^ = ⌜al⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 67 from proof bwinv-leqstar (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf0(asl[0]), astartf0(asl.last), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[0], asl[0]), t(cσ[m], asl.last), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:trace, seq:⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜al⌝ , astepf, astartf], <all paths>

Additional information

Used terms: ⌜al⌝ , astepf, astartf

Proof step 68 from proof bwinv-leqstar (previous step) (back to tree)

⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))

A spec-lemma

Proof step 69 from proof bwinv-leqstar (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf0(asl.last), astartf0(asl[0]), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], asl.last), t(cσ[0], asl[0]), ¬ # α < ⌜m⌝ , ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ σ, β. ¬(⌜al⌝ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 70 from proof bwinv-leqstar (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf0(asl[0]), astartf0(asl.last), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[0], asl[0]), t(cσ[m], asl.last), ¬ # α < ⌜m⌝ , ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ σ, β. ⌜al⌝ ≠ β ^ ∨ ¬ afrag(AIOAut(astartf, astepf))(σ, β) ∨ ¬ astartf(σ[0]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 22 terms: ⌜asl⌝ , ⌜al0⌝ abort: F discard: T computed: T

Additional information

Used terms: ⌜asl⌝ , ⌜al0⌝

Proof step 71 from proof bwinv-leqstar (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf0(asl.last), astartf0(asl[0]), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cstartf(cσ[0]), cstartf((cσ to m + 1)[0]), cstartf0(cσ[m]), t(cσ[m], asl.last), t(cσ[0], asl[0]), ¬ # α < ⌜m⌝ , ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as. astartf(as) → astartf0(as), ∀ cs. cstartf(cs) → cstartf0(cs), ⌜al⌝ ≠ ⌜al0⌝ ^ ∨ ¬ afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∨ ¬ astartf(⌜asl⌝ [0]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 72 from proof bwinv-leqstar (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ), astartf0(asl[0]), astartf0(asl.last), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf((cσ to m + 1)[0]), cstartf(cσ[0]), cstartf0(cσ[m]), t(cσ[0], asl[0]), t(cσ[m], asl.last), ¬ # α < ⌜m⌝ , ¬ astartf(asl[0]), ∀ cs. cstartf(cs) → cstartf0(cs), ∀ as. astartf(as) → astartf0(as), ∀ cs, a, cs0. cstartf0(cs) ∧ cstepf(cs, a, cs0) → cstartf0(cs0), ∀ as, a, as0. astartf0(as) ∧ astepf(as, a, as0) → astartf0(as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ astartf0(as) → astartf(as), ∀ cs, a, cs0, as0. cstartf0(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ astartf0(as0) → (∃ as. astartf0(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 21 terms: cσ[0], asl[0]

Additional information

Used terms: cσ[0], asl[0]

Proof step 73 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cexec(CIOAut(cstartf, cstepf))(cσ to m + 1, α to m) ⊦

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 ⊦ cfrag(CIOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → (cfrag(CIOAut(startf, stepf))(σ to n + 1, α to n) ↔ true); (ss) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 74 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = α ^, ⌜al⌝ = (α to m)^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to m + 1)[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0, m + 1, cσ

Proof step 75 from proof bwinv-leqstar (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]

A spec-lemma

Proof step 76 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = (α to m)^, ⌜al⌝ = α ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α < ⌜m⌝ , ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to m + 1)[0]) ⊦ 0 < m + 1 ∧ ¬ # cσ < ⌜m + 1⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ cfrag(CIOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf 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⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 77 from proof bwinv-leqstar (previous step) (back to tree)

⌜al⌝ = ⌜nf⌝ ^, ⌜al⌝ = ⌜nf to m⌝ ^, bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cstartf0, astartf0), cfrag(CIOAut(cstartf, cstepf))(cσ, ⌜nf⌝ ), cstartf(cσ[0]), ¬ ⌜m⌝ < # cσ, ¬ atrace(AIOAut(astartf, astepf))(⌜al⌝ ), ¬ cstartf((cσ to m + 1)[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ # ⌜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 ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (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 ⊦ ¬ ∞ < n∞; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) Used terms: ⌜nf⌝ , cσ, cstepf, cstartf

Proof step 78 from proof bwinv-leqstar (previous step) (back to tree)

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

A spec-lemma

Proof Tree for bwinv-leqstar (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