| move(IOAut(startf, stepf))(s, [], s2), s ≠ s2 ⊦ ∃ s1. stepf(s, τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2) |
s ≠ s2, move(IOAut(startf, stepf))(s, [], s2) ⊦ ∃ s1. stepf(s, τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2)
| s ≠ s2, move(IOAut(startf, stepf))(s, [], s2) ⊦ ∃ s1. stepf(s, τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2) |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
s ≠ s2, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s2 = sl.last ∧ α ^ = [] ⊦ ∃ s1. stepf(s, τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2)
Used terms: s2, [], s, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| s ≠ s2, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s2 = sl.last ∧ α ^ = [] ⊦ ∃ s1. stepf(s, τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], s2) |
⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. stepf(sl[0], τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], sl.last)
Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. stepf(sl[0], τ, s1) ∧ move(IOAut(startf, stepf))(s1, [], sl.last) |
⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ stepf(sl[0], τ, sl[1]) ∧ move(IOAut(startf, stepf))(sl[1], [], sl.last)
Used terms: sl[1]
| ⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ stepf(sl[0], τ, sl[1]) ∧ move(IOAut(startf, stepf))(sl[1], [], sl.last) |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used terms: sl.last, [], sl[1], stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ⌜al⌝ ^ = [], sl[0] ≠ sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , ⌜al⌝ ^ = [], sl[0] ≠ sl.last, ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used terms: ⌜al⌝ , ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , ⌜al⌝ ^ = [], sl[0] ≠ sl.last, ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (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⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, 0 < # al → stepf(sl[0], al[0], sl[0 + 1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used terms: 0
| # al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, 0 < # al → stepf(sl[0], al[0], sl[0 + 1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # al + 1 = # sl, ⌜al⌝ ^ = [], sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)
# al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. ⌜n⌝ < # ⌜al⌝ → ⌜al⌝ [n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used terms: ⌜al⌝
| ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ) |
| # al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. ⌜n⌝ < # ⌜al⌝ → ⌜al⌝ [n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), 0 < # al → al[0] = τ, ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used terms: 0
| # al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), 0 < # al → al[0] = τ, ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), al ≠ [] → hd(al) = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [] → stepf(sl[0], hd(al), sl[1]), al ≠ [] → hd(al) = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, al = [], sl[0] ≠ sl.last, al ≠ [] → hd(al) = τ, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
# al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [], al ≠ [] → hd(al) = τ, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used formulas: al = []
| # al + 1 = # sl, al = [], sl[0] ≠ sl.last, al ≠ [] → hd(al) = τ, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
1 = # sl, sl[0] ≠ sl.last ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [])
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| 1 = # sl, sl[0] ≠ sl.last ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
Used simplifier rules: statelist freely generated by [], +;; ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (a ' + x)[0] = a; (s) n ≠ 0 ⊦ (a ' + x)[(* n)] = x[n -1]; (s) ⊦ a + x = a ' + x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '.last = a; (s) ⊦ # [] = 0; (s)
| # al + 1 = # sl, sl[0] ≠ sl.last, al ≠ [], al ≠ [] → hd(al) = τ, al ≠ [] → stepf(sl[0], hd(al), sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ stepf(sl[0], τ, sl[1]) ∧ (∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []) |
# al + 1 = # sl, hd(al) = τ, sl[0] ≠ sl.last, al ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []
| # al + 1 = # sl, hd(al) = τ, sl[0] ≠ sl.last, al ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. n < # al → al[n] = τ, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [] |
# al + 1 = # sl, a = τ, al = a + al0, sl[0] ≠ sl.last, al ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a, y
| # al + 1 = # sl, a = τ, al = a + al0, sl[0] ≠ sl.last, al ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]), ∀ n. n < # al → al[n] = τ ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [] |
2 + # al0 = # sl, sl[0] ≠ sl.last, stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]) ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = []
Used simplifier rules: ⊦ a + x = a ' + x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s)
| 2 + # al0 = # sl, sl[0] ≠ sl.last, stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]) ⊦ ∃ α, sl0. frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ finp(α) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ α ^ = [] |
2 + # al0 = # sl, sl[0] ≠ sl.last, stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜tl(sl)⌝ , ⌜al0⌝ ) ∧ finp(⌜al0⌝ ) ∧ sl[1] = tl(sl)[0] ∧ sl.last = tl(sl).last ∧ ⌜al0⌝ ^ = []
Used terms: ⌜al0⌝ , tl(sl)
| 2 + # al0 = # sl, sl[0] ≠ sl.last, stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜tl(sl)⌝ , ⌜al0⌝ ) ∧ finp(⌜al0⌝ ) ∧ sl[1] = tl(sl)[0] ∧ sl.last = tl(sl).last ∧ ⌜al0⌝ ^ = [] |
2 + # al0 = # sl, sl = a + sl0, sl[0] ≠ sl.last, sl ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ finp(⌜al0⌝ ) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ ⌜al0⌝ ^ = []
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl, a, y
| 2 + # al0 = # sl, sl = a + sl0, sl[0] ≠ sl.last, sl ≠ [], stepf(sl[0], τ, sl[1]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf(sl[n], (τ ' + al0)[n], sl[n + 1]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ finp(⌜al0⌝ ) ∧ sl[1] = sl0[0] ∧ sl.last = sl0.last ∧ ⌜al0⌝ ^ = [] |
# sl0 = # al0 + 1, a ≠ (a ' + sl0).last, stepf(a, τ, sl0[0]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ (a ' + sl0).last = sl0.last ∧ ⌜al0⌝ ^ = []
Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] n ≠ 0 ⊦ (a ' + x)[(* n)] = x[n -1]; (s) ⊦ finp(⌜x⌝ ); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ a ' + x ≠ []; (s) n < n0 ⊦ m + (* n) = m0 + (* n0) ↔ m = m0 + (n0 - n); (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl0 = # al0 + 1, a ≠ (a ' + sl0).last, stepf(a, τ, sl0[0]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ (a ' + sl0).last = sl0.last ∧ ⌜al0⌝ ^ = [] |
# sl0 = # al0 + 1, a ≠ (a ' + sl0).last, sl0 ≠ [], stepf(a, τ, sl0[0]), ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ (a ' + sl0).last = sl0.last ∧ ⌜al0⌝ ^ = []
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: sl0 = []
| # sl0 = # al0 + 1, a ≠ (a ' + sl0).last, sl0 ≠ [], stepf(a, τ, sl0[0]), ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ (a ' + sl0).last = sl0.last ∧ ⌜al0⌝ ^ = [] |
# sl0 = # al0 + 1, a ≠ sl0.last, sl0 ≠ [], stepf(a, τ, hd(sl0)), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = []
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x ≠ [] → x[0] = hd(x); (s)
| # sl0 = # al0 + 1, a ≠ sl0.last, sl0 ≠ [], stepf(a, τ, hd(sl0)), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]) ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = [] |
# sl0 = # al0 + 1, sl0 = a0 + sl, a ≠ sl0.last, sl0 ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = []
Used simplifier rules: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: sl0, head, tail
| # sl0 = # al0 + 1, sl0 = a0 + sl, a ≠ sl0.last, sl0 ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + sl0)[n], (τ ' + al0)[n], sl0[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = [] |
# sl = # al0, a ≠ (a0 ' + sl).last, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = []
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl = # al0, a ≠ (a0 ' + sl).last, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = [] |
# sl = # al0, a ≠ (a0 ' + sl).last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = []
Used simplifier rules: frag-one: ⊦ frag(IOAut(startf, stepf))(⌜s '⌝ , []); ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '[0] = a; (s) ⊦ # [] = 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) Used formulas: sl = []
| # sl = # al0, a ≠ (a0 ' + sl).last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = [] |
# sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = []
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| # sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = [] |
⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)
# sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ (∀ n. ⌜n⌝ < # ⌜al0⌝ → ⌜al0⌝ [n] = τ)
Used terms: ⌜al0⌝
| ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ) |
| # sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ (∀ n. ⌜n⌝ < # ⌜al0⌝ → ⌜al0⌝ [n] = τ) |
# sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ (n < # al0 → al0[n] = τ)
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ) ∧ (n < # al0 → al0[n] = τ) |
# sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ¬ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦
# sl = # al0, al0[n] ≠ τ, a ≠ sl.last, sl ≠ [], n < # al0, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦
| # sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ¬ frag(IOAut(startf, stepf))(⌜a0 '⌝ + ⌜sl⌝ , ⌜al0⌝ ), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), #(⌜a0 '⌝ + ⌜sl⌝ ) ≠ # ⌜al0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al0⌝ → stepf((⌜a0 '⌝ + ⌜sl⌝ )[n], ⌜al0⌝ [n], (⌜a0 '⌝ + ⌜sl⌝ )[n +1]))) ⊦
Used terms: ⌜al0⌝ , ⌜a0 '⌝ + ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # sl = # al0, a ≠ sl.last, sl ≠ [], stepf(a, τ, a0), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), #(⌜a0 '⌝ + ⌜sl⌝ ) ≠ # ⌜al0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al0⌝ → stepf((⌜a0 '⌝ + ⌜sl⌝ )[n], ⌜al0⌝ [n], (⌜a0 '⌝ + ⌜sl⌝ )[n +1]))) ⊦ |
# sl = # al0, a ≠ sl.last, al0 ≠ [], sl ≠ [], n < # al0, stepf(a, τ, a0), ¬ stepf((a0 ' + sl)[n], al0[n], sl[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (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⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # sl = # al0, a ≠ sl.last, al0 ≠ [], sl ≠ [], n < # al0, stepf(a, τ, a0), ¬ stepf((a0 ' + sl)[n], al0[n], sl[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ, ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]) ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: n + 1
| # sl = # al0, al0[n] ≠ τ, a ≠ sl.last, sl ≠ [], n < # al0, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ |
# sl = # al0, al0[n] ≠ τ, a ≠ sl.last, al0 ≠ [], sl ≠ [], n < # al0, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| # sl = # al0, al0[n] ≠ τ, a ≠ sl.last, al0 ≠ [], sl ≠ [], n < # al0, stepf(a, τ, a0), ∀ n. ¬ # al0 < n → stepf((a ' + a0 ' + sl)[n], (τ ' + al0)[n], (a0 ' + sl)[n]), ∀ n. ¬ # al0 < n → (τ ' + al0)[n] = τ ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: n + 1
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.