| move(IOAut(startf, stepf))(s, α1 + α2, s2) ⊦ ∃ s1. move(IOAut(startf, stepf))(s, α1, s1) |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s2 = sl.last ∧ α ^ = α1 + α2 ⊦ ∃ s1. move(IOAut(startf, stepf))(s, α1, s1)
Used terms: s2, α1 + α2, s, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s2 = sl.last ∧ α ^ = α1 + α2 ⊦ ∃ s1. move(IOAut(startf, stepf))(s, α1, s1) |
⌜al⌝ ^ = α1 + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], α1, s1)
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⌝ ^ = α1 + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], α1, s1) |
⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ ; (s)
| ⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α)
⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ⌜al⌝ ^ = ⌜al0⌝ + α2 → (∃ α1, α0. α1 ^ = ⌜al0⌝ ∧ α0 ^ = α2 ∧ α1 + α0 = ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used terms: ⌜al⌝ , al0, α2
| ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) |
| ⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ⌜al⌝ ^ = ⌜al0⌝ + α2 → (∃ α1, α0. α1 ^ = ⌜al0⌝ ∧ α0 ^ = α2 ∧ α1 + α0 = ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
α1 + α0 = ⌜al⌝ , α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
| α1 + α0 = ⌜al⌝ , α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used terms: ⌜al⌝ , ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
α1 + α0 = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used simplifier rules: ⊦ ⌜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)
| α1 + α0 = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
# al + 1 = # sl, α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , α0 = ⌜al1⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ σ + ⌜nf0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| # al + 1 = # sl, α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , α0 = ⌜al1⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
α1 + ⌜al1⌝ = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
| α1 + ⌜al1⌝ = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
# al + 1 = # sl, α1 + ⌜al1⌝ = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, α1 ^ = ⌜al0⌝ , α1 = ⌜al2⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)
| # al + 1 = # sl, α1 + ⌜al1⌝ = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, α1 ^ = ⌜al0⌝ , α1 = ⌜al2⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ #(x + y) = # x + # y; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1) |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , sl[# al2]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used terms: sl[# al2]
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , sl[# al2]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬(frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[0] = sl0[0] ∧ sl[# al2] = sl0.last ∧ α ^ = ⌜al0⌝ ) ⊦
Used terms: sl[# al2], ⌜al0⌝ , sl[0], stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬(frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[0] = sl0[0] ∧ sl[# al2] = sl0.last ∧ α ^ = ⌜al0⌝ ) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∨ ¬ finp(α) ∨ sl[0] ≠ sl0[0] ∨ sl[# al2] ≠ sl0.last ∨ α ^ ≠ ⌜al0⌝ ⊦
Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β);
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∨ ¬ finp(α) ∨ sl[0] ≠ sl0[0] ∨ sl[# al2] ≠ sl0.last ∨ α ^ ≠ ⌜al0⌝ ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ∨ ⌜al2⌝ ^ ≠ ⌜al0⌝ ⊦
Used terms: ⌜al2⌝ , sl to # al2 + 1
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ∨ ⌜al2⌝ ^ ≠ ⌜al0⌝ ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # ⌜sl to # al2 + 1⌝ ≠ # ⌜al2⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al2⌝ → stepf(⌜sl to # al2 + 1⌝ [n], ⌜al2⌝ [n], ⌜sl to # al2 + 1⌝ [n +1]))) ⊦
Used terms: ⌜al2⌝ , ⌜sl to # al2 + 1⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # ⌜sl to # al2 + 1⌝ ≠ # ⌜al2⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al2⌝ → stepf(⌜sl to # al2 + 1⌝ [n], ⌜al2⌝ [n], ⌜sl to # al2 + 1⌝ [n +1]))) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # al2 + 1 ≠ #(sl to # al2 + 1) ∨ ¬(n < # al2 → stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1])) ⊦
Used simplifier rules: ⊦ ⌜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)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # al2 + 1 ≠ #(sl to # al2 + 1) ∨ ¬(n < # al2 → stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1])) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
¬ # x < n ⊦ #(x to n) = n
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl < # al2 + 1, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used terms: # al2 + 1, sl
| ¬ # x < n ⊦ #(x to n) = n |
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl < # al2 + 1, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ n < # al2 + 1
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, n < # al2 + 1, ¬ # sl < # al2 + 1, ¬ stepf(sl[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used terms: n, # al2 + 1, sl
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ n < # al2 + 1 |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, # sl ≤ # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, # sl ≤ # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, n < # al2 + 1, ¬ # sl < # al2 + 1, ¬ stepf(sl[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], sl ≠ [], n < # al2 + # al1, n < # sl, # al2 < # sl, n < # al2, ¬ stepf(sl[n], al2[n], sl[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m +1 = m + 1; (s) ⊦ ¬ m + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], sl ≠ [], n < # al2 + # al1, n < # sl, # al2 < # sl, n < # al2, ¬ stepf(sl[n], al2[n], sl[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: n
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ 0 < # al2 + 1
Used terms: 0, # al2 + 1, sl
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ 0 < # al2 + 1 |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, sl to # al2 + 1 ≠ [], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl to # al2 + 1, a, y
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ [].last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ [].last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: statelist freely generated by [], +;; ⊦ a ' + x to n + 1 = a + (x to n); (s) ⊦ a + x = a ' + x; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) ⊦ m + 1 ≠ 0; (s)
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, sl to # al2 + 1 ≠ [], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream]
| (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(sl to # al2 + 1) = #(sl0 + a '), (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. n < #(sl to # al2 + 1) → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦
Used terms: sl0 + a ', sl to # al2 + 1
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(sl to # al2 + 1) = #(sl0 + a '), (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. n < #(sl to # al2 + 1) → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦ |
#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦
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 + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)
| #(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦ |
¬ # x < n ⊦ #(x to n) = n
#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
(# al2 + # al1) + 1 = # sl, # al2 + 1 = # sl0 + 1, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ¬ # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used terms: # al2 + 1, sl
| ¬ # x < n ⊦ #(x to n) = n |
| #(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s)
| #(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| (# al2 + # al1) + 1 = # sl, # al2 + 1 = # sl0 + 1, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ¬ # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
# al2 = # sl0, (# sl0 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# sl0] ≠ a, sl ≠ [], # sl0 < # sl, ∀ n. ¬ # sl0 < n → sl[n] = (sl0 + a ')[n], ∀ n. n < # sl0 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ m ≤ n → (n < m ↔ false); (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n = m + n0 ↔ n = n0; (s)
| # al2 = # sl0, (# sl0 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# sl0] ≠ a, sl ≠ [], # sl0 < # sl, ∀ n. ¬ # sl0 < n → sl[n] = (sl0 + a ')[n], ∀ n. n < # sl0 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ |
Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ (x + a ')[# x] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: # sl0
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.