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

fin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ finout ( (λ α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:finout-def, seq: ⊦ finout(g) ↔ (∀ a. ∃ s. ∀ b. edge(g)(a, b) ↔ b ∈ 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 finout (previous step) (back to tree)

⊦ finout(g) ↔ (∀ a. ∃ s. ∀ b. edge(g)(a, b) ↔ b ∈ s)

A spec-lemma

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

fin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∀ _a. ∃ _s. ∀ b. 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)))) (_a, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

fin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ ∃ _s. ∀ b. 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)))) (_a, b) ↔ b ∈ _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 5 from proof finout (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 6 from proof finout (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. ∀ b. 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)))) (_a, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof finout (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. ∀ b. 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)))) (_a, b) ↔ b ∈ _s

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: _a

Additional information

Used simplifier rules: afterpair freely generated by ×;;

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

_a = β × 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 ⊦ ∃ _s. ∀ b. 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)))) (_a, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof finout (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. ∀ b. 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)))) (β × s0, b) ↔ b ∈ _s

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: β

Additional information

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

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

β = ⌜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 ⊦ ∃ _s. ∀ b. 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)))) (β × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 11 from proof finout (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. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: ⌜al0⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al0⌝

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

finp(⌜al0⌝ ) ∧ ⌜al0⌝ ≤ α → trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)

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

⌜al0⌝ ≤ α → trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜al0⌝ ≤ α

Additional information

Used formulas: ⌜al0⌝ ≤ α

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

⌜al0⌝ ≤ α, ⌜al0⌝ ≤ α → trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜al0⌝ ≤ α, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:prefix-def, seq: ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2), subst:[σ2, σ1] → [α, ⌜al0⌝ ], <all paths>

Additional information

Used terms: α, ⌜al0⌝

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

⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)

A spec-lemma

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

trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∃ α0. ⌜al0⌝ + α0 = α ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α0 = []

Additional information

Used formulas: α0 = []

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s)

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

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

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ∅

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

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] → [b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ ∧ finp(actstream(αs))], <all paths>

Additional information

Used terms: b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ ∧ finp(actstream(αs))

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

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

A spec-lemma

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

after(IOAut(startf, stepf))(actstream(⌜al0⌝ × s0), endstate(⌜al0⌝ × s0)), after(IOAut(startf, stepf))(actstream(b), endstate(b)), finp(actstream(⌜al0⌝ × s0)), finp(actstream(b)), trace(IOAut(startf, stepf))(⌜al0⌝ ), actstream(⌜al0⌝ × s0) ≤ ⌜al0⌝ , actstream(b) ≤ ⌜al0⌝ , ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl, ∃ a. actstream(b) = actstream(⌜al0⌝ × s0) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜al0⌝ × s0), ⌜a '⌝ , endstate(b)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ σ ≤ σ; (s)

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

⌜al0⌝ + ⌜a '⌝ = actstream(b), after(IOAut(startf, stepf))(⌜al0⌝ , s0), after(IOAut(startf, stepf))(actstream(b), endstate(b)), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , endstate(b)), trace(IOAut(startf, stepf))(⌜al0⌝ ), actstream(b) ≤ ⌜al0⌝ , ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦

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] → [b, α, s3]

Additional information

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

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

⌜al0⌝ + ⌜a '⌝ = α, b = α × s3, after(IOAut(startf, stepf))(α, s3), after(IOAut(startf, stepf))(⌜al0⌝ , s0), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s3), trace(IOAut(startf, stepf))(⌜al0⌝ ), α ≤ ⌜al0⌝ , ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof finout (previous step) (back to tree)

after(IOAut(startf, stepf))(⌜al0⌝ , s0), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s3), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s3), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜al0⌝ , ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:prefix-def, seq: ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2), subst:[σ2, σ1] → [⌜al0⌝ , ⌜al0⌝ + ⌜a '⌝ ], <all paths>

Additional information

Used simplifier rules: ⊦ σ + σ0 = σ ↔ σ0 = [] ∨ # σ = ∞; (s) ⊦ ⌜a '⌝ + σ ≠ []; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ ≠ ∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜al0⌝ , ⌜al0⌝ + ⌜a '⌝

Proof step 28 from proof finout (previous step) (back to tree)

⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)

A spec-lemma

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

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: s0, ⌜hd(α0) '⌝ abort: F discard: T computed: F

Additional information

Used terms: s0, ⌜hd(α0) '⌝

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: after(IOAut(startf, stepf))(⌜al0⌝ , s0)

Additional information

Used formulas: after(IOAut(startf, stepf))(⌜al0⌝ , s0)

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

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

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al0 + hd(α0)⌝ × {sl0} abort: F discard: T computed: F

Additional information

Used terms: ⌜al0 + hd(α0)⌝ × {sl0}

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

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

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

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

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] → [b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ + α0 ∧ finp(actstream(αs))], <all paths>

Additional information

Used terms: b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ + α0 ∧ finp(actstream(αs))

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

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

A spec-lemma

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

α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ a. actstream(b) = actstream(⌜al0⌝ × s0) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜al0⌝ × s0), ⌜a '⌝ , endstate(b))) ∧ ( after(IOAut(startf, stepf))(actstream(⌜al0⌝ × s0), endstate(⌜al0⌝ × s0)) ∧ actstream(⌜al0⌝ × s0) ≤ ⌜al0⌝ + α0 ∧ finp(actstream(⌜al0⌝ × s0))) ∧ after(IOAut(startf, stepf))(actstream(b), endstate(b)) ∧ actstream(b) ≤ ⌜al0⌝ + α0 ∧ finp(actstream(b)) ↔ b ∈ (⌜al0⌝ + ⌜hd(α0) '⌝ ) × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ1 ≤ σ1 + σ2; (s) ⊦ endstate(ασ × st) = st; (s)

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

α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0 ⊦ (∃ a. actstream(b) = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , endstate(b))) ∧ after(IOAut(startf, stepf))(actstream(b), endstate(b)) ∧ actstream(b) ≤ ⌜al0⌝ + α0 ∧ finp(actstream(b)) ↔ b ∈ (⌜al0⌝ + ⌜hd(α0) '⌝ ) × {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] → [b, α, s1]

Additional information

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

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

b = α × s1, α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ b ∈ (⌜al0⌝ + ⌜hd(α0) '⌝ ) × {sl0}

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof finout (previous step) (back to tree)

α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0 ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ α × s1 ∈ (⌜al0⌝ + ⌜hd(α0) '⌝ ) × {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} , ⌜al0⌝ + ⌜hd(α0) '⌝ , α × s1], <all paths>

Additional information

Used terms: {sl0} , ⌜al0⌝ + ⌜hd(α0) '⌝ , α × s1

Proof step 40 from proof finout (previous step) (back to tree)

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

Lemma times-in

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

α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ actstream(α × s1) = ⌜al0⌝ + ⌜hd(α0) '⌝ ∧ endstate(α × s1) ∈ {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) ⊦ actstream(ασ × st) = ασ; (s)

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

α0 ≠ [], after(IOAut(startf, stepf))(⌜al0⌝ , s0), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0 ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ α = ⌜al0⌝ + ⌜hd(α0) '⌝ ∧ s1 ∈ 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, ⌜al0⌝ , stepf, startf], <all paths>

Additional information

Used terms: s0, ⌜al0⌝ , stepf, startf

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

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

A spec-lemma

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

α0 ≠ [], trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(s0, ⌜hd(α0) '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∃ α, σ. α ^ = ⌜al0⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s0 = σ.l.last ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ α = ⌜al0⌝ + ⌜hd(α0) '⌝ ∧ s1 ∈ sl0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [α0, a0, α1]

Additional information

Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: α0, a0, α1

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

⌜al⌝ ^ = ⌜al0⌝ , α0 = a0 + α1, α0 ≠ [], frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + α0 ∧ finp(α) ↔ α = ⌜al0⌝ + ⌜a0 '⌝ ∧ s1 ∈ sl0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ⌜a '⌝ + σ ≠ []; (s)

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + ⌜a0 '⌝ + α1 ∧ finp(α) ↔ α = ⌜al0⌝ + ⌜a0 '⌝ ∧ s1 ∈ sl0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

⌜al⌝ ^ = ⌜al0⌝ , after(IOAut(startf, stepf))(α, s1), finp(α), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), α ≤ ⌜al0⌝ + ⌜a0 '⌝ + α1, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1) ⊦ α = ⌜al0⌝ + ⌜a0 '⌝ ∧ s1 ∈ sl0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + y = x + z ↔ y = z; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜x0⌝ + ⌜z⌝ ↔ x + y = x0 + z; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ ⌜x⌝ + σ1 ≤ ⌜x⌝ + σ2 ↔ σ1 ≤ σ2; (s)

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

⌜al⌝ ^ = ⌜al0⌝ , after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s1), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜a '⌝ ≤ ⌜a0 '⌝ + α1, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ a = a0 ∧ 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 50 from proof finout (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ , σ = ⌜sl1⌝ , after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s1), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜a '⌝ ≤ ⌜a0 '⌝ + α1, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ a = a0 ∧ s1 ∈ sl0

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

⌜al⌝ ^ = ⌜al0⌝ , after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s1), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , s1), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜a '⌝ ≤ ⌜a0 '⌝ + α1, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ a = a0 ∧ s1 ∈ 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] → [s1, ⌜al0⌝ + ⌜a '⌝ , stepf, startf], <all paths>

Additional information

Used terms: s1, ⌜al0⌝ + ⌜a '⌝ , stepf, startf

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

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

A spec-lemma

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , s1), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜a '⌝ ≤ ⌜a0 '⌝ + α1, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∃ α, σ. α ^ = ⌜al0⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s1 = σ.l.last ⊦ a = a0 ∧ s1 ∈ sl0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜al1⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , σ.l.last), startf(sl1[0]), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ⌜a '⌝ ≤ ⌜a0 '⌝ + α1, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ a = a0 ∧ σ.l.last ∈ sl0

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:prefix-def, seq: ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2), subst:[σ2, σ1] → [⌜a0 '⌝ + α1, ⌜a '⌝ ], <all paths>

Additional information

Used terms: ⌜a0 '⌝ + α1, ⌜a '⌝

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

⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)

A spec-lemma

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

⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , frag(IOAut(startf, stepf))(σ, ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , σ.l.last), startf(σ[0]), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∃ α. ⌜a '⌝ + α = ⌜a0 '⌝ + α1 ⊦ a = a0 ∧ σ.l.last ∈ sl0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜al0⌝ + ⌜a0 '⌝ , frag(IOAut(startf, stepf))(σ, ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , σ.l.last), startf(σ[0]), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), ¬ σ.l.last ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: σ.l.last

Additional information

Used terms: σ.l.last

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

⌜al⌝ ^ = ⌜al0⌝ , α = ⌜al0⌝ + ⌜a0 '⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ (∃ a. α = ⌜al0⌝ + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s1)) ∧ after(IOAut(startf, stepf))(α, s1) ∧ α ≤ ⌜al0⌝ + ⌜a0 '⌝ + α1 ∧ finp(α)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ σ1 ≤ σ1 + σ2; (s) ⊦ ⌜x⌝ + σ1 ≤ ⌜x⌝ + σ2 ↔ σ1 ≤ σ2; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + y = x + z ↔ y = z; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜x0⌝ + ⌜z⌝ ↔ x + y = x0 + z; (s)

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1) ∧ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a0 '⌝ , s1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: s1

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

move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1) ↔ s1 ∈ sl0, ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1) ∧ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a0 '⌝ , s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ¬ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a0 '⌝ , s1), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ 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] → [s1, ⌜al0⌝ + ⌜a0 '⌝ , stepf, startf], <all paths>

Additional information

Used terms: s1, ⌜al0⌝ + ⌜a0 '⌝ , stepf, startf

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

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

A spec-lemma

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ α, σ. ¬(α ^ = ⌜al0⌝ + ⌜a0 '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s1 = σ.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 64 from proof finout (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ α, σ0. α ^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ s1 ≠ σ0.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 65 from proof finout (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ , σ = ⌜sl1⌝ , frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s1), startf(σ[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ α, σ0. α ^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ s1 ≠ σ0.l.last, ∀ s2. move(IOAut(startf, stepf))(σ.l.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦

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

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s1), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ α, σ0. α ^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ s1 ≠ σ0.l.last, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

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, s1, ⌜a0 '⌝ , sl1.last], <all paths>

Additional information

Used terms: s1, ⌜a0 '⌝ , sl1.last, stepf, startf

Proof step 67 from proof finout (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 68 from proof finout (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), s1 ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(sl1.last, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ α, σ0. α ^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ s1 ≠ σ0.l.last, ∀ s. startf(s) ↔ s ∈ sl, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ sl1.last = sl[0] ∧ s1 = sl.last ∧ α ^ = ⌜a0 '⌝ ⊦

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

sl1.last = sl2[0], ⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ α, σ0. α ^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ sl2.last ≠ σ0.l.last, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: ⌜al⌝ + ⌜al1⌝ , ⌜sl1.butlast⌝ + ⌜sl2⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al⌝ + ⌜al1⌝ , ⌜sl1.butlast⌝ + ⌜sl2⌝

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

sl1.last = sl2[0], ⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜a0 '⌝ , frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, (⌜al⌝ + ⌜al1⌝ )^ ≠ ⌜al0⌝ + ⌜a0 '⌝ ∨ ¬ frag(IOAut(startf, stepf))(⌜sl1.butlast⌝ + ⌜sl2⌝ , ⌜al⌝ + ⌜al1⌝ ) ∨ ¬ startf((⌜sl1.butlast⌝ + ⌜sl2⌝ )[0]) ∨ ¬ finp(⌜al⌝ + ⌜al1⌝ ) ∨ sl2.last ≠ (⌜sl1.butlast⌝ + ⌜sl2⌝ ).l.last ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜x⌝ .l = x; (s) finp(σ) ⊦ (⌜x⌝ + σ).l = x + σ.l; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

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

sl1.last = sl2[0], ⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜a0 '⌝ , frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ¬ frag(IOAut(startf, stepf))(⌜sl1.butlast⌝ + ⌜sl2⌝ , ⌜al⌝ + ⌜al1⌝ ) ∨ ¬ startf((sl1.butlast + sl2)[0]) ∨ sl2.last ≠ (sl1.butlast + sl2).last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

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

sl1.last = sl2[0], ⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ frag(IOAut(startf, stepf))(⌜sl1.butlast⌝ + ⌜sl2⌝ , ⌜al⌝ + ⌜al1⌝ ), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:frag-trans, seq:frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ frag(IOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ ), subst:[al, stepf, sl0, sl, al0, startf] → [al, stepf, sl2, sl1, al1, startf]

Additional information

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

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

frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), sl0[0] = sl.last ⊦ frag(IOAut(startf, stepf))(⌜sl.butlast⌝ + ⌜sl0⌝ , ⌜al⌝ + ⌜al0⌝ )

A spec-lemma

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

sl1.last = sl2[0], ⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ startf((sl1.butlast + sl2)[0]), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

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, sl3]

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

⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜a0 '⌝ , s0 = sl2[0], sl1 = sl3 + s0 ', sl1 ≠ [], frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ startf((sl3 + sl2)[0]), ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦

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

⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl3⌝ + ⌜sl2[0] '⌝ , ⌜al⌝ ), startf((sl3 + sl2[0] ')[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ startf((sl3 + sl2)[0]), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, sl2[0] ', sl3], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: 0, sl2[0] ', sl3

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

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

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

⌜al⌝ ^ = ⌜al0⌝ , ⌜al1⌝ ^ = ⌜a0 '⌝ , 0 < # sl3, frag(IOAut(startf, stepf))(⌜sl3⌝ + ⌜sl2[0] '⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), startf(sl3[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ startf((sl3 + sl2)[0]), ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

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

⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , sl3 ≠ [], frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl3⌝ + ⌜sl2[0] '⌝ , ⌜al⌝ ), startf(hd(sl3)), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ¬ startf((sl3 + sl2)[0]), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

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

sl1.last = sl2[0], ⌜al1⌝ ^ = ⌜a0 '⌝ , ⌜al⌝ ^ = ⌜al0⌝ , sl2.last ≠ (sl1.butlast + sl2).last, frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al1⌝ ), startf(sl1[0]), trace(IOAut(startf, stepf))(⌜al0⌝ ), sl2.last ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(sl2[0], ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl2, s0, y

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

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [α0, a0, α]

Additional information

Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: α0, a0, α

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ⌜a '⌝ + σ ≠ []; (s)

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

trace(IOAut(startf, stepf))(⌜al0⌝ ), ¬ after(IOAut(startf, stepf))(⌜al0⌝ , s0), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s0, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0 ⊦ ∃ _s. ∀ b. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜al0⌝ + ⌜a0 '⌝ + α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0⌝ × s0, b) ↔ b ∈ _s

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ∅

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

trace(IOAut(startf, stepf))(⌜al0⌝ ), ¬ after(IOAut(startf, stepf))(⌜al0⌝ , s0), ∀ s2. move(IOAut(startf, stepf))(s0, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∀ b. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜al0⌝ + ⌜a0 '⌝ + α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0⌝ × s0, b) ↔ b ∈ ∅

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

trace(IOAut(startf, stepf))(⌜al0⌝ ), ¬ after(IOAut(startf, stepf))(⌜al0⌝ , s0), ∀ s. startf(s) ↔ s ∈ sl, ∀ s2. move(IOAut(startf, stepf))(s0, ⌜a0 '⌝ , s2) ↔ s2 ∈ sl0, edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜al0⌝ + ⌜a0 '⌝ + α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0⌝ × s0, b) ⊦

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] → [b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ + ⌜a0 '⌝ + α ∧ finp(actstream(αs))], <all paths>

Additional information

Used simplifier rules: ⊦ σ1 ≤ σ1 + σ2; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ finp(⌜x⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s) Used terms: b, ⌜al0⌝ × s0, λ α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) ≤ ⌜al0⌝ + ⌜a0 '⌝ + α ∧ finp(actstream(αs))

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

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

A spec-lemma

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

¬ ⌜al0⌝ ≤ α, ⌜al0⌝ ≤ α → trace(IOAut(startf, stepf))(⌜al0⌝ ), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

¬ ⌜al0⌝ ≤ α, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ _s. ∀ b. 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⌝ × s0, b) ↔ b ∈ _s

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ∅

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

¬ ⌜al0⌝ ≤ α, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. startf(s) ↔ s ∈ sl ⊦ ∀ b. 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⌝ × s0, b) ↔ b ∈ ∅

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

¬ ⌜al0⌝ ≤ α, ∀ s. startf(s) ↔ s ∈ sl, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ 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)))) (⌜al0⌝ × s0, b) ⊦

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] → [b, ⌜al0⌝ × s0, λ α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: ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) Used terms: b, ⌜al0⌝ × s0, λ α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 91 from proof finout (previous step) (back to tree)

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

A spec-lemma

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

β = ⌜af0⌝ , ∀ α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. ∀ b. 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)))) (β × s0, b) ↔ b ∈ _s

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 93 from proof finout (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. ∀ b. 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)))) (⌜af0⌝ × s0, b) ↔ b ∈ _s

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ∅

Proof step 94 from proof finout (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 ⊦ ∀ b. 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)))) (⌜af0⌝ × s0, b) ↔ b ∈ ∅

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 95 from proof finout (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), 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)))) (⌜af0⌝ × s0, b) ⊦

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] → [b, ⌜af0⌝ × s0, λ α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: ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) Used terms: b, ⌜af0⌝ × s0, λ α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 96 from proof finout (previous step) (back to tree)

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

A spec-lemma

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