(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
2nd(cons(X, n__cons(Y, Z))) → activate(Y)
from(X) → cons(X, n__from(s(X)))
cons(X1, X2) → n__cons(X1, X2)
from(X) → n__from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__from(X)) → from(X)
activate(X) → X
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(2nd(x1)) = 2 + 2·x1
POL(activate(x1)) = 2 + 2·x1
POL(cons(x1, x2)) = 1 + x1 + x2
POL(from(x1)) = 1 + 2·x1
POL(n__cons(x1, x2)) = x1 + x2
POL(n__from(x1)) = x1
POL(s(x1)) = x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
2nd(cons(X, n__cons(Y, Z))) → activate(Y)
cons(X1, X2) → n__cons(X1, X2)
from(X) → n__from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__from(X)) → from(X)
activate(X) → X
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
Q is empty.
(3) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(cons(x1, x2)) = x1 + x2
POL(from(x1)) = 2 + 2·x1
POL(n__from(x1)) = x1
POL(s(x1)) = x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
from(X) → cons(X, n__from(s(X)))
(4) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(5) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(6) YES