| traceprop(tP) ⊦ forest(can(tP), λ al. tP(⌜al⌝ )) |
traceprop(tP), ¬ forest(can(tP), λ al. tP(⌜al⌝ )) ⊦
| traceprop(tP), ¬ forest(can(tP), λ al. tP(⌜al⌝ )) ⊦ |
traceprop(tP), ¬ forest(ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )), λ al. tP(⌜al⌝ )) ⊦
Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| traceprop(tP), ¬ forest(ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )), λ al. tP(⌜al⌝ )) ⊦ |
⊦ forest(ALIOAut(startf, stepf), isstate) ↔ (∀ s2. isstate(s2) → (∃ α, sl. alexec*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2))
traceprop(tP), ∃ s2. ¬ ( tP(⌜s2⌝ ) → (∃ α, sl. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)) ⊦
Used terms: λ al. tP(⌜al⌝ ), λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ forest(ALIOAut(startf, stepf), isstate) ↔ (∀ s2. isstate(s2) → (∃ α, sl. alexec*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)) |
| traceprop(tP), ∃ s2. ¬ ( tP(⌜s2⌝ ) → (∃ α, sl. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)) ⊦ |
tP(⌜al⌝ ), traceprop(tP) ⊦ (∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last) ∧ ( alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ) ∧ alli[0] = [] ∧ finp(aσ) ∧ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0) ∧ alli0[0] = [] ∧ finp(aσ0) ∧ alli0.last = alli.last ∧ al = alli0.last → aσ = aσ0 ∧ alli = alli0)
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ alexec(ALIOAut(startf, stepf))(σ, β) ↔ alfrag(ALIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ alexec*(ALIOAut(startf, stepf))(σ, β) ↔ alexec(ALIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| tP(⌜al⌝ ), traceprop(tP) ⊦ (∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last) ∧ ( alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ) ∧ alli[0] = [] ∧ finp(aσ) ∧ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0) ∧ alli0[0] = [] ∧ finp(aσ0) ∧ alli0.last = alli.last ∧ al = alli0.last → aσ = aσ0 ∧ alli = alli0) |
tP(⌜al⌝ ), traceprop(tP) ⊦ ∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last
alli0.last = alli.last, alli[0] = [], alli0[0] = [], al = alli0.last, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0), finp(aσ), finp(aσ0), tP(⌜al⌝ ), traceprop(tP) ⊦ aσ = aσ0 ∧ alli = alli0
| tP(⌜al⌝ ), traceprop(tP) ⊦ ∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last |
tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜(⌜λ m. al to m⌝ to # al + 1).l⌝ , ⌜al⌝ ) ∧ (⌜λ m. al to m⌝ to # al + 1).l[0] = [] ∧ finp(⌜al⌝ ) ∧ al = (⌜λ m. al to m⌝ to # al + 1).l.last
Used terms: ⌜al⌝ , (⌜λ m. al to m⌝ to # al + 1).l
| tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜(⌜λ m. al to m⌝ to # al + 1).l⌝ , ⌜al⌝ ) ∧ (⌜λ m. al to m⌝ to # al + 1).l[0] = [] ∧ finp(⌜al⌝ ) ∧ al = (⌜λ m. al to m⌝ to # al + 1).l.last |
tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al + 1⌝ , ⌜al⌝ ) ∧ al = ((λ m. al to m) to # al + 1).last
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ x to 0 = []; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) 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)
| tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al + 1⌝ , ⌜al⌝ ) ∧ al = ((λ m. al to m) to # al + 1).last |
⊦ nf to m + 1 = (nf to m) + nf(m) '
tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜((λ m. al to m) to # al) + (al to # al)'⌝ , ⌜al⌝ ) ∧ al = (((λ m. al to m) to # al) + (al to # al)').last
Used terms: # al, λ m. al to m
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜((λ m. al to m) to # al) + (al to # al)'⌝ , ⌜al⌝ ) ∧ al = (((λ m. al to m) to # al) + (al to # al)').last |
tP(⌜al⌝ ), traceprop(tP), ¬ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , ⌜al⌝ ) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ x to # x = x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| tP(⌜al⌝ ), traceprop(tP), ¬ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , ⌜al⌝ ) ⊦ |
⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
tP(⌜al⌝ ), traceprop(tP), #(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ ) ≠ # ⌜al⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜al⌝ → (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n +1] = (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ ) ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ))) ⊦
Used terms: ⌜al⌝ , ⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| tP(⌜al⌝ ), traceprop(tP), #(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ ) ≠ # ⌜al⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜al⌝ → (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n +1] = (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ ) ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ))) ⊦ |
al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ m +1 = m + 1; (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) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
⊦ n < # x → (x + y)[n] = x[n]
al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to # al) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )
al ≠ [], n < # al, n + 1 < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ ((λ m. al to m) to # al)[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used terms: n + 1, al ', (λ m. al to m) to # al
| ⊦ n < # x → (x + y)[n] = x[n] |
| al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to # al) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to n + 1) + al ')[n + 1] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (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; (ss) ⊦ #(nf to n) = n; (s)
| # al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to n + 1) + al ')[n + 1] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to n + 1) ⊦ al '[n + 1 - #((λ m. al to m) to n + 1)] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ #(nf 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 Used terms: n + 1, al ', (λ m. al to m) to n + 1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to n + 1) ⊦ al '[n + 1 - #((λ m. al to m) to n + 1)] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ a '[0] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m - m = 0; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ #(nf to n) = n; (s) ⊦ m + n < m + n0 ↔ n < n0; (s)
| # al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
⊦ n < # x → (x + y)[n] = x[n]
# al = n + 1, al ≠ [], n < #((λ m. al to m) to n + 1), tP(⌜al⌝ ), traceprop(tP) ⊦ al = ((λ m. al to m) to n + 1)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n, al ', (λ m. al to m) to n + 1
| ⊦ n < # x → (x + y)[n] = x[n] |
| # al = n + 1, al ≠ [], n < #((λ m. al to m) to n + 1), tP(⌜al⌝ ), traceprop(tP) ⊦ al = ((λ m. al to m) to n + 1)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ + ⌜al[n] '⌝ ) |
# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ #(nf to n) = n; (s)
| # al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
# al = n + 1, # x0 = n, al = x0 + x1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ # al < n ⊦ al = x0 + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜al[n] '⌝ )
Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (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 → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: al, n, al0, al1
| # al = n + 1, # x0 = n, al = x0 + x1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ # al < n ⊦ al = x0 + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜al[n] '⌝ ) |
# x1 = 1, x0 + x1 ≠ [], tP(⌜x0⌝ + ⌜x1⌝ ), traceprop(tP) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + y = x + z ↔ y = z; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)
| # x1 = 1, x0 + x1 ≠ [], tP(⌜x0⌝ + ⌜x1⌝ ), traceprop(tP) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ ) |
⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP)
# x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )
Used terms: tP
| ⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP) |
| # x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ ) |
# x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )
| # x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ ) |
# x1 = 1, x1 = a0 + x, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), tP(aσ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )
Used simplifier rules: actionlist freely generated by [], +;; ⊦ # [] = 0; (s)
| # x1 = 1, x1 = a0 + x, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), tP(aσ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ ) |
prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s) ⊦ ⌜[]⌝ = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (x + a ' + y)[# x] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' + y ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ ) |
⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2))
tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )
Used terms: tP
| ⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2)) |
| tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ ) |
tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(⌜x0⌝ + ⌜a0 '⌝ ) ∧ ⌜x0⌝ ≤ ⌜x0⌝ + ⌜a0 '⌝ → tP(⌜x0⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )
Used terms: ⌜x0⌝ + ⌜a0 '⌝ , ⌜x0⌝
| tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(⌜x0⌝ + ⌜a0 '⌝ ) ∧ ⌜x0⌝ ≤ ⌜x0⌝ + ⌜a0 '⌝ → tP(⌜x0⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ ) |
tP(⌜x0⌝ ), tP(aσ), tP(⌜x0⌝ + ⌜τ '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ1 ≤ σ1 + σ2; (s)
| tP(⌜x0⌝ ), tP(aσ), tP(⌜x0⌝ + ⌜τ '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦ |
Used simplifier rules: ⊦ ext(⌜al⌝ + α) ↔ ext(al) ∧ ext(α); (ws) ⊦ ext(⌜al⌝ ) ↔ ext(al); (s) ⊦ ext(a ') ↔ ext(a); (s) ⊦ ext(a) ↔ a ≠ τ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜x0⌝ + ⌜τ '⌝
| al ≠ [], n < # al, n + 1 < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ ((λ m. al to m) to # al)[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (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 c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; 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) ⊦ #(nf to n) = n; (s)
| al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ ) |
⊦ n < # x → (x + y)[n] = x[n]
al ≠ [], n + 1 < # al, n < # al, n < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = ((λ m. al to m) to # al)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n, al ', (λ m. al to m) to # al
| ⊦ n < # x → (x + y)[n] = x[n] |
| al ≠ [], n + 1 < # al, n < # al, n < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = ((λ m. al to m) to # al)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
m < # x ⊦ x to m + 1 = (x to m) + x[m] '
al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (al to n) + al[n] ' = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: n, al
| m < # x ⊦ x to m + 1 = (x to m) + x[m] ' |
| al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (al to n) + al[n] ' = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
| al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP)
al ≠ [], n + 1 < # al, n < # al, prefix-closed(tP), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: tP
| ⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP) |
| al ≠ [], n + 1 < # al, n < # al, prefix-closed(tP), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n < # al, n + 1 < # al, prefix-closed(tP), tP(aσ), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
| al ≠ [], n < # al, n + 1 < # al, prefix-closed(tP), tP(aσ), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2))
al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: tP
| ⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2)) |
| al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) → ext(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: ⌜al⌝
| al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) → ext(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n + 1 < # al, n < # al, ext(al), tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ ext(⌜al⌝ ) ↔ ext(al); (s)
| al ≠ [], n + 1 < # al, n < # al, ext(al), tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⊦ ext(al) ↔ (∀ n. n < # al → ext(al[n]))
al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n. n < # al → ext(al[n]) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: al
| ⊦ ext(al) ↔ (∀ n. n < # al → ext(al[n])) |
| al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n. n < # al → ext(al[n]) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n0. n0 < # al → al[n0] ≠ τ ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s)
| al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n0. n0 < # al → al[n0] ≠ τ ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), n < # al → al[n] ≠ τ, ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: n
| al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), n < # al → al[n] ≠ τ, ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: ⌜al⌝ , ⌜al to n⌝
| al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), (∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ ) → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: ⌜al⌝ , ⌜al to n⌝
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), (∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ ) → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ ∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ , tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ ∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ , tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⌜al to n⌝ + ⌜al from n⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used terms: ⌜al from n⌝
| ⌜al to n⌝ + ⌜al from n⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
(al to n) + (al from n) ≠ al, al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| (al to n) + (al from n) ≠ al, al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
⊦ n ≤ # x → (x to n) + (x from n) = x
Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: n, al
| ⊦ n ≤ # x → (x to n) + (x from n) = x |
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) |
al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦
| al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ |
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦
Used terms: ⌜al⌝ , ⌜al to n + 1⌝
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦ |
al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦
| al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦ |
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ¬ ⌜al to n + 1⌝ ≤ ⌜al⌝ ⊦
al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), tP(⌜al to n + 1⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ¬ ⌜al to n + 1⌝ ≤ ⌜al⌝ ⊦ |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ σ. ⌜al to n + 1⌝ + σ ≠ ⌜al⌝ ⊦
Used terms: ⌜al⌝ , ⌜al to n + 1⌝
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ σ. ⌜al to n + 1⌝ + σ ≠ ⌜al⌝ ⊦ |
⌜al to n + 1⌝ + ⌜al from n + 1⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦
Used terms: ⌜al from n + 1⌝
| ⌜al to n + 1⌝ + ⌜al from n + 1⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦ |
(al to n + 1) + (al from n + 1) ≠ al, al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| (al to n + 1) + (al from n + 1) ≠ al, al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦ |
⊦ n ≤ # x → (x to n) + (x from n) = x
Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, al
| ⊦ n ≤ # x → (x to n) + (x from n) = x |
| al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), tP(⌜al to n + 1⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦ |
m < # x ⊦ x to m + 1 = (x to m) + x[m] '
Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: n, al
| m < # x ⊦ x to m + 1 = (x to m) + x[m] ' |
| alli0.last = alli.last, alli[0] = [], alli0[0] = [], al = alli0.last, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0), finp(aσ), finp(aσ0), tP(⌜al⌝ ), traceprop(tP) ⊦ aσ = aσ0 ∧ alli = alli0 |
alli0.last = alli.last, alli0[0] = [], alli[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| alli0.last = alli.last, alli0[0] = [], alli[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)
alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = alli[0] + (al to (# alli - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: tP, alli, al, # alli - 1
| alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n) |
| alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = alli[0] + (al to (# alli - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = al to (# alli - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ [] + x = x; (s)
| alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = al to (# alli - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
# alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], alli[0] = [], # alli ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # alli, m
| # alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], alli[0] = [], # alli ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
# alli = n0 + 1, alli0.last = alli.last, alli0[0] = [], alli[n0] = al to n0, hd(alli) = [], alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s)
| # alli = n0 + 1, alli0.last = alli.last, alli0[0] = [], alli[n0] = al to n0, hd(alli) = [], alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
# alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], al1 = [], alli = al1 + alli1, alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli, al1, alli1
| # alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], al1 = [], alli = al1 + alli1, alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0 |
alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (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)
| alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)
alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = alli0[0] + (al0 to (# alli0 - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: tP, alli0, al0, # alli0 - 1
| alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n) |
| alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = alli0[0] + (al0 to (# alli0 - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = al0 to (# alli0 - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ [] + x = x; (s)
| alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = al0 to (# alli0 - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], # alli0 ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # alli0, m
| # alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], # alli0 ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[n0] = al0 to n0, hd(alli0) = [], alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s)
| # alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[n0] = al0 to n0, hd(alli0) = [], alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, al1 = [], alli0 = al1 + alli, alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli0, al1, alli
| # alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, al1 = [], alli0 = al1 + alli, alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0 |
([] ' + alli).last = ([] ' + alli1).last, ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜([] ' + alli1).last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ' + x = a ' + y ↔ x = y; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (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)
| ([] ' + alli).last = ([] ' + alli1).last, ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜([] ' + alli1).last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + al1 ', ([] ' + alli).last = al1, ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, [] ' + alli1 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: [] ' + alli1, al1, alli0
| [] ' + alli1 = alli0 + al1 ', ([] ' + alli).last = al1, ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, [] ' + alli1 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + ([] ' + alli).last ', ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜([] ' + alli).last⌝ ), traceprop(tP), [] ∈ alli0 ∨ [] = ([] ' + alli).last, ([] ' + alli).last = [] ∨ ([] ' + alli).last ∈ alli1 ⊦ al = al0 ∧ alli1 = alli
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a ' + x ≠ []; (s)
| [] ' + alli1 = alli0 + ([] ' + alli).last ', ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜([] ' + alli).last⌝ ), traceprop(tP), [] ∈ alli0 ∨ [] = ([] ' + alli).last, ([] ' + alli).last = [] ∨ ([] ' + alli).last ∈ alli1 ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, [] ' + alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1 ⊦ al = al0 ∧ alli1 = alli
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: [] ' + alli, al1, alli2
| [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, [] ' + alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1 ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ al = al0 ∧ alli1 = alli
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a ' + x ≠ []; (s)
| [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 = al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli
[] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli
Used formulas: al0 = al
| [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 = al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alli1 ≠ alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
| [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alli1 ≠ alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0
Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ a ' + x = a ' + y ↔ x = y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (a ' + x)[0] = a; (s) Used terms: tP, [] ' + alli1, al, [] ' + alli
| alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0 |
| [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli |
[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
| [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜[] '⌝ + ⌜alli⌝ ) = # ⌜al0⌝ + ⌜1⌝ , [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. ⌜n⌝ < # ⌜al0⌝ → (⌜[] '⌝ + ⌜alli⌝ )[n +1] = (⌜[] '⌝ + ⌜alli⌝ )[n] + ⌜al0⌝ [n] ' ∧ ⌜al0⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ + ⌜⌜al0⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦
Used terms: ⌜al0⌝ , ⌜[] '⌝ + ⌜alli⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜[] '⌝ + ⌜alli⌝ ) = # ⌜al0⌝ + ⌜1⌝ , [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. ⌜n⌝ < # ⌜al0⌝ → (⌜[] '⌝ + ⌜alli⌝ )[n +1] = (⌜[] '⌝ + ⌜alli⌝ )[n] + ⌜al0⌝ [n] ' ∧ ⌜al0⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ + ⌜⌜al0⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ |
# alli = # al0, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) 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) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # x = n → x to n = 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)
| # alli = # al0, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜[] '⌝ + ⌜alli1⌝ ) = # ⌜al⌝ + ⌜1⌝ , # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. ⌜n⌝ < # ⌜al⌝ → (⌜[] '⌝ + ⌜alli1⌝ )[n +1] = (⌜[] '⌝ + ⌜alli1⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦
Used terms: ⌜al⌝ , ⌜[] '⌝ + ⌜alli1⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜[] '⌝ + ⌜alli1⌝ ) = # ⌜al⌝ + ⌜1⌝ , # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. ⌜n⌝ < # ⌜al⌝ → (⌜[] '⌝ + ⌜alli1⌝ )[n +1] = (⌜[] '⌝ + ⌜alli1⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ |
# alli = # al0, # alli1 = # al, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) 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) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # x = n → x to n = 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)
| # alli = # al0, # alli1 = # al, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
# alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦
# alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = al2 + alli3, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦
Used simplifier rules: actionlistlist freely generated by [], +;;
| # alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ |
# alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a '[0] = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| # alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦ |
# alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, alli2 = al1 + alli0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦
Used simplifier rules: actionlistlist freely generated by [], +;; ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s)
| # alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, alli2 = al1 + alli0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦ |
# alli0 + 1 = # al0, (([] ' + alli0) + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → (alli0 + [] ')[n] = (([] ' + alli0) + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| # alli0 + 1 = # al0, (([] ' + alli0) + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → (alli0 + [] ')[n] = (([] ' + alli0) + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al0, [] ', [] ' + alli0
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = al2 + alli3, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ |
# alli = # al0, [] ' + alli = alli2 + al1 ', # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| # alli = # al0, [] ' + alli = alli2 + al1 ', # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1 ⊦ |
# alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
# alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = al2 + alli0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦
Used simplifier rules: actionlistlist freely generated by [], +;;
| # alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
# alli3 + 1 = # al, (([] ' + alli3) + [] ')[# al] = al, [] ≠ al, tP([]), traceprop(tP), ∀ n. n < # al → (alli3 + [] ')[n] = (([] ' + alli3) + [] ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ + ⌜al[n] '⌝ ) ⊦
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| # alli3 + 1 = # al, (([] ' + alli3) + [] ')[# al] = al, [] ≠ al, tP([]), traceprop(tP), ∀ n. n < # al → (alli3 + [] ')[n] = (([] ' + alli3) + [] ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ + ⌜al[n] '⌝ ) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al, [] ', [] ' + alli3
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = al2 + alli0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ |
# alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli0) + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| # alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli0) + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# alli0 + 1 = # al0, # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, al1 '[# al0 - #([] ' + alli0)] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ¬ # al0 < #([] ' + alli0), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦
Used simplifier rules: ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al0, al1 ', [] ' + alli0
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # alli0 + 1 = # al0, # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, al1 '[# al0 - #([] ' + alli0)] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ¬ # al0 < #([] ' + alli0), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦ |
# alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli3) + al0 ')[# al] = al, al0 ≠ [], al0 ≠ al, # alli0 < # al0, tP(⌜al0⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al0 ')[n] = (([] ' + alli0) + al0 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al0 ')[n] = (([] ' + alli3) + al0 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ m; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '[0] = a; (s) ⊦ m - m = 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 a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli3) + al0 ')[# al] = al, al0 ≠ [], al0 ≠ al, # alli0 < # al0, tP(⌜al0⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al0 ')[n] = (([] ' + alli0) + al0 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al0 ')[n] = (([] ' + alli3) + al0 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al, al0 ', [] ' + alli3
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
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.