(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
head(cons(X, XS)) → X
2nd(cons(X, XS)) → head(activate(XS))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
sel(0, cons(X, XS)) → X
sel(s(N), cons(X, XS)) → sel(N, activate(XS))
from(X) → n__from(X)
take(X1, X2) → n__take(X1, X2)
activate(n__from(X)) → from(X)
activate(n__take(X1, X2)) → take(X1, X2)
activate(X) → X
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:
2nd1 > [from1, activate1] > cons2 > [s1, head1, nil]
2nd1 > [from1, activate1] > nfrom1 > [s1, head1, nil]
[take2, ntake2] > [from1, activate1] > cons2 > [s1, head1, nil]
[take2, ntake2] > [from1, activate1] > nfrom1 > [s1, head1, nil]
0 > [s1, head1, nil]
sel2 > [from1, activate1] > cons2 > [s1, head1, nil]
sel2 > [from1, activate1] > nfrom1 > [s1, head1, nil]
Status:
from1: multiset
cons2: [1,2]
nfrom1: multiset
s1: [1]
head1: multiset
2nd1: multiset
activate1: multiset
take2: [1,2]
0: multiset
nil: multiset
ntake2: [1,2]
sel2: [1,2]
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)))
head(cons(X, XS)) → X
2nd(cons(X, XS)) → head(activate(XS))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
sel(0, cons(X, XS)) → X
sel(s(N), cons(X, XS)) → sel(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(n__take(X1, X2)) → take(X1, X2)
activate(X) → X
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
take(X1, X2) → n__take(X1, X2)
Q is empty.
(3) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:
take2 > ntake2
Status:
take2: [1,2]
ntake2: multiset
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
take(X1, X2) → n__take(X1, X2)
(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) TRUE