(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
0 > nil
sel2 > [from1, first2, activate1] > cons2 > nfirst2
sel2 > [from1, first2, activate1] > nfrom1
sel2 > [from1, first2, activate1] > s1
sel2 > [from1, first2, activate1] > nil
Status:
nfirst2: [1,2]
sel2: [1,2]
from1: [1]
cons2: [2,1]
nfrom1: [1]
s1: [1]
activate1: [1]
first2: [2,1]
0: []
nil: []
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)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) TRUE