| ⊦ trace(IOAut(startf, stepf))(β) ↔ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(β) |
⊦ trace(IOAut(startf, stepf))(β) ↔ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β)
| ⊦ trace(IOAut(startf, stepf))(β) ↔ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β) |
trace(IOAut(startf, stepf))(β) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β)
¬ trace(IOAut(startf, stepf))(β), trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β) ⊦
| trace(IOAut(startf, stepf))(β) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β) |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
∃ σ, β0. β = β0 ^ ∧ exec(IOAut(startf, stepf))(σ, β0) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β)
Used terms: β, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| ∃ σ, β0. β = β0 ^ ∧ exec(IOAut(startf, stepf))(σ, β0) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β) |
frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β0 ^)
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β0 ^) |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ ∃ σ, β. β0 ^ = β ^ ∧ exec(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β)
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), β0 ^
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ ∃ σ, β. β0 ^ = β ^ ∧ exec(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) |
frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ ∃ σ0, β. β0 ^ = β ^ ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ0, β) ∧ startf(σ0[0])
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ ∃ σ0, β. β0 ^ = β ^ ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ0, β) ∧ startf(σ0[0]) |
frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ β0 ^ = β0 ^ ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ∧ startf(σ[0])
Used terms: σ, β0
| frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ β0 ^ = β0 ^ ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ∧ startf(σ[0]) |
frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0)
| frag(IOAut(startf, stepf))(σ, β0), startf(σ[0]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0)
Used terms: β0, σ, stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) |
# σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0)
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ # σ = # β0 + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)))
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β0
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ # σ = # β0 + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1))) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ σ[n] = σ[n + 1] ∧ β0[n] = τ ∧ ¬ stepf(σ[n + 1], a, s1)
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ⊦ σ[n] = σ[n + 1] ∧ β0[n] = τ ∧ ¬ stepf(σ[n + 1], a, s1) |
Used terms: n
| ¬ trace(IOAut(startf, stepf))(β), trace(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(β) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
¬ trace(IOAut(startf, stepf))(β), ∃ σ, β0. β = β0 ^ ∧ exec(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), β
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| ¬ trace(IOAut(startf, stepf))(β), ∃ σ, β0. β = β0 ^ ∧ exec(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
startf(σ[0]), ¬ trace(IOAut(startf, stepf))(β0 ^), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| startf(σ[0]), ¬ trace(IOAut(startf, stepf))(β0 ^), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
startf(σ[0]), ∀ σ, β. ¬(β0 ^ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
Used terms: β0 ^, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| startf(σ[0]), ∀ σ, β. ¬(β0 ^ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used formulas: ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
| startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
| ⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β), ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ β ^ = (β to n)^
⌜n⌝ < # β0, startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β0) ∧ ⌜n⌝ < # σ ∧ (∀ a, s. ¬ stepf(σ[n], a, s))
β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦
Used terms: startf, stepf, σ, β0, n
| frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β), ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ β ^ = (β to n)^ |
| ⌜n⌝ < # β0, startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β0) ∧ ⌜n⌝ < # σ ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) |
⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ⌜n⌝ < # σ ∧ ¬ stepf(σ[n], a, s)
| ⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ⌜n⌝ < # σ ∧ ¬ stepf(σ[n], a, s) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0) ⊦ ⌜n⌝ < # σ ∧ ¬ stepf(σ[n], a, s)
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β0
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0) ⊦ ⌜n⌝ < # σ ∧ ¬ stepf(σ[n], a, s) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), stepf(σ[n], a, s), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a0. stepf(σ[n0 + 1], a0, s1)) ⊦
Used simplifier rules: ⊦ n∞ = n∞0 + ⌜1⌝ ∧ ⌜n⌝ < n∞0 → (⌜n⌝ < n∞ ↔ true); (ss) 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 ⊦ m +1 = m + 1; (s)
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), stepf(σ[n], a, s), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a0. stepf(σ[n0 + 1], a0, s1)) ⊦ |
Used terms: s, a
| β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ |
β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), β0 ^ ≠ (β0 to n)^ ∨ ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦
Used terms: σ to n + 1, β0 to n
| β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), β0 ^ ≠ (β0 to n)^ ∨ ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦ |
β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦
| β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β0
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n) ∨ ¬ startf((σ to n + 1)[0]) ⊦ |
# σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (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 ⊦ n∞ = n∞0 + ⌜1⌝ ∧ ⌜n⌝ < n∞0 → (⌜n⌝ < n∞ ↔ true); (ss) ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ¬ frag(IOAut(startf, stepf))(σ to n + 1, β0 to n), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), #(σ to n + 1) ≠ #(β0 to n) + ⌜1⌝ ∨ (∃ n0. ¬(⌜n0⌝ < #(β0 to n) → stepf((σ to n + 1)[n0], (β0 to n)[n0], (σ to n + 1)[n0 +1]))) ⊦
Used terms: startf, stepf, σ to n + 1, β0 to n
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, ⌜n⌝ < # β0, startf(σ[0]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]), #(σ to n + 1) ≠ #(β0 to n) + ⌜1⌝ ∨ (∃ n0. ¬(⌜n0⌝ < #(β0 to n) → stepf((σ to n + 1)[n0], (β0 to n)[n0], (σ to n + 1)[n0 +1]))) ⊦ |
# σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, n0 < n, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (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 ⊦ n∞ = n∞0 + ⌜1⌝ ∧ ⌜n⌝ < n∞0 → (⌜n⌝ < n∞ ↔ true); (ss) ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m +1 = m + 1; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s)
| # σ = # β0 + ⌜1⌝ , β0 ^ = (β0 to n)^, n0 < n, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ s0, a. ¬ stepf(σ[n], a, s0), ∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]) ⊦ |
Used terms: n0
| startf(σ[0]), ∀ σ0, β. β0 ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), β0 ^ ≠ β0 ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β0) ∨ ¬ startf(σ[0]) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used terms: σ, β0
| startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), β0 ^ ≠ β0 ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β0) ∨ ¬ startf(σ[0]) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
startf(σ[0]), ¬ frag(IOAut(startf, stepf))(σ, β0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
| startf(σ[0]), ¬ frag(IOAut(startf, stepf))(σ, β0), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), # σ ≠ # β0 + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used terms: β0, σ, stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), # σ ≠ # β0 + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), # σ ≠ # β0 + ⌜1⌝ ∨ ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1])) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| startf(σ[0]), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β0), # σ ≠ # β0 + ⌜1⌝ ∨ ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1])) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), # σ ≠ # β0 + ⌜1⌝ ∨ ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1])) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β0
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β0 + ⌜1⌝ , startf(σ[0]), ∀ n. ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), # σ ≠ # β0 + ⌜1⌝ ∨ ¬(⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1])) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used simplifier rules: <; (wellfounded) Used terms: n
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used terms: n
| # σ = # β0 + ⌜1⌝ , ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], β0[n], σ[n + 1]), ⌜n⌝ < # β0 → stepf(σ[n], β0[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β0[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1)
| # σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1) |
# σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
Used terms: n
| # σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1), ¬ stepf(σ[n], a, s0) ∧ (n0 < n → stepf(σ[n0], β0[n0], σ[n0 + 1]))
| # σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1), ¬ stepf(σ[n], a, s0) ∧ (n0 < n → stepf(σ[n0], β0[n0], σ[n0 + 1])) |
# σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], ⌜n⌝ < # β0, startf(σ[0]), stepf(σ[n], a, s0), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
# σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], n0 < n, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))
| # σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], ⌜n⌝ < # β0, startf(σ[0]), stepf(σ[n], a, s0), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
Used terms: s0, a
| # σ = # β0 + ⌜1⌝ , β0[n] = τ, σ[n] = σ[n + 1], n0 < n, ⌜n⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ s1, a. stepf(σ[n], a, s1), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])) |
# σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, n0 < n, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1)
Used simplifier rules: lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → ¬ n < m; (s) Used terms: n0, σ, β0, startf, stepf
| # σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, n0 < n, startf(σ[0]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ¬ stepf(σ[n], τ, σ[n]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1) |
# σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, n0 < n, ⌜n1⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ m. m < n1 → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n1], a, s0), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| # σ = # β0 + ⌜1⌝ , σ[n] = σ[n + 1], β0[n] = τ, ⌜n⌝ < # β0, n0 < n, ⌜n1⌝ < # β0, startf(σ[0]), ¬ stepf(σ[n], τ, σ[n]), ¬ stepf(σ[n0], β0[n0], σ[n0 + 1]), ∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ m. m < n1 → stepf(σ[m], β0[m], σ[m + 1]), ∀ s0, a. ¬ stepf(σ[n1], a, s0), ∀ n1, σ, β0, startf, stepf. n1 < n → # σ = # β0 + ⌜1⌝ ∧ ⌜n1⌝ < # β0 ∧ startf(σ[0]) ∧ ¬ stepf(σ[n1], β0[n1], σ[n1 + 1]) ∧ (∀ n0. ⌜n0⌝ < # β0 → stepf(σ[n0], β0[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β0[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1))) → (∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1]))) ⊦ ∃ n. ⌜n⌝ < # β0 ∧ (∀ s0, a. ¬ stepf(σ[n], a, s0)) ∧ (∀ m. m < n → stepf(σ[m], β0[m], σ[m + 1])), ∃ s1, a. stepf(σ[n], a, s1) |
Used terms: n1
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.