[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 lemma_2-2-1 (conclusion) (back to tree)

⊦ det(IOAut(startf, stepf)) → (∀ β, s1, s2. after(IOAut(startf, stepf))(β, s1) ∧ after(IOAut(startf, stepf))(β, s2) → s1 = s2)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof lemma_2-2-1 (previous step) (back to tree)

det(IOAut(startf, stepf)) ⊦ ∀ β, s1, s2. after(IOAut(startf, stepf))(β, s1) ∧ after(IOAut(startf, stepf))(β, s2) → s1 = s2

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof lemma_2-2-1 (previous step) (back to tree)

s1 ≠ s2, after(IOAut(startf, stepf))(α, s1), after(IOAut(startf, stepf))(α, s2), det(IOAut(startf, stepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:deterministic, seq:⊦ det(IOAut(startf, stepf)) ↔ (∃ s. ∀ s0. startf(s0) ↔ s = s0) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1), subst:[stepf, startf] → [stepf, startf], <all paths>

Additional information

Used terms: stepf, startf

Proof step 4 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ det(IOAut(startf, stepf)) ↔ (∃ s. ∀ s0. startf(s0) ↔ s = s0) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1)

Lemma deterministic

Proof step 5 from proof lemma_2-2-1 (previous step) (back to tree)

s1 ≠ s2, after(IOAut(startf, stepf))(α, s2), after(IOAut(startf, stepf))(α, s1), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∃ s. ∀ s0. startf(s0) ↔ s = s0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 6 from proof lemma_2-2-1 (previous step) (back to tree)

s1 ≠ s2, after(IOAut(startf, stepf))(α, s1), after(IOAut(startf, stepf))(α, s2), ∀ s0. startf(s0) ↔ s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:after, seq:⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last), subst:[s, β, stepf, startf] → [s1, α, stepf, startf], <all paths>

Additional information

Used terms: s1, α, stepf, startf

Proof step 7 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)

Lemma after

Proof step 8 from proof lemma_2-2-1 (previous step) (back to tree)

s1 ≠ s2, after(IOAut(startf, stepf))(α, s2), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s0. startf(s0) ↔ s = s0, ∃ α0, σ. α0 ^ = α ∧ exec*(IOAut(startf, stepf))(σ, α0) ∧ s1 = σ.l.last ⊦

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] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 9 from proof lemma_2-2-1 (previous step) (back to tree)

σ.l.last ≠ s2, after(IOAut(startf, stepf))(⌜al⌝ ^, s2), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ∀ s0. startf(s0) ↔ s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:after, seq:⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last), subst:[s, β, stepf, startf] → [s2, ⌜al⌝ ^, stepf, startf], <all paths>

Additional information

Used terms: s2, ⌜al⌝ ^, stepf, startf

Proof step 10 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)

Lemma after

Proof step 11 from proof lemma_2-2-1 (previous step) (back to tree)

σ.l.last ≠ s2, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s0. startf(s0) ↔ s = s0, ∃ α, σ. α ^ = ⌜al⌝ ^ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s2 = σ.l.last ⊦

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] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 12 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), startf(σ[0]), startf(σ0[0]), ∀ s0. startf(s0) ↔ s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: σ0[0] abort: F discard: F computed: T

Additional information

Used terms: σ0[0]

Proof step 13 from proof lemma_2-2-1 (previous step) (back to tree)

startf(σ0[0]) ↔ s = σ0[0], ⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ0[0]), startf(σ[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s0. startf(s0) ↔ s = s0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ0[0]), startf(σ[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s0. startf(s0) → σ0[0] = s0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: σ[0] abort: F discard: T computed: T

Additional information

Used terms: σ[0]

Proof step 15 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), startf(σ[0]), startf(σ0[0]), startf(σ[0]) → σ0[0] = σ[0], ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof lemma_2-2-1 (previous step) (back to tree)

σ0[0] = σ[0], ⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: σ0

Additional information

Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 17 from proof lemma_2-2-1 (previous step) (back to tree)

σ0[0] = σ[0], ⌜al0⌝ ^ = ⌜al⌝ ^, σ0 = ⌜sl0⌝ , σ.l.last ≠ σ0.l.last, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), frag(IOAut(startf, stepf))(σ0, ⌜al0⌝ ), startf(σ[0]), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

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)

Proof step 18 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = σ[0], ⌜al0⌝ ^ = ⌜al⌝ ^, σ.l.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: σ

Additional information

Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)

Proof step 19 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = σ[0], ⌜al0⌝ ^ = ⌜al⌝ ^, σ = ⌜sl1⌝ , σ.l.last ≠ sl0.last, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(σ[0]), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 20 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜al⌝ ^, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 6

Additional information

Proof step 21 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜al⌝ ^, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al

Additional information

Used simplifier rules: actionlist freely generated by [], +;;

Proof step 22 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜[]⌝ ^, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜[]⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 23 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = [], sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , []), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: [], ⌜sl1⌝ , stepf, startf

Proof step 24 from proof lemma_2-2-1 (previous step) (back to tree)

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

A spec-lemma

Proof step 25 from proof lemma_2-2-1 (previous step) (back to tree)

# ⌜sl1⌝ = # [] + ⌜1⌝ , sl0[0] = sl1[0], ⌜al0⌝ ^ = [], sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ n. ⌜n⌝ < # [] → stepf(⌜sl1⌝ [n], [][n], ⌜sl1⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 26 from proof lemma_2-2-1 (previous step) (back to tree)

# sl1 = 1, sl0[0] = sl1[0], ⌜al0⌝ ^ = [], sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl1

Additional information

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

Proof step 27 from proof lemma_2-2-1 (previous step) (back to tree)

# sl1 = 1, sl0[0] = sl1[0], ⌜al0⌝ ^ = [], sl1 = s + sl2, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ 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 ⊦ # 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 28 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = [], sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 5

Additional information

Proof step 29 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = [], sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al0

Additional information

Used simplifier rules: actionlist freely generated by [], +;;

Proof step 30 from proof lemma_2-2-1 (previous step) (back to tree)

⌜[]⌝ ^ = [], sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜[]⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 31 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , []), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: [], ⌜sl0⌝ , stepf, startf

Proof step 32 from proof lemma_2-2-1 (previous step) (back to tree)

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

A spec-lemma

Proof step 33 from proof lemma_2-2-1 (previous step) (back to tree)

# ⌜sl0⌝ = # [] + ⌜1⌝ , sl0[0] ≠ sl0.last, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ n. ⌜n⌝ < # [] → stepf(⌜sl0⌝ [n], [][n], ⌜sl0⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 34 from proof lemma_2-2-1 (previous step) (back to tree)

# sl0 = 1, sl0[0] ≠ sl0.last, ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: sl0

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '.last = a; (s) ⊦ # [] = 0; (s)

Proof step 35 from proof lemma_2-2-1 (previous step) (back to tree)

⌜action + al⌝ ^ = [], sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action + al⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl0, startf, stepf. ¬(⌜al⌝ ^ = [] ∧ sl0[0] ≠ sl0.last ∧ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0)) ⊦

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[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 36 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜τ '⌝ + ⌜al⌝ ), ∀ sl, startf0, stepf0. sl[0] = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl0

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 37 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], sl0 = s + sl1, sl0[0] ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜τ '⌝ + ⌜al⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, startf0, stepf0. sl[0] = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s)

Proof step 38 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl1⌝ , ⌜τ '⌝ + ⌜al⌝ ), ∀ sl, startf0, stepf0. sl[0] = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-rec, seq:⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α), subst:[stepf, α, σ, a, startf, s] → [stepf, ⌜al⌝ , ⌜sl1⌝ , τ, startf, s], <all paths>

Additional information

Used terms: ⌜al⌝ , τ, ⌜sl1⌝ , s, stepf, startf

Proof step 39 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 40 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, startf0, stepf0. sl[0] = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 41 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), ∀ sl, startf0, stepf0. sl[0] = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: sl1, startf, stepf abort: F discard: T computed: T

Additional information

Used terms: sl1, startf, stepf

Proof step 42 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, sl1[0] = sl1.last ∨ ¬ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ) ∨ ¬(∀ s, s0. stepf(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof lemma_2-2-1 (previous step) (back to tree)

sl1[0] = sl1.last, ⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: s, hd(⌜sl1⌝ ) abort: F discard: T computed: T

Additional information

Used terms: s, hd(⌜sl1⌝ )

Proof step 44 from proof lemma_2-2-1 (previous step) (back to tree)

sl1[0] = sl1.last, ⌜al⌝ ^ = [], s ≠ (s ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), stepf(s, τ, hd(⌜sl1⌝ )) → s = hd(⌜sl1⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 45 from proof lemma_2-2-1 (previous step) (back to tree)

sl1[0] = sl1.last, ⌜al⌝ ^ = [], hd(⌜sl1⌝ ) ≠ (hd(⌜sl1⌝ ) ' + sl1).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(hd(⌜sl1⌝ ), τ, hd(⌜sl1⌝ )) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [⌜sl1⌝ , a, σ0]

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '.last = a; (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: ⌜sl1⌝ , s, σ2

Proof step 46 from proof lemma_2-2-1 (previous step) (back to tree)

sl1[0] = sl1.last, ⌜al⌝ ^ = [], ⌜sl1⌝ = a + σ0, a ≠ (a ' + sl1).last, ⌜sl1⌝ ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(a, τ, a) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)

Proof step 47 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = [], hd(sl1) = sl1.last, ⌜sl1⌝ = ⌜a '⌝ + σ0, a ≠ sl1.last, sl1 ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(a, τ, a) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl1, s, sl0

Proof step 48 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜action + al1⌝ ^, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜action + al1⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ sl0, sl1, al0, startf, stepf. ¬ ( sl0[0] = sl1[0] ∧ ⌜al0⌝ ^ = ⌜al1⌝ ^ ∧ sl1.last ≠ sl0.last ∧ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al1⌝ ) ∧ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0)) ⊦

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[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 49 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜action '⌝ + ⌜al1⌝ ), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl1

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 50 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = sl1[0], ⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, sl1 = s + sl2, sl1.last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜action '⌝ + ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s)

Proof step 51 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0[0] '⌝ + ⌜sl2⌝ , ⌜action '⌝ + ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-rec, seq:⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α), subst:[stepf, α, σ, a, startf, s] → [stepf, ⌜al1⌝ , ⌜sl2⌝ , action, startf, sl0[0]], <all paths>

Additional information

Used terms: ⌜al1⌝ , action, ⌜sl2⌝ , sl0[0], stepf, startf

Proof step 52 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 53 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 54 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-one, seq: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ , subst:[a] → [action], <all paths>

Additional information

Used terms: action

Proof step 55 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝

A spec-lemma

Proof step 56 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ ^ + ⌜al1⌝ ^, action = τ, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

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] ⊦ [] + σ = σ; (s) ⊦ ⌜τ '⌝ ^ = []; (s)

Proof step 57 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), stepf(sl0[0], τ, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: sl0, sl2, al0, startf, stepf abort: F discard: T computed: T

Additional information

Used terms: sl0, sl2, al0, startf, stepf

Proof step 58 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], τ, hd(⌜sl2⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, sl0[0] ≠ sl2[0] ∨ ⌜al0⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl0.last ∨ ¬ frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 59 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), stepf(sl0[0], τ, hd(⌜sl2⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, sl0[0] ≠ sl2[0] ∨ sl2.last = sl0.last ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: sl0[0], hd(⌜sl2⌝ ) abort: F discard: T computed: T

Additional information

Used terms: sl0[0], hd(⌜sl2⌝ )

Proof step 60 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], τ, hd(⌜sl2⌝ )), stepf(sl0[0], τ, hd(⌜sl2⌝ )) → sl0[0] = hd(⌜sl2⌝ ), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, sl0[0] ≠ sl2[0] ∨ sl2.last = sl0.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 61 from proof lemma_2-2-1 (previous step) (back to tree)

sl0[0] = hd(⌜sl2⌝ ), ⌜al0⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), stepf(sl0[0], τ, sl0[0]), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, sl0[0] ≠ sl2[0] ∨ sl2.last = sl0.last ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: sl2

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 62 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 63 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1 ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al0

Additional information

Used simplifier rules: actionlist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]

Proof step 64 from proof lemma_2-2-1 (previous step) (back to tree)

⌜action0 + al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action0 + al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ action, al1, sl0, sl2, startf, stepf. ¬ ( ⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^ ∧ (sl0[0] ' + sl2).last ≠ sl0.last ∧ action ≠ τ ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ) ∧ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ) ∧ stepf(sl0[0], action, hd(⌜sl2⌝ )) ∧ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1)) ⊦

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[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 65 from proof lemma_2-2-1 (previous step) (back to tree)

⌜action0 '⌝ ^ + ⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action0 '⌝ + ⌜al⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-one, seq: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ , subst:[a] → [action0], <all paths>

Additional information

Used terms: action0

Proof step 66 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝

A spec-lemma

Proof step 67 from proof lemma_2-2-1 (previous step) (back to tree)

⌜action0 '⌝ ^ + ⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, action0 = τ, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action0 '⌝ + ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

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] ⊦ [] + σ = σ; (s) ⊦ ⌜τ '⌝ ^ = []; (s)

Proof step 68 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜τ '⌝ + ⌜al⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl0

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 69 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, sl0 = s + sl1, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜τ '⌝ + ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s)

Proof step 70 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl1⌝ , ⌜τ '⌝ + ⌜al⌝ ), stepf(s, action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-rec, seq:⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α), subst:[stepf, α, σ, a, startf, s] → [stepf, ⌜al⌝ , ⌜sl1⌝ , τ, startf, s], <all paths>

Additional information

Used terms: ⌜al⌝ , τ, ⌜sl1⌝ , s, stepf, startf

Proof step 71 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 72 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, τ, hd(⌜sl1⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 73 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), stepf(s, action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: action, al1, sl1, sl2, startf, stepf abort: F discard: T computed: F

Additional information

Used terms: action, al1, sl1, sl2, startf, stepf

Proof step 74 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, τ, hd(⌜sl1⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ⌜al⌝ ^ ≠ ⌜action '⌝ + ⌜al1⌝ ^ ∨ (sl1[0] ' + sl2).last = sl1.last ∨ action = τ ∨ ¬ frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ) ∨ ¬ stepf(sl1[0], action, hd(⌜sl2⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 75 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, τ, hd(⌜sl1⌝ )), stepf(s, action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, (sl1[0] ' + sl2).last = sl1.last ∨ ¬ stepf(sl1[0], action, hd(⌜sl2⌝ )) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: s, hd(⌜sl1⌝ ) abort: F discard: F computed: T

Additional information

Used terms: s, hd(⌜sl1⌝ )

Proof step 76 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, τ, hd(⌜sl1⌝ )), stepf(s, τ, hd(⌜sl1⌝ )) → s = hd(⌜sl1⌝ ), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), (sl1[0] ' + sl2).last = sl1.last ∨ ¬ stepf(sl1[0], action, hd(⌜sl2⌝ )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 77 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (hd(⌜sl1⌝ ) ' + sl2).last ≠ (hd(⌜sl1⌝ ) ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(hd(⌜sl1⌝ ), action, hd(⌜sl2⌝ )), stepf(hd(⌜sl1⌝ ), τ, hd(⌜sl1⌝ )), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), (sl1[0] ' + sl2).last = sl1.last ∨ ¬ stepf(sl1[0], action, hd(⌜sl2⌝ )) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: sl1

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 78 from proof lemma_2-2-1 (previous step) (back to tree)

⌜action0 '⌝ + ⌜al⌝ ^ = ⌜action '⌝ + ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, action0 ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action0 '⌝ + ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws)

Proof step 79 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action '⌝ + ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl0

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 80 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, sl0 = s + sl1, (sl0[0] ' + sl2).last ≠ sl0.last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜action '⌝ + ⌜al⌝ ), stepf(sl0[0], action, hd(⌜sl2⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s)

Proof step 81 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl1⌝ , ⌜action '⌝ + ⌜al⌝ ), stepf(s, action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-rec, seq:⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α), subst:[stepf, α, σ, a, startf, s] → [stepf, ⌜al⌝ , ⌜sl1⌝ , action, startf, s], <all paths>

Additional information

Used terms: ⌜al⌝ , action, ⌜sl1⌝ , s, stepf, startf

Proof step 82 from proof lemma_2-2-1 (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 83 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, action, hd(⌜sl1⌝ )), ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 84 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, action, hd(⌜sl1⌝ )), stepf(s, action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: sl1, sl2, al, startf, stepf abort: F discard: T computed: T

Additional information

Used terms: sl1, sl2, al, startf, stepf

Proof step 85 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, action, hd(⌜sl1⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), sl1[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al1⌝ ^ ∨ sl2.last = sl1.last ∨ ¬ frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf(s, τ, s0) → s = s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 86 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, action, hd(⌜sl1⌝ )), stepf(s, action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, sl1[0] ≠ sl2[0] ∨ sl2.last = sl1.last ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: s, action, hd(⌜sl1⌝ ), hd(⌜sl2⌝ ) abort: F discard: F computed: T

Additional information

Used terms: s, action, hd(⌜sl1⌝ ), hd(⌜sl2⌝ )

Proof step 87 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), stepf(s, action, hd(⌜sl1⌝ )), stepf(s, action, hd(⌜sl1⌝ )) ∧ stepf(s, action, hd(⌜sl2⌝ )) → hd(⌜sl1⌝ ) = hd(⌜sl2⌝ ), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), sl1[0] ≠ sl2[0] ∨ sl2.last = sl1.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 88 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, hd(⌜sl1⌝ ) = hd(⌜sl2⌝ ), (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), stepf(s, action, hd(⌜sl2⌝ )), ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ s, s0. stepf(s, τ, s0) → s = s0, sl1[0] ≠ sl2[0] ∨ sl2.last = sl1.last ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: sl1

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof step 89 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, hd(⌜sl1⌝ ) = hd(⌜sl2⌝ ), sl1 = s0 + sl0, (s ' + sl2).last ≠ (s ' + sl1).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), sl1[0] ≠ sl2[0] ∨ sl2.last = sl1.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s)

Proof step 90 from proof lemma_2-2-1 (previous step) (back to tree)

⌜al⌝ ^ = ⌜al1⌝ ^, (s ' + sl2).last ≠ (hd(⌜sl2⌝ ) ' + sl0).last, action ≠ τ, frag(IOAut(startf, stepf))(⌜hd(⌜sl2⌝ ) '⌝ + ⌜sl0⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), stepf(s, action, hd(⌜sl2⌝ )), ∀ s, s0. stepf(s, τ, s0) → s = s0, ∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1, ∀ action1, al0, sl, sl1, startf0, stepf0. ⌜al1⌝ ^ ≠ ⌜action1 '⌝ + ⌜al0⌝ ^ ∨ (sl[0] ' + sl1).last = sl.last ∨ action1 = τ ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl1⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ stepf0(sl[0], action1, hd(⌜sl1⌝ )) ∨ ¬ (∀ sl, sl2, al, startf0, stepf0. sl[0] ≠ sl2[0] ∨ ⌜al⌝ ^ ≠ ⌜al0⌝ ^ ∨ sl2.last = sl.last ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl2⌝ , ⌜al0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0)) ∨ ¬(∀ s, s0. stepf0(s, τ, s0) → s = s0) ∨ ¬(∀ s, a, s0, s1. stepf0(s, a, s0) ∧ stepf0(s, a, s1) → s0 = s1), hd(⌜sl2⌝ ) ≠ sl2[0] ∨ sl2.last = (sl2[0] ' + sl0).last ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: sl2

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)

Proof Tree for lemma_2-2-1 (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