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

fin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: Koenigs-Lemma-gen[Koenigs-Lemma-gen-behact], name:finroot-def, seq: ⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s), subst:[g] → [ (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))], <all paths>

Additional information

Used terms: (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))

Proof step 2 from proof finroot (previous step) (back to tree)

⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s)

A spec-lemma

Proof step 3 from proof finroot (previous step) (back to tree)

fin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: restricted, name:finiteinvisiblenondet, seq:⊦ fin(IOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl), subst:[stepf, startf] → [stepf, startf], <all paths>

Additional information

Used terms: stepf, startf

Proof step 4 from proof finroot (previous step) (back to tree)

⊦ fin(IOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl)

A spec-lemma

Proof step 5 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∃ sl. ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 6 from proof finroot (previous step) (back to tree)

∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Additional information

Used formulas: ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Proof step 7 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: [] × {sl0} abort: F discard: T computed: F

Additional information

Used terms: [] × {sl0}

Proof step 9 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ [] × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ [] × {sl0}

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen[Koenigs-Lemma-gen-behact], name:isroot-def, seq: ⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b)), subst:[b, g] → [_a, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))], <all paths>

Additional information

Used terms: _a, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))

Proof step 11 from proof finroot (previous step) (back to tree)

⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b))

A spec-lemma

Proof step 12 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, _a)) ↔ _a ∈ [] × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ dom(vs × es) = vs; (s)

Proof step 13 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ α ∧ finp(actstream(_a)) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, _a)) ↔ _a ∈ [] × {sl0}

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: pair-actionstream-state, name:elim, seq: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st, subst:[αs, ασ, st] → [_a, α1, s0]

Additional information

Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: _a, ασ, st

Proof step 14 from proof finroot (previous step) (back to tree)

_a = α1 × s0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ after(IOAut(startf, stepf))(α1, s0) ∧ α1 ≤ α ∧ finp(α1) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, _a)) ↔ _a ∈ [] × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ after(IOAut(startf, stepf))(α1, s0) ∧ α1 ≤ α ∧ finp(α1) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, α1 × s0)) ↔ α1 × s0 ∈ [] × {sl0}

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s0, α1, stepf, startf

Proof step 16 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 17 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ (∃ α, σ. α ^ = α1 ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s0 = σ.l.last) ∧ α1 ≤ α ∧ finp(α1) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, α1 × s0)) ↔ α1 × s0 ∈ [] × {sl0}

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: α1

Additional information

Used simplifier rules: times-in: ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss; actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ [] ≠ ⌜nf⌝ ; (s)

Proof step 18 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ (∃ α, σ. α ^ = ⌜al⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s0 = σ.l.last) ∧ ⌜al⌝ ≤ α ∧ finp(⌜al⌝ ) ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × s0)) ↔ ⌜al⌝ × s0 ∈ [] × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 19 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ (∃ α0, σ. α0 ^ = ⌜al⌝ ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last) ∧ ⌜al⌝ ≤ α ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × s0)) ↔ ⌜al⌝ × s0 ∈ [] × {sl0}

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 20 from proof finroot (previous step) (back to tree)

⌜al⌝ ≤ α, ¬ ⌜al⌝ × s0 ∈ [] × {sl0} , ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × s0), ∃ α0, σ. α0 ^ = ⌜al⌝ ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.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]

Proof step 21 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ¬ ⌜al⌝ × σ.l.last ∈ [] × {sl0} , ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:times-in, seq: ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss, subst:[ss, α, αs] → [{sl0} , [], ⌜al⌝ × σ.l.last], <all paths>

Additional information

Used terms: {sl0} , [], ⌜al⌝ × σ.l.last

Proof step 22 from proof finroot (previous step) (back to tree)

⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss

Lemma times-in

Proof step 23 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), actstream(⌜al⌝ × σ.l.last) ≠ [] ∨ ¬ endstate(⌜al⌝ × σ.l.last) ∈ {sl0} ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ s ∈ {sl} ↔ s ∈ sl; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ actstream(ασ × st) = ασ; (s)

Proof step 24 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, al ≠ [] ∨ ¬ σ.l.last ∈ sl0 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: al = []

Additional information

Used formulas: al = []

Proof step 25 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al = [], frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), al ≠ [] ∨ ¬ σ.l.last ∈ sl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 26 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ¬ σ.l.last ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × σ.l.last) ⊦

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 27 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], σ = ⌜sl1⌝ , frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ¬ σ.l.last ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × σ.l.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

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

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ¬ sl1.last ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × sl1.last) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: sl1.last abort: F discard: T computed: T

Additional information

Used terms: sl1.last

Proof step 29 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ¬ sl1.last ∈ sl0, (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], sl1.last)) ↔ sl1.last ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × sl1.last), ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ¬ sl1.last ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × sl1.last) ⊦ ∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], sl1.last)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: hd(sl1) abort: F discard: T computed: F

Additional information

Used terms: hd(sl1)

Proof step 31 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ¬ sl1.last ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × sl1.last), ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ startf(hd(sl1)) ∧ move(IOAut(startf, stepf))(hd(sl1), [], sl1.last)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

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, s0, sl2]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl1, s0, y

Proof step 32 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], sl1 = s0 + sl2, sl1 ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ¬ sl1.last ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × sl1.last) ⊦ startf(s0) ∧ move(IOAut(startf, stepf))(s0, [], 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] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ a ' + x ≠ []; (s)

Proof step 33 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl2⌝ , ⌜al0⌝ ), startf(s0), ¬ move(IOAut(startf, stepf))(s0, [], (s0 ' + sl2).last), ¬ (s0 ' + sl2).last ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × (s0 ' + sl2).last) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: (s0 ' + sl2).last, [], s0, stepf, startf

Proof step 34 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 35 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl2⌝ , ⌜al0⌝ ), startf(s0), ¬ (s0 ' + sl2).last ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × (s0 ' + sl2).last), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s0 = sl[0] ∧ (s0 ' + sl2).last = sl.last ∧ α ^ = []) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 36 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = [], frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl2⌝ , ⌜al0⌝ ), startf(s0), ¬ (s0 ' + sl2).last ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × (s0 ' + sl2).last), ∀ α0, sl1. ¬ frag(IOAut(startf, stepf))(⌜sl1⌝ , α0) ∨ ¬ finp(α0) ∨ s0 ≠ sl1[0] ∨ (sl1[0] ' + sl2).last ≠ sl1.last ∨ α0 ^ ≠ [] ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 9 terms: ⌜al0⌝ , s0 ' + sl2 abort: F discard: T computed: F

Additional information

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

Proof step 37 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), al ≠ [] ∨ ¬ σ.l.last ∈ sl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

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 39 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , σ = ⌜sl1⌝ , al ≠ [], frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × σ.l.last) ⊦

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 40 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Additional information

Used formulas: ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Proof step 41 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 42 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: ⌜al0 to m⌝ ^ × sl1[m] abort: F discard: T computed: F

Additional information

Used terms: ⌜al0 to m⌝ ^ × sl1[m]

Proof step 43 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0 to m⌝ ^ × sl1[m], ⌜al⌝ × sl1.last)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 44 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al.butlast⌝ × sl1[m], ⌜al⌝ × sl1.last)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen-basic[Koenigs-Lemma-gen-behact], name:edge-def, seq: ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b), subst:[b, a, es, vs] → [⌜al⌝ × sl1.last, ⌜al.butlast⌝ × sl1[m], λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))], <all paths>

Additional information

Used terms: ⌜al⌝ × sl1.last, ⌜al.butlast⌝ × sl1[m], λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))

Proof step 45 from proof finroot (previous step) (back to tree)

⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)

A spec-lemma

Proof step 46 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ (∃ a. actstream(⌜al⌝ × sl1.last) = actstream(⌜al.butlast⌝ × sl1[m]) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜al.butlast⌝ × sl1[m]), ⌜a '⌝ , endstate(⌜al⌝ × sl1.last))) ∧ ( after(IOAut(startf, stepf))(actstream(⌜al.butlast⌝ × sl1[m]), endstate(⌜al.butlast⌝ × sl1[m])) ∧ actstream(⌜al.butlast⌝ × sl1[m]) ≤ α ∧ finp(actstream(⌜al.butlast⌝ × sl1[m]))) ∧ after(IOAut(startf, stepf))(actstream(⌜al⌝ × sl1.last), endstate(⌜al⌝ × sl1.last)) ∧ actstream(⌜al⌝ × sl1.last) ≤ α ∧ finp(actstream(⌜al⌝ × sl1.last))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x ≠ [] → (x.butlast + a ' = x ↔ a = x.last); (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)

Proof step 47 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ move(IOAut(startf, stepf))(sl1[m], ⌜al.last '⌝ , sl1.last) ∧ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[m]) ∧ ⌜al.butlast⌝ ≤ α ∧ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜al0 from m⌝ ^ = ⌜al.last '⌝

Additional information

Used formulas: ⌜al0 from m⌝ ^ = ⌜al.last '⌝

Proof step 48 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ move(IOAut(startf, stepf))(sl1[m], ⌜al.last '⌝ , sl1.last) ∧ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[m]) ∧ ⌜al.butlast⌝ ≤ α ∧ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 49 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ move(IOAut(startf, stepf))(sl1[m], ⌜al.last '⌝ , sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: sl1.last, ⌜al.last '⌝ , sl1[m], stepf, startf

Proof step 50 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 51 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ sl1[m] = sl[0] ∧ sl1.last = sl.last ∧ α ^ = ⌜al.last '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 52 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ α0, sl2. ¬ frag(IOAut(startf, stepf))(⌜sl2⌝ , α0) ∨ ¬ finp(α0) ∨ sl1[m] ≠ sl2[0] ∨ sl1.last ≠ sl2.last ∨ α0 ^ ≠ ⌜al.last '⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 14 terms: ⌜al0 from m⌝ , sl1 from m abort: F discard: T computed: F

Additional information

Used terms: ⌜al0 from m⌝ , sl1 from m

Proof step 53 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ¬ frag(IOAut(startf, stepf))(⌜sl1 from m⌝ , ⌜al0 from m⌝ ) ∨ ¬ finp(⌜al0 from m⌝ ) ∨ sl1[m] ≠ (sl1 from m)[0] ∨ sl1.last ≠ (sl1 from m).last ∨ ⌜al0 from m⌝ ^ ≠ ⌜al.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 ⊦ n + 0 = n; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl < # al ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ finp(⌜x⌝ ); (s) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ n < # al → (frag(IOAut(startf, stepf))(⌜sl from n⌝ , ⌜al from n⌝ ) ↔ true); (ss)

Proof step 54 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , sl1.last ≠ (sl1 from m).last, al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl1, s0, y

Proof step 55 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , sl1 = sl2 + s0 ', al ≠ [], al0 ≠ [], s0 ≠ (sl1 from m).last, sl1 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

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) ⊦ x + a ' ≠ []; (s)

Proof step 56 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], s0 ≠ (sl2 + s0 ' from m).last, m < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: m, s0 ', sl2

Proof step 57 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 58 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], s0 ≠ (sl2 + s0 ' from m).last, m < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ¬ m ≤ # sl2, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 59 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], s0 ≠ (s0 ' from (m - # sl2)).last, # sl2 < # al0, # sl2 < m, m < # al0, # sl2 + 1 < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ m < n → m ≤ n; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m, # sl2, n0

Proof step 60 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , m = n0 + # sl2, al ≠ [], al0 ≠ [], s0 ≠ (s0 ' from n0).last, # sl2 + 1 < # al0, m < # al0, # sl2 < m, # sl2 < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, # sl2 ≤ m, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 61 from proof finroot (previous step) (back to tree)

⌜al0 to n0 + # sl2⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from n0 + # sl2⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], n0 ≠ 0, s0 ≠ (s0 ' from n0).last, n0 + # sl2 < # al0, # sl2 + 1 < # al0, # sl2 < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: n0

Additional information

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

Proof step 62 from proof finroot (previous step) (back to tree)

⌜al0 from n0 + # sl2⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to n0 + # sl2⌝ ^ = ⌜al.butlast⌝ , n0 = n +1, al ≠ [], al0 ≠ [], n0 ≠ 0, s0 ≠ (s0 ' from n0).last, # sl2 < # al0, # sl2 + 1 < # al0, n0 + # sl2 < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 63 from proof finroot (previous step) (back to tree)

⌜al0 to (n + 1) + # sl2⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from (n + 1) + # sl2⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], s0 ≠ (s0 ' from n + 1).last, # sl2 + 1 < # al0, # sl2 < # al0, (n + 1) + # sl2 < # al0, frag(IOAut(startf, stepf))(⌜sl2⌝ + ⌜s0 '⌝ , ⌜al0⌝ ), startf((sl2 + s0 ')[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

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] → [⌜al0⌝ , ⌜sl2⌝ + ⌜s0 '⌝ , stepf, startf], <all paths>

Additional information

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

Proof step 64 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 65 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[m]), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: sl1[m], ⌜al.butlast⌝ , stepf, startf

Proof step 66 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 67 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ α, σ. ¬(α ^ = ⌜al.butlast⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl1[m] = σ.l.last) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 14 terms: ⌜al0 to m⌝ , ⌜sl1 to m + 1⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al0 to m⌝ , ⌜sl1 to m + 1⌝

Proof step 68 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ ∧ exec*(IOAut(startf, stepf))(⌜sl1 to m + 1⌝ , ⌜al0 to m⌝ ) ∧ sl1[m] = ⌜sl1 to m + 1⌝ .l.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl < # al ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 69 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ frag(IOAut(startf, stepf))(⌜sl1 to m + 1⌝ , ⌜al0 to m⌝ ) ∧ sl1[m] = (sl1 to m + 1).last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-to-fin, seq:⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ¬ # al < n → (frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ↔ true), subst:[al, stepf, sl, n, startf] → [al0, stepf, sl1, m, startf], <all paths>

Additional information

Used simplifier rules: ⊦ m < n → ¬ n < m; (s) Used terms: startf, stepf, sl1, al0, m

Proof step 70 from proof finroot (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ¬ # al < n → (frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ↔ true)

A spec-lemma

Proof step 71 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ # al0 < m, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ true ∧ sl1[m] = (sl1 to m + 1).last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 72 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , sl1[m] ≠ (sl1 to m + 1).last, al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m < n ↔ ¬ n ≤ m; (ss) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl < # al ↔ false); (s) Used terms: m, sl1

Proof step 73 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 74 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ ⌜al.butlast⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ0 + σ1 ≤ σ → (σ0 ≤ σ ↔ true); (ss) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al, a, y

Proof step 75 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: sl1.last, ⌜al⌝ , stepf, startf

Proof step 76 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 77 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ = ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ α, σ. ¬(α ^ = ⌜al⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl1.last = σ.l.last) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 78 from proof finroot (previous step) (back to tree)

⌜al0 from m⌝ ^ = ⌜al.last '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ α0, σ. α0 ^ ≠ ⌜al⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α0) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α0) ∨ sl1.last ≠ σ.l.last ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 14 terms: ⌜al0⌝ , ⌜sl1⌝

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al0⌝ , ⌜sl1⌝

Proof step 79 from proof finroot (previous step) (back to tree)

⌜al0 to m⌝ ^ = ⌜al.butlast⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al0 from m⌝ ^ ≠ ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ move(IOAut(startf, stepf))(sl1[m], ⌜al.last '⌝ , sl1.last) ∧ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[m]) ∧ ⌜al.butlast⌝ ≤ α ∧ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:elim-fromto-fin, seq: ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n), subst:[x, n, x0, x1] → [al0, m, x0, x1]

Additional information

Used simplifier rules: ⊦ m < n → ¬ n < m; (s) ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: al0, m, x0, x1

Proof step 80 from proof finroot (previous step) (back to tree)

# x0 = m, ⌜al0⌝ ^ = ⌜al⌝ , ⌜x0⌝ ^ = ⌜al.butlast⌝ , al0 = x0 + x1, ⌜x1⌝ ^ ≠ ⌜al.last '⌝ , al ≠ [], al0 ≠ [], m < # al0, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ # al0 < m, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ move(IOAut(startf, stepf))(sl1[m], ⌜al.last '⌝ , sl1.last) ∧ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[m]) ∧ ⌜al.butlast⌝ ≤ α ∧ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ #(x + y) = # x + # y; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 81 from proof finroot (previous step) (back to tree)

⌜al.butlast⌝ + ⌜x1⌝ ^ = ⌜al⌝ , ⌜x0⌝ ^ = ⌜al.butlast⌝ , x0 + x1 ≠ [], ⌜x1⌝ ^ ≠ ⌜al.last '⌝ , al ≠ [], x1 ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜x0⌝ + ⌜x1⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0 ⊦ move(IOAut(startf, stepf))(sl1[# x0], ⌜al.last '⌝ , sl1.last) ∧ after(IOAut(startf, stepf))(⌜al.butlast⌝ , sl1[# x0]) ∧ ⌜al.butlast⌝ ≤ α ∧ after(IOAut(startf, stepf))(⌜al⌝ , sl1.last)

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x⌝ + σ0 = ⌜x⌝ + σ1 ↔ σ0 = σ1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al, a, y

Proof step 82 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 83 from proof finroot (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ⌜al⌝ , ⌜al0⌝ ^

Proof step 84 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 85 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = # ⌜al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ n. ¬ # ⌜al0⌝ ^ < ⌜n⌝ → ⌜al0⌝ ^ to n = ⌜al⌝ to n ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 86 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜# al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ n. ¬ # al < n → ⌜al0⌝ ^ to n = ⌜al to n⌝ ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: # al - 1 abort: F discard: T computed: F

Additional information

Used terms: # al - 1

Proof step 87 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜# al⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ # al < # al - 1 → ⌜al0⌝ ^ to (# al - 1) = ⌜al to (# al - 1)⌝ , ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 88 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜# al⌝ , ⌜al0⌝ ^ to (# al - 1) = ⌜al to (# al - 1)⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [# al, n0]

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # al, m0

Proof step 89 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜# al⌝ , # al = n0 + 1, ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , # al ≠ 0, al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # x = 0 ↔ x = []; (s)

Proof step 90 from proof finroot (previous step) (back to tree)

# al = n0 + 1, # ⌜al0⌝ ^ = ⌜n0⌝ + ⌜1⌝ , ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

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] → [⌜al0⌝ , n0]

Additional information

Used terms: ⌜al0⌝ , n0

Proof step 91 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 92 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜n0⌝ + ⌜1⌝ , # al = n0 + 1, ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, ¬ # ⌜al0⌝ ^ < ⌜n0⌝ → (∃ m. ¬ # ⌜al0⌝ < ⌜m⌝ ∧ ⌜al0⌝ ^ to n0 = (⌜al0⌝ to m)^), ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ n∞0 + ⌜1⌝ = n∞ → (n∞ < n∞0 ↔ false); (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

Proof step 93 from proof finroot (previous step) (back to tree)

# al = n0 + 1, # ⌜al0⌝ ^ = ⌜n0⌝ + ⌜1⌝ , ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , ⌜al to n0⌝ = ⌜al0 to n⌝ ^, al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), ⌜al⌝ ≤ α, n ≤ # al0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last) ⊦ ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 94 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜n0⌝ + ⌜1⌝ , # al = n0 + 1, ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , ⌜al to n0⌝ = ⌜al0 to n⌝ ^, al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), n ≤ # al0, ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ n < # al0 ∧ ⌜al0 to n⌝ ^ = ⌜al.butlast⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s)

Proof step 95 from proof finroot (previous step) (back to tree)

# ⌜al0⌝ ^ = ⌜n0⌝ + ⌜1⌝ , # al = n0 + 1, ⌜al0⌝ ^ to n0 = ⌜al to n0⌝ , ⌜al to n0⌝ = ⌜al0 to n⌝ ^, al ≠ [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), startf(sl1[0]), n ≤ # al0, ⌜al⌝ ≤ α, ∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × sl1.last), ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ n < # al0 ∧ al to n0 = al.butlast

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[actionstream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [al, a0, al1]

Additional information

Used simplifier rules: ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ x + a ' ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + y to # x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) ⊦ # x = n → x to n = x; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ x to # x = x; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ m = m + n ↔ n = 0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al, a0, y

Proof step 96 from proof finroot (previous step) (back to tree)

⌜al⌝ × s0 ∈ [] × {sl0} , ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ (∃ α0, σ. α0 ^ = ⌜al⌝ ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last) ∧ ⌜al⌝ ≤ α ∧ (∀ _a0. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ × s0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: times-in: ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss; ⊦ ⌜[]⌝ = []; (s) ⊦ [] ≤ σ; (s) ⊦ s ∈ {sl} ↔ s ∈ sl; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ actstream(ασ × st) = ασ; (s)

Proof step 97 from proof finroot (previous step) (back to tree)

s0 ∈ sl0, ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ (∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last) ∧ ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × s0)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: s0 abort: F discard: T computed: T

Additional information

Used terms: s0

Proof step 98 from proof finroot (previous step) (back to tree)

s0 ∈ sl0, (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s0)) ↔ s0 ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last) ∧ ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × s0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 99 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s0), startf(s), s0 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ (∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last) ∧ ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × s0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 100 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s0), startf(s), s0 ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.l.last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s0, [], s, stepf, startf

Proof step 101 from proof finroot (previous step) (back to tree)

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

A spec-lemma

Proof step 102 from proof finroot (previous step) (back to tree)

startf(s), s0 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s0 = sl.last ∧ α ^ = [] ⊦ ∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ s0 = σ.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] ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 103 from proof finroot (previous step) (back to tree)

⌜al⌝ ^ = [], frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), sl1.last ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ α0, σ. α0 ^ = [] ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ startf(σ[0]) ∧ finp(α0) ∧ sl1.last = σ.l.last

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜al⌝ , ⌜sl1⌝ abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl1⌝

Proof step 104 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s0), startf(s), s0 ∈ sl0, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × s0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 105 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s0), startf(s), s0 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, [] × s0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infgraph-gen-basic[Koenigs-Lemma-gen-behact], name:edge-def, seq: ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b), subst:[b, a, es, vs] → [[] × s0, _a0, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))], <all paths>

Additional information

Used simplifier rules: ⊦ actstream(ασ × st) = ασ; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: [] × s0, _a0, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))

Proof step 106 from proof finroot (previous step) (back to tree)

⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)

A spec-lemma

Proof step 107 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ _s. ∀ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ↔ _a ∈ _s, ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: right 1

Additional information

Proof step 108 from proof finroot (previous step) (back to tree)

∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ sl0. ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Additional information

Used formulas: ∀ sl0. ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Proof step 109 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ sl0. ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: sl abort: F discard: T computed: T

Additional information

Used terms: sl

Proof step 110 from proof finroot (previous step) (back to tree)

∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 ⊦ ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 111 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: sl1

Proof step 112 from proof finroot (previous step) (back to tree)

∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 ⊦ ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 113 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 1 terms: s1 abort: F discard: T computed: T

Additional information

Used terms: s1

Proof step 114 from proof finroot (previous step) (back to tree)

(∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 115 from proof finroot (previous step) (back to tree)

¬ s1 ∈ sl1, (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 116 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), startf(s), ¬ s1 ∈ sl1, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s

Proof step 117 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), startf(s), ¬ s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 118 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), startf(s), ¬ s1 ∈ sl1, ¬ s ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: s

Additional information

Used terms: s

Proof step 119 from proof finroot (previous step) (back to tree)

s1 ∈ sl1, (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 120 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), s1 ∈ sl1, s ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s

Proof step 121 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), s ∈ sl, s1 ∈ sl1, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 122 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), s1 ∈ sl1, s ∈ sl, ¬ startf(s), ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: s

Additional information

Used terms: s

Proof step 123 from proof finroot (previous step) (back to tree)

∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∀ sl0. ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl, ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 124 from proof finroot (previous step) (back to tree)

∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl, ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1, left 3, right 1

Additional information

Proof step 125 from proof finroot (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: sl0

Additional information

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

Proof step 126 from proof finroot (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ [] ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s)

Proof step 127 from proof finroot (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. ¬ s1 ∈ sl

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) Used terms: []

Proof step 128 from proof finroot (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1) ⊦ ∃ sl1. ∀ s1. (∃ s0. s0 ∈ s + sl ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s)

Proof step 129 from proof finroot (previous step) (back to tree)

∀ startf, stepf. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: s, [] abort: F discard: F computed: T

Additional information

Used terms: s, []

Proof step 130 from proof finroot (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1), ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 131 from proof finroot (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ startf, stepf. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: startf, stepf

Proof step 132 from proof finroot (previous step) (back to tree)

(∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0 ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 133 from proof finroot (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: sl1 + sl0 abort: F discard: T computed: F

Additional information

Used terms: sl1 + sl0

Proof step 134 from proof finroot (previous step) (back to tree)

∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0 ⊦ ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1 + sl0

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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 135 from proof finroot (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 ⊦ (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1 ∨ s1 ∈ sl0

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s1

Proof step 136 from proof finroot (previous step) (back to tree)

(∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0 ⊦ (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1 ∨ s1 ∈ sl0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 137 from proof finroot (previous step) (back to tree)

¬ s1 ∈ sl1, ¬ s1 ∈ sl0, (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 138 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s0, [], s1), ¬ s1 ∈ sl1, ¬ s1 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, s0 = s ∨ s0 ∈ sl ⊦ ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s0

Proof step 139 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s0, [], s1), ¬ s1 ∈ sl1, ¬ s1 ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, s0 = s ∨ s0 ∈ sl ⊦ ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1), s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 140 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s, [], s1), ¬ s ∈ sl, ¬ s1 ∈ sl0, ¬ s1 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: s1

Additional information

Used terms: s1

Proof step 141 from proof finroot (previous step) (back to tree)

(∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, s1 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s

Proof step 142 from proof finroot (previous step) (back to tree)

(∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, s1 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1), (s = s ∨ s ∈ sl) ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 143 from proof finroot (previous step) (back to tree)

¬ move(IOAut(startf, stepf))(s, [], s1), (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, s1 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 144 from proof finroot (previous step) (back to tree)

¬ move(IOAut(startf, stepf))(s, [], s1), ¬ s1 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, s1 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1), ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 145 from proof finroot (previous step) (back to tree)

s1 ∈ sl0, ¬ move(IOAut(startf, stepf))(s, [], s1), ¬ s1 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1), ∃ s0. s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: s1

Additional information

Used terms: s1

Proof step 146 from proof finroot (previous step) (back to tree)

s1 ∈ sl1, ¬ move(IOAut(startf, stepf))(s, [], s1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1), s1 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 147 from proof finroot (previous step) (back to tree)

move(IOAut(startf, stepf))(s0, [], s1), s0 ∈ sl, s1 ∈ sl1, ¬ move(IOAut(startf, stepf))(s, [], s1), ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ s0. s0 ∈ sl ∧ move(IOAut(startf, stepf))(s0, [], s1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: s0

Additional information

Used terms: s0

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