| 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)^ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β) ⊦
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s0, a. stepf(s, a, s0))))(σ, β) ⊦ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ
Used formulas: ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ¬ # β < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ)
Used terms: β, n
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ¬ # β < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ) |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ)
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β + ⌜1⌝ , β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ)
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β + ⌜1⌝ , β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ) |
# σ = # β + ⌜1⌝ , β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ)
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β + ⌜1⌝ , β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ) |
β ^ ≠ (β to n)^, ⌜n⌝ < # β + ⌜1⌝ , ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ)
| β ^ ≠ (β to n)^, ⌜n⌝ < # β + ⌜1⌝ , ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ¬ # β < ⌜n⌝ ∧ (n ≤ n0 ∧ ⌜n0⌝ < # β → β[n0] = τ) |
β[n0] ≠ τ, β ^ ≠ (β to n)^, ⌜n0⌝ < # β, ⌜n⌝ < # β + ⌜1⌝ , n ≤ n0, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦
Used simplifier rules: ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (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
| β[n0] ≠ τ, β ^ ≠ (β to n)^, ⌜n0⌝ < # β, ⌜n⌝ < # β + ⌜1⌝ , n ≤ n0, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦ |
β[n0] ≠ τ, β ^ ≠ (β to n)^, ⌜n0⌝ < # β, n ≤ n0, ¬ # β < ⌜n⌝ , ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦
Used simplifier rules: 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⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s)
| β[n0] ≠ τ, β ^ ≠ (β to n)^, ⌜n0⌝ < # β, n ≤ n0, ¬ # β < ⌜n⌝ , ∀ n1. ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ |
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: n0
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ ∀ m. ¬ m < n ∧ ⌜m⌝ < # β → σ[m] = σ[n] ∧ β[m] = τ |
β ^ ≠ (β to n)^, ⌜n0⌝ < # β, ⌜n⌝ < # σ, n ≤ n0, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n0] = σ[n] ∧ β[n0] = τ
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)
| β ^ ≠ (β to n)^, ⌜n0⌝ < # β, ⌜n⌝ < # σ, n ≤ n0, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n0] = σ[n] ∧ β[n0] = τ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜0⌝ < # β, n ≤ 0, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[0] = σ[n] ∧ β[0] = τ
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1 +1⌝ < # β, n ≤ n1 +1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ β, n, σ, stepf, startf. β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 +1] = σ[n] ∧ β[n1 +1] = τ
Used simplifier rules: nat freely generated by 0, +1;;
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜0⌝ < # β, n ≤ 0, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[0] = σ[n] ∧ β[0] = τ |
β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ a, s. ¬ stepf(σ[0], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦
Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) ⊦ [] ^ = []; (s) ⊦ σ to 0 = []; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) ⊦ m ≤ 0 ↔ m = 0; (s)
| β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ a, s. ¬ stepf(σ[0], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦ |
# σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ a, s. ¬ stepf(σ[0], a, s), ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ∀ a, s. ¬ stepf(σ[0], a, s), ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)) ⊦ |
# σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ⌜0⌝ < # β → stepf(σ[0], β[0], σ[0 + 1]) ∨ σ[0] = σ[0 + 1] ∧ β[0] = τ ∧ ¬(∃ s1, a. stepf(σ[0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦
Used terms: 0
| # σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], ⌜0⌝ < # β → stepf(σ[0], β[0], σ[0 + 1]) ∨ σ[0] = σ[0 + 1] ∧ β[0] = τ ∧ ¬(∃ s1, a. stepf(σ[0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦ |
# σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], stepf(σ[0], β[0], σ[1]), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| # σ = # β + ⌜1⌝ , β[0] ≠ τ, β ^ ≠ [], β ≠ [], σ ≠ [], stepf(σ[0], β[0], σ[1]), ∀ a, s. ¬ stepf(σ[0], a, s) ⊦ |
Used terms: β[0], σ[1]
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1 +1⌝ < # β, n ≤ n1 +1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ β, n, σ, stepf, startf. β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 +1] = σ[n] ∧ β[n1 +1] = τ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ β, n, σ, stepf, startf. β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used simplifier rules: ⊦ m +1 = m + 1; (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)
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ β, n, σ, stepf, startf. β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used terms: β, n, σ, stepf, startf
| β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, β ^ ≠ (β to n)^ ∧ ⌜n1⌝ < # β ∧ ⌜n⌝ < # σ ∧ n ≤ n1 ∧ (∀ a, s. ¬ stepf(σ[n], a, s)) ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ⌜n1⌝ < # β ∧ n ≤ n1 ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
| β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ⌜n1⌝ < # β ∧ n ≤ n1 ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) → σ[n1] = σ[n] ∧ β[n1] = τ, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ, ⌜n1⌝ < # β ∧ n ≤ n1 ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β)
σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
| β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ, ⌜n1⌝ < # β ∧ n ≤ n1 ∧ frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) |
β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ∧ n ≤ n1
Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ, frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ∧ n ≤ n1 |
β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ¬ n ≤ n1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
| β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ¬ n ≤ n1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # σ, ∀ a, s. ¬ stepf(σ[n1 + 1], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦
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) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # σ, ∀ a, s. ¬ stepf(σ[n1 + 1], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # σ, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # β, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # σ, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # β, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦ |
# σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, ∀ a, s. ¬ stepf(σ[n1 + 1], a, s), ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (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∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s)
| # σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, ∀ a, s. ¬ stepf(σ[n1 + 1], a, s), ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n + 1]) ∨ σ[n] = σ[n + 1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n + 1], a, s1)) ⊦ |
# σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1 + 1⌝ < # β → stepf(σ[n1 + 1], β[n1 + 1], σ[(n1 + 1) + 1]) ∨ σ[n1 + 1] = σ[(n1 + 1) + 1] ∧ β[n1 + 1] = τ ∧ ¬(∃ s1, a. stepf(σ[(n1 + 1) + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦
Used terms: n1 + 1
| # σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ < # β, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1 + 1⌝ < # β → stepf(σ[n1 + 1], β[n1 + 1], σ[(n1 + 1) + 1]) ∨ σ[n1 + 1] = σ[(n1 + 1) + 1] ∧ β[n1 + 1] = τ ∧ ¬(∃ s1, a. stepf(σ[(n1 + 1) + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦ |
# σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, stepf(σ[n1 + 1], β[n1 + 1], σ[2 + n1]), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # σ = # β + ⌜1⌝ , β[n1 + 1] ≠ τ, β ^ ≠ (β to n1 + 1)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n1⌝ < # β, stepf(σ[n1 + 1], β[n1 + 1], σ[2 + n1]), ∀ a, s. ¬ stepf(σ[n1 + 1], a, s) ⊦ |
Used terms: β[n1 + 1], σ[2 + n1]
| σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
| β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), frag(IOAut(startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1))))(σ, β) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used terms: startf, λ s, a, s0. stepf(s, a, s0) ∨ s = s0 ∧ a = τ ∧ ¬(∃ s1, a. stepf(s0, a, s1)), σ, β
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]) ∨ σ[n] = σ[n +1] ∧ β[n] = τ ∧ ¬(∃ s1, a. stepf(σ[n +1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
# σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
# σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used terms: n1
| # σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, n ≤ n1 + 1, ⌜n1⌝ < # β → stepf(σ[n1], β[n1], σ[n1 + 1]) ∨ σ[n1] = σ[n1 + 1] ∧ β[n1] = τ ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
# σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s), stepf(σ[n], τ, σ[n1 + 1]) ∨ σ[n] = σ[n1 + 1] ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| # σ = # β + ⌜1⌝ , σ[n1] = σ[n], β[n1] = τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s), stepf(σ[n], τ, σ[n1 + 1]) ∨ σ[n] = σ[n1 + 1] ∧ ¬(∃ s1, a. stepf(σ[n1 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
# σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, stepf(σ[n], τ, σ[n1 + 1]), n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
# σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], σ[n] = σ[n1 + 1], β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ ∃ s1, a. stepf(σ[n1 + 1], a, s1), σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ
| # σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, stepf(σ[n], τ, σ[n1 + 1]), n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
Used terms: τ, σ[n1 + 1]
| # σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], σ[n] = σ[n1 + 1], β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s), ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)) ⊦ ∃ s1, a. stepf(σ[n1 + 1], a, s1), σ[n1 + 1] = σ[n] ∧ β[n1 + 1] = τ |
# σ = # β + ⌜1⌝ , σ[n] = σ[n1 + 1], σ[n1] = σ[n], β[n1] = τ, β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1)
| # σ = # β + ⌜1⌝ , σ[n] = σ[n1 + 1], σ[n1] = σ[n], β[n1] = τ, β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, n ≤ n1 + 1, ∀ n0. ⌜n0⌝ < # β → stepf(σ[n0], β[n0], σ[n0 + 1]) ∨ σ[n0] = σ[n0 + 1] ∧ β[n0] = τ ∧ ¬(∃ s1, a. stepf(σ[n0 + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1) |
# σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], σ[n] = σ[n1 + 1], β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ⌜n1 + 1⌝ < # β → stepf(σ[n1 + 1], β[n1 + 1], σ[(n1 + 1) + 1]) ∨ σ[n1 + 1] = σ[(n1 + 1) + 1] ∧ β[n1 + 1] = τ ∧ ¬(∃ s1, a. stepf(σ[(n1 + 1) + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1)
Used terms: n1 + 1
| # σ = # β + ⌜1⌝ , β[n1] = τ, σ[n1] = σ[n], σ[n] = σ[n1 + 1], β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ + ⌜1⌝ < # β, n ≤ n1 + 1, ⌜n1 + 1⌝ < # β → stepf(σ[n1 + 1], β[n1 + 1], σ[(n1 + 1) + 1]) ∨ σ[n1 + 1] = σ[(n1 + 1) + 1] ∧ β[n1 + 1] = τ ∧ ¬(∃ s1, a. stepf(σ[(n1 + 1) + 1], a, s1)), ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1) |
# σ = # β + ⌜1⌝ , σ[n] = σ[n1 + 1], σ[n1] = σ[n], β[n1] = τ, β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, stepf(σ[n], β[n1 + 1], σ[2 + n1]), n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1)
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # σ = # β + ⌜1⌝ , σ[n] = σ[n1 + 1], σ[n1] = σ[n], β[n1] = τ, β[n1 + 1] ≠ τ, β ^ ≠ (β to n)^, ⌜n1⌝ + ⌜1⌝ < # β, ⌜n⌝ < # σ, ⌜n1⌝ < # β, stepf(σ[n], β[n1 + 1], σ[2 + n1]), n ≤ n1 + 1, ∀ a, s. ¬ stepf(σ[n], a, s) ⊦ ∃ s1, a. stepf(σ[n], a, s1) |
Used terms: β[n1 + 1], σ[2 + 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.