| 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)))) |
⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s)
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
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)))
| ⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s) |
| 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 |
⊦ fin(IOAut(startf, stepf)) ↔ (∃ 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), ∀ 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
Used terms: stepf, startf
| ⊦ fin(IOAut(startf, stepf)) ↔ (∃ 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), ∀ 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 |
∀ 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
| ∀ 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 |
∀ α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
∀ α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
Used formulas: ∃ sl. ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl
| ∀ α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 |
∀ 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
| ∀ 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 |
∀ α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}
Used terms: [] × {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 ⊦ ∀ _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} |
∀ 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}
| ∀ 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} |
⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b))
∀ α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}
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)))
| ⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b)) |
| ∀ α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} |
∀ 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}
Used simplifier rules: ⊦ dom(vs × es) = vs; (s)
| ∀ 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} |
_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}
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: _a, ασ, st
| _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} |
∀ 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}
| ∀ 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} |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.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 ⊦ (∃ α, σ. α ^ = α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}
Used terms: s0, α1, stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.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 ⊦ (∃ α, σ. α ^ = α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} |
∀ 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}
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)
| ∀ 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} |
∀ α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}
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)
| ∀ α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} |
⌜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 ⊦
⌜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))
| ⌜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 ⊦ |
⌜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 ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ⌜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 ⊦ |
⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss
⌜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} ⊦
Used terms: {sl0} , [], ⌜al⌝ × σ.l.last
| ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss |
| ⌜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} ⊦ |
⌜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 ⊦
Used simplifier rules: ⊦ s ∈ {sl} ↔ s ∈ sl; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ actstream(ασ × st) = ασ; (s)
| ⌜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 ⊦ |
⌜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 ⊦
⌜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 ⊦
Used formulas: al = []
| ⌜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 ⊦ |
⌜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) ⊦
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ [] ≤ σ; (s)
| ⌜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) ⊦ |
⌜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) ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜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) ⊦ |
⌜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) ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜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) ⊦ |
⌜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) ⊦
Used terms: sl1.last
| ⌜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) ⊦ |
⌜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)
| ⌜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) |
⌜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)
Used terms: hd(sl1)
| ⌜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) |
⌜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)
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
| ⌜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) |
⌜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) ⊦
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)
| ⌜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) ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
⌜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 ∧ α ^ = []) ⊦
Used terms: (s0 ' + sl2).last, [], s0, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ⌜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 ∧ α ^ = []) ⊦ |
⌜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 ^ ≠ [] ⊦
Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜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 ^ ≠ [] ⊦ |
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
| ⌜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 ⊦ |
⌜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 ⊦
| ⌜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 ⊦ |
⌜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) ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜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) ⊦ |
⌜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) ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜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) ⊦ |
⌜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⌝ ⊦
⌜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⌝
Used formulas: ∃ m. m < # al0 ∧ ⌜al0 to m⌝ ^ = ⌜al.butlast⌝
| ⌜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⌝ ⊦ |
⌜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) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜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) ⊦ |
⌜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)
Used terms: ⌜al0 to m⌝ ^ × sl1[m]
| ⌜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) |
⌜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)
| ⌜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) |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
⌜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))
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))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| ⌜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)) |
⌜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)
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)
| ⌜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) |
⌜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)
⌜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)
Used formulas: ⌜al0 from m⌝ ^ = ⌜al.last '⌝
| ⌜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) |
⌜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) ⊦
⌜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) ⊦
⌜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) ⊦
⌜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) ⊦
| ⌜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) ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
⌜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 '⌝ ) ⊦
Used terms: sl1.last, ⌜al.last '⌝ , sl1[m], stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ⌜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 '⌝ ) ⊦ |
⌜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 '⌝ ⊦
Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜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 '⌝ ⊦ |
⌜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 '⌝ ⊦
Used terms: ⌜al0 from m⌝ , sl1 from m
| ⌜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 '⌝ ⊦ |
⌜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) ⊦
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)
| ⌜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) ⊦ |
⌜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 ⊦
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
| ⌜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 ⊦ |
⌜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) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' ≠ []; (s)
| ⌜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) ⊦ |
⊦ n ≤ # x → x + y from n = (x from n) + y
⌜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 ⊦
Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: m, s0 ', sl2
| ⊦ n ≤ # x → x + y from n = (x from n) + y |
| ⌜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 ⊦ |
⌜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 ⊦
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)
| ⌜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 ⊦ |
⌜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) ⊦
Used simplifier rules: ⊦ m < n → m ≤ n; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m, # sl2, n0
| ⌜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) ⊦ |
⌜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 ⊦
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)
| ⌜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 ⊦ |
⌜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) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| ⌜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) ⊦ |
⌜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 ⊦
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)
| ⌜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 ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
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
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| ⌜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) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜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) ⊦
Used terms: sl1[m], ⌜al.butlast⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜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) ⊦ |
⌜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
Used terms: ⌜al0 to m⌝ , ⌜sl1 to m + 1⌝
| ⌜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 |
⌜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
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)
| ⌜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 |
⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ¬ # al < n → (frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ↔ true)
⌜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
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) Used terms: startf, stepf, sl1, al0, m
| ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ¬ # al < n → (frag(IOAut(startf, stepf))(⌜sl to n + 1⌝ , ⌜al to n⌝ ) ↔ true) |
| ⌜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 |
⌜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 ⊦
Used simplifier rules: ⊦ m < n → ¬ n < m; (s)
| ⌜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 ⊦ |
m < # x ⊦ x to m + 1 = (x to m) + x[m] '
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
| m < # x ⊦ x to m + 1 = (x to m) + x[m] ' |
| ⌜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) ⊦ |
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
| ⌜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) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜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) ⊦
Used terms: sl1.last, ⌜al⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜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) ⊦ |
⌜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 ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜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 ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al0⌝ , ⌜sl1⌝
| ⌜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) |
# 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)
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
| # 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) |
⌜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)
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)
| ⌜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) |
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
| ⌜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⌝ |
⌜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⌝
| ⌜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⌝ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n)
# ⌜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⌝
Used terms: ⌜al⌝ , ⌜al0⌝ ^
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n) |
| # ⌜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⌝ |
# ⌜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⌝
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # ⌜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⌝ |
# ⌜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⌝
Used terms: # al - 1
| # ⌜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⌝ |
# ⌜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⌝
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)
| # ⌜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⌝ |
# ⌜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⌝
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # al, m0
| # ⌜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⌝ |
# 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⌝
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)
| # 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⌝ |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
# ⌜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⌝
Used terms: ⌜al0⌝ , n0
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| # ⌜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⌝ |
# 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⌝
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
| # 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⌝ |
# ⌜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⌝
Used terms: n
| # ⌜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⌝ |
# ⌜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
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s)
| # ⌜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 |
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
| ⌜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)) |
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)
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)
| 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) |
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)
Used terms: s0
| 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) |
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)
| 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) |
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
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) ⊦
| 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 |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
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
Used terms: s0, [], s, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| 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 |
⌜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
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)
| ⌜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 |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl1⌝
| 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) ⊦ |
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) ⊦
| 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) ⊦ |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
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))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| ∀ α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 |
∀ 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
| ∀ 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 |
∀ α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
∀ α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
Used formulas: ∀ sl0. ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl
| ∀ α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 |
∀ 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
Used terms: 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), ∃ 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 |
∀ 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
| ∀ 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 |
∀ 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
Used terms: 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), ∀ s1. (∃ s. s ∈ sl ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 ⊦ ∀ s1. (∃ s. startf(s) ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl1 |
∀ 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
| ∀ 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 |
(∃ 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
Used terms: s1
| (∃ 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 |
¬ 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) ⊦
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)
| ¬ 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) ⊦ |
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)
| 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) |
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)
Used terms: s
| 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) |
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) ⊦
| 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) ⊦ |
Used terms: s
| 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) |
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)
| 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) |
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)
Used terms: s
| 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) |
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) ⊦
| 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) ⊦ |
Used terms: s
| ∀ α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 |
∀ 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
| ∀ 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 |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ sl0 ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ [] ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl
∀ 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
Used simplifier rules: statelist freely generated by [], +;;
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. (∃ s. s ∈ [] ∧ move(IOAut(startf, stepf))(s, [], s1)) ↔ s1 ∈ sl |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. ¬ s1 ∈ sl
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s1. ¬ s1 ∈ sl |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) Used terms: []
| ∀ 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 |
∀ 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
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)
| ∀ 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 |
∀ 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
Used terms: s, []
| ∀ 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 |
∀ 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
| ∀ 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 |
(∀ 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
Used terms: 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, ∀ s2. move(IOAut(startf, stepf))(s, [], s2) ↔ s2 ∈ sl0 ⊦ ∃ sl1. ∀ s1. (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1 |
∀ 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
| ∀ 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 |
∀ 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
Used terms: sl1 + sl0
| ∀ 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 |
∀ 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
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ∀ 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 |
(∃ 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
Used terms: 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 ⊦ (∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1)) ↔ s1 ∈ sl1 ∨ s1 ∈ sl0 |
¬ 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) ⊦
(∃ 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)
| ¬ 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) ⊦ |
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)
| 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) |
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)
Used terms: s0
| 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) |
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)
| 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) |
Used terms: 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 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], 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 ∈ sl1 ∨ s1 ∈ sl0 ⊦ ∃ s0. (s0 = s ∨ s0 ∈ sl) ∧ move(IOAut(startf, stepf))(s0, [], s1), (s = s ∨ s ∈ sl) ∧ move(IOAut(startf, stepf))(s, [], s1)
Used terms: s
| (∃ 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) |
¬ 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)
| ¬ 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) |
¬ 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)
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)
| ¬ 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) |
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)
| 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) |
Used terms: s1
| 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) |
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)
| 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) |
Used terms: s0
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.