Termination Proof using AProVE

Term Rewriting System R:
[X, XS, N, X1, X2]
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

2ND(cons(X, XS)) -> HEAD(activate(XS))
2ND(cons(X, XS)) -> ACTIVATE(XS)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
SEL(s(N), cons(X, XS)) -> SEL(N, activate(XS))
SEL(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_from}(X)) -> FROM(activate(X))
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> S(activate(X))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_take}(X1, X2)) -> TAKE(activate(X1), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1, X2)) -> TAKE(activate(X1), activate(X2))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1, X2)) -> TAKE(activate(X1), activate(X2))

eight new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X'), X2)) -> TAKE(from(activate(X')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2)) -> TAKE(s(activate(X')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2)) -> TAKE(take(activate(X1''), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2)) -> TAKE(take(activate(X1''), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2)) -> TAKE(s(activate(X')), activate(X2))
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(n_{_from}(X'), X2)) -> TAKE(from(activate(X')), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(n_{_from}(X'), X2)) -> TAKE(from(activate(X')), activate(X2))

10 new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(n_{_from}(activate(X'')), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 4

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2)) -> TAKE(take(activate(X1''), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2)) -> TAKE(s(activate(X')), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(n_{_s}(X'), X2)) -> TAKE(s(activate(X')), activate(X2))

nine new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(n_{_s}(activate(X'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 5

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2)) -> TAKE(take(activate(X1''), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2)) -> TAKE(take(activate(X1''), activate(X2'')), activate(X2))

13 new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_take}(X1''', X2'''), X2)) -> TAKE(n_{_take}(activate(X1'''), activate(X2''')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 6

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1', X2)) -> TAKE(X1', activate(X2))

four new Dependency Pairs are created:

ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 7

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1, n_{_from}(X'))) -> TAKE(activate(X1), from(activate(X')))

10 new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), n_{_from}(activate(X'')))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 8

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1, n_{_s}(X'))) -> TAKE(activate(X1), s(activate(X')))

nine new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X''), n_{_s}(X'))) -> TAKE(from(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_s}(X'))) -> TAKE(s(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2')), s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), n_{_s}(activate(X'')))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_from}(X'')))) -> TAKE(activate(X1), s(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_s}(X'')))) -> TAKE(activate(X1), s(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), s(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), s(X''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 9

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), s(X''))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), s(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_s}(X'')))) -> TAKE(activate(X1), s(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_from}(X'')))) -> TAKE(activate(X1), s(from(activate(X''))))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_s}(X'))) -> TAKE(s(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_s}(X'))) -> TAKE(from(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2''))) -> TAKE(activate(X1), take(activate(X1''), activate(X2'')))

13 new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1'', X2''))) -> TAKE(from(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1'', X2''))) -> TAKE(s(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2'), n_{_take}(X1'', X2''))) -> TAKE(take(activate(X1'''), activate(X2')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(X1''', X2'''))) -> TAKE(activate(X1), n_{_take}(activate(X1'''), activate(X2''')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_from}(X'), X2''))) -> TAKE(activate(X1), take(from(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_s}(X'), X2''))) -> TAKE(activate(X1), take(s(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_take}(X1''', X2'), X2''))) -> TAKE(activate(X1), take(take(activate(X1'''), activate(X2')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(X1''', X2''))) -> TAKE(activate(X1), take(X1''', activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_from}(X')))) -> TAKE(activate(X1), take(activate(X1''), from(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_s}(X')))) -> TAKE(activate(X1), take(activate(X1''), s(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_take}(X1''', X2')))) -> TAKE(activate(X1), take(activate(X1''), take(activate(X1'''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2'''))) -> TAKE(activate(X1), take(activate(X1''), X2'''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 10

                 ↳Narrowing Transformation

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2'''))) -> TAKE(activate(X1), take(activate(X1''), X2'''))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_take}(X1''', X2')))) -> TAKE(activate(X1), take(activate(X1''), take(activate(X1'''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_s}(X')))) -> TAKE(activate(X1), take(activate(X1''), s(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_from}(X')))) -> TAKE(activate(X1), take(activate(X1''), from(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1''', X2''))) -> TAKE(activate(X1), take(X1''', activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_take}(X1''', X2'), X2''))) -> TAKE(activate(X1), take(take(activate(X1'''), activate(X2')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_s}(X'), X2''))) -> TAKE(activate(X1), take(s(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_from}(X'), X2''))) -> TAKE(activate(X1), take(from(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2'), n_{_take}(X1'', X2''))) -> TAKE(take(activate(X1'''), activate(X2')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1'', X2''))) -> TAKE(s(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1'', X2''))) -> TAKE(from(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), s(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_s}(X'')))) -> TAKE(activate(X1), s(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_from}(X'')))) -> TAKE(activate(X1), s(from(activate(X''))))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_s}(X'))) -> TAKE(s(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_s}(X'))) -> TAKE(from(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), s(X''))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

ACTIVATE(n_{_take}(X1, X2')) -> TAKE(activate(X1), X2')

four new Dependency Pairs are created:

ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 11

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_take}(X1''', X2')))) -> TAKE(activate(X1), take(activate(X1''), take(activate(X1'''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_s}(X')))) -> TAKE(activate(X1), take(activate(X1''), s(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_from}(X')))) -> TAKE(activate(X1), take(activate(X1''), from(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1''', X2''))) -> TAKE(activate(X1), take(X1''', activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_take}(X1''', X2'), X2''))) -> TAKE(activate(X1), take(take(activate(X1'''), activate(X2')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_s}(X'), X2''))) -> TAKE(activate(X1), take(s(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_from}(X'), X2''))) -> TAKE(activate(X1), take(from(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2'), n_{_take}(X1'', X2''))) -> TAKE(take(activate(X1'''), activate(X2')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1'', X2''))) -> TAKE(s(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1'', X2''))) -> TAKE(from(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), s(X''))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), s(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_s}(X'')))) -> TAKE(activate(X1), s(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_from}(X'')))) -> TAKE(activate(X1), s(from(activate(X''))))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_s}(X'))) -> TAKE(s(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_s}(X'))) -> TAKE(from(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2'''))) -> TAKE(activate(X1), take(activate(X1''), X2'''))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_take}(X1', X2')) -> TAKE(X1', X2')
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), X2')) -> TAKE(take(activate(X1''), activate(X2'')), X2')
ACTIVATE(n_{_take}(n_{_s}(X'), X2')) -> TAKE(s(activate(X')), X2')
ACTIVATE(n_{_take}(n_{_from}(X'), X2')) -> TAKE(from(activate(X')), X2')
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_take}(X1''', X2')))) -> TAKE(activate(X1), take(activate(X1''), take(activate(X1'''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_s}(X')))) -> TAKE(activate(X1), take(activate(X1''), s(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', n_{_from}(X')))) -> TAKE(activate(X1), take(activate(X1''), from(activate(X'))))
ACTIVATE(n_{_take}(X1, n_{_take}(X1''', X2''))) -> TAKE(activate(X1), take(X1''', activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_take}(X1''', X2'), X2''))) -> TAKE(activate(X1), take(take(activate(X1'''), activate(X2')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_s}(X'), X2''))) -> TAKE(activate(X1), take(s(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_take}(n_{_from}(X'), X2''))) -> TAKE(activate(X1), take(from(activate(X')), activate(X2'')))
ACTIVATE(n_{_take}(X1', n_{_take}(X1'', X2''))) -> TAKE(X1', take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2'), n_{_take}(X1'', X2''))) -> TAKE(take(activate(X1'''), activate(X2')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1'', X2''))) -> TAKE(s(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1'', X2''))) -> TAKE(from(activate(X')), take(activate(X1''), activate(X2'')))
ACTIVATE(n_{_take}(X1, n_{_s}(X''))) -> TAKE(activate(X1), s(X''))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), s(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_s}(X'')))) -> TAKE(activate(X1), s(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_s}(n_{_from}(X'')))) -> TAKE(activate(X1), s(from(activate(X''))))
ACTIVATE(n_{_take}(X1', n_{_s}(X'))) -> TAKE(X1', s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_s}(X'))) -> TAKE(s(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_s}(X'))) -> TAKE(from(activate(X'')), s(activate(X')))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), from(X''))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_take}(X1'', X2')))) -> TAKE(activate(X1), from(take(activate(X1''), activate(X2'))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_s}(X'')))) -> TAKE(activate(X1), from(s(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(n_{_from}(X'')))) -> TAKE(activate(X1), from(from(activate(X''))))
ACTIVATE(n_{_take}(X1, n_{_from}(X''))) -> TAKE(activate(X1), cons(activate(X''), n_{_from}(n_{_s}(activate(X'')))))
ACTIVATE(n_{_take}(X1', n_{_from}(X'))) -> TAKE(X1', from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_s}(X''), n_{_from}(X'))) -> TAKE(s(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_from}(X''), n_{_from}(X'))) -> TAKE(from(activate(X'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_take}(X1', X2'''))) -> TAKE(take(activate(X1''), activate(X2'')), take(activate(X1'), activate(X2''')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_s}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), s(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2''), n_{_from}(X'))) -> TAKE(take(activate(X1''), activate(X2'')), from(activate(X')))
ACTIVATE(n_{_take}(n_{_take}(X1'', X2'''), X2)) -> TAKE(take(activate(X1''), X2'''), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_take}(X1', X2''')), X2)) -> TAKE(take(activate(X1''), take(activate(X1'), activate(X2'''))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_s}(X')), X2)) -> TAKE(take(activate(X1''), s(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1'', n_{_from}(X')), X2)) -> TAKE(take(activate(X1''), from(activate(X'))), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(X1''', X2''), X2)) -> TAKE(take(X1''', activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_take}(X1', X2'''), X2''), X2)) -> TAKE(take(take(activate(X1'), activate(X2''')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_s}(X'), X2''), X2)) -> TAKE(take(s(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_take}(n_{_from}(X'), X2''), X2)) -> TAKE(take(from(activate(X')), activate(X2'')), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_take}(X1', X2''))) -> TAKE(s(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_s}(X''))) -> TAKE(s(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X'), n_{_from}(X''))) -> TAKE(s(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_s}(X''), X2)) -> TAKE(s(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_take}(X1', X2'')), X2)) -> TAKE(s(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_s}(X'')), X2)) -> TAKE(s(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_s}(n_{_from}(X'')), X2)) -> TAKE(s(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_take}(X1', X2''))) -> TAKE(from(activate(X')), take(activate(X1'), activate(X2'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_s}(X''))) -> TAKE(from(activate(X')), s(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X'), n_{_from}(X''))) -> TAKE(from(activate(X')), from(activate(X'')))
ACTIVATE(n_{_take}(n_{_from}(X''), X2)) -> TAKE(from(X''), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_take}(X1', X2'')), X2)) -> TAKE(from(take(activate(X1'), activate(X2''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_s}(X'')), X2)) -> TAKE(from(s(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(n_{_from}(n_{_from}(X'')), X2)) -> TAKE(from(from(activate(X''))), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_take}(X1, n_{_take}(X1'', X2'''))) -> TAKE(activate(X1), take(activate(X1''), X2'''))

Additionally, the following usable rules w.r.t. to the implicit AFS can be oriented:

activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X
take(0, XS) -> nil
take(s(N), cons(X, XS)) -> cons(X, n_{_take}(N, activate(XS)))
take(X1, X2) -> n_{_take}(X1, X2)
s(X) -> n_{_s}(X)
from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = x₁

POL(from(x₁)) = x₁

POL(activate(x₁)) = x₁

POL(0) = 0

POL(n__take(x₁, x₂)) = 1 + x₁ + x₂

POL(cons(x₁, x₂)) = x₂

POL(take(x₁, x₂)) = 1 + x₁ + x₂

POL(TAKE(x₁, x₂)) = x₂

POL(n__s(x₁)) = x₁

POL(nil) = 0

POL(s(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 12

                 ↳Dependency Graph

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
TAKE(s(N), cons(X, XS)) -> ACTIVATE(XS)

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph the DP problem was split into 1 DP problems.

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 13

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_from}(X)) -> ACTIVATE(X)

There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = 1 + x₁

POL(n__s(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 14

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pair:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)

There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__s(x₁)) = 1 + x₁

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Nar

           →DP Problem 3

             ↳Nar

...

               →DP Problem 15

                 ↳Dependency Graph

       →DP Problem 2

         ↳Nar

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Narrowing Transformation

Dependency Pair:

SEL(s(N), cons(X, XS)) -> SEL(N, activate(XS))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

SEL(s(N), cons(X, XS)) -> SEL(N, activate(XS))

four new Dependency Pairs are created:

SEL(s(N), cons(X, n_{_from}(X''))) -> SEL(N, from(activate(X'')))
SEL(s(N), cons(X, n_{_s}(X''))) -> SEL(N, s(activate(X'')))
SEL(s(N), cons(X, n_{_take}(X1', X2'))) -> SEL(N, take(activate(X1'), activate(X2')))
SEL(s(N), cons(X, XS')) -> SEL(N, XS')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Nar

           →DP Problem 16

             ↳Narrowing Transformation

Dependency Pairs:

SEL(s(N), cons(X, XS')) -> SEL(N, XS')
SEL(s(N), cons(X, n_{_take}(X1', X2'))) -> SEL(N, take(activate(X1'), activate(X2')))
SEL(s(N), cons(X, n_{_s}(X''))) -> SEL(N, s(activate(X'')))
SEL(s(N), cons(X, n_{_from}(X''))) -> SEL(N, from(activate(X'')))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

SEL(s(N), cons(X, n_{_from}(X''))) -> SEL(N, from(activate(X'')))

six new Dependency Pairs are created:

SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, cons(activate(X'''), n_{_from}(n_{_s}(activate(X''')))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, n_{_from}(activate(X''')))
SEL(s(N), cons(X, n_{_from}(n_{_from}(X''')))) -> SEL(N, from(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_s}(X''')))) -> SEL(N, from(s(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_take}(X1', X2')))) -> SEL(N, from(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, from(X'''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Nar

           →DP Problem 16

             ↳Nar

...

               →DP Problem 17

                 ↳Narrowing Transformation

Dependency Pairs:

SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, from(X'''))
SEL(s(N), cons(X, n_{_from}(n_{_take}(X1', X2')))) -> SEL(N, from(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_from}(n_{_from}(X''')))) -> SEL(N, from(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_s}(X''')))) -> SEL(N, from(s(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, cons(activate(X'''), n_{_from}(n_{_s}(activate(X''')))))
SEL(s(N), cons(X, n_{_take}(X1', X2'))) -> SEL(N, take(activate(X1'), activate(X2')))
SEL(s(N), cons(X, n_{_s}(X''))) -> SEL(N, s(activate(X'')))
SEL(s(N), cons(X, XS')) -> SEL(N, XS')

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

SEL(s(N), cons(X, n_{_s}(X''))) -> SEL(N, s(activate(X'')))

five new Dependency Pairs are created:

SEL(s(N), cons(X, n_{_s}(X'''))) -> SEL(N, n_{_s}(activate(X''')))
SEL(s(N), cons(X, n_{_s}(n_{_from}(X''')))) -> SEL(N, s(from(activate(X'''))))
SEL(s(N), cons(X, n_{_s}(n_{_s}(X''')))) -> SEL(N, s(s(activate(X'''))))
SEL(s(N), cons(X, n_{_s}(n_{_take}(X1', X2')))) -> SEL(N, s(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_s}(X'''))) -> SEL(N, s(X'''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Nar

           →DP Problem 16

             ↳Nar

...

               →DP Problem 18

                 ↳Narrowing Transformation

Dependency Pairs:

SEL(s(N), cons(X, n_{_s}(X'''))) -> SEL(N, s(X'''))
SEL(s(N), cons(X, n_{_s}(n_{_take}(X1', X2')))) -> SEL(N, s(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_s}(n_{_s}(X''')))) -> SEL(N, s(s(activate(X'''))))
SEL(s(N), cons(X, n_{_s}(n_{_from}(X''')))) -> SEL(N, s(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_take}(X1', X2')))) -> SEL(N, from(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_from}(n_{_from}(X''')))) -> SEL(N, from(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_s}(X''')))) -> SEL(N, from(s(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, cons(activate(X'''), n_{_from}(n_{_s}(activate(X''')))))
SEL(s(N), cons(X, XS')) -> SEL(N, XS')
SEL(s(N), cons(X, n_{_take}(X1', X2'))) -> SEL(N, take(activate(X1'), activate(X2')))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, from(X'''))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

SEL(s(N), cons(X, n_{_take}(X1', X2'))) -> SEL(N, take(activate(X1'), activate(X2')))

nine new Dependency Pairs are created:

SEL(s(N), cons(X, n_{_take}(X1'', X2''))) -> SEL(N, n_{_take}(activate(X1''), activate(X2'')))
SEL(s(N), cons(X, n_{_take}(n_{_from}(X''), X2'))) -> SEL(N, take(from(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_s}(X''), X2'))) -> SEL(N, take(s(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_take}(X1'', X2''), X2'))) -> SEL(N, take(take(activate(X1''), activate(X2'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(X1'', X2'))) -> SEL(N, take(X1'', activate(X2')))
SEL(s(N), cons(X, n_{_take}(X1', n_{_from}(X'')))) -> SEL(N, take(activate(X1'), from(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_s}(X'')))) -> SEL(N, take(activate(X1'), s(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_take}(X1'', X2'')))) -> SEL(N, take(activate(X1'), take(activate(X1''), activate(X2''))))
SEL(s(N), cons(X, n_{_take}(X1', X2''))) -> SEL(N, take(activate(X1'), X2''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Nar

           →DP Problem 16

             ↳Nar

...

               →DP Problem 19

                 ↳Polynomial Ordering

Dependency Pairs:

SEL(s(N), cons(X, n_{_take}(X1', X2''))) -> SEL(N, take(activate(X1'), X2''))
SEL(s(N), cons(X, n_{_take}(X1', n_{_take}(X1'', X2'')))) -> SEL(N, take(activate(X1'), take(activate(X1''), activate(X2''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_s}(X'')))) -> SEL(N, take(activate(X1'), s(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_from}(X'')))) -> SEL(N, take(activate(X1'), from(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1'', X2'))) -> SEL(N, take(X1'', activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_take}(X1'', X2''), X2'))) -> SEL(N, take(take(activate(X1''), activate(X2'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_s}(X''), X2'))) -> SEL(N, take(s(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_from}(X''), X2'))) -> SEL(N, take(from(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_s}(n_{_take}(X1', X2')))) -> SEL(N, s(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_s}(n_{_s}(X''')))) -> SEL(N, s(s(activate(X'''))))
SEL(s(N), cons(X, n_{_s}(n_{_from}(X''')))) -> SEL(N, s(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, from(X'''))
SEL(s(N), cons(X, n_{_from}(n_{_take}(X1', X2')))) -> SEL(N, from(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_from}(n_{_from}(X''')))) -> SEL(N, from(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_s}(X''')))) -> SEL(N, from(s(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, cons(activate(X'''), n_{_from}(n_{_s}(activate(X''')))))
SEL(s(N), cons(X, XS')) -> SEL(N, XS')
SEL(s(N), cons(X, n_{_s}(X'''))) -> SEL(N, s(X'''))

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

The following dependency pairs can be strictly oriented:

SEL(s(N), cons(X, n_{_take}(X1', X2''))) -> SEL(N, take(activate(X1'), X2''))
SEL(s(N), cons(X, n_{_take}(X1', n_{_take}(X1'', X2'')))) -> SEL(N, take(activate(X1'), take(activate(X1''), activate(X2''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_s}(X'')))) -> SEL(N, take(activate(X1'), s(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1', n_{_from}(X'')))) -> SEL(N, take(activate(X1'), from(activate(X''))))
SEL(s(N), cons(X, n_{_take}(X1'', X2'))) -> SEL(N, take(X1'', activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_take}(X1'', X2''), X2'))) -> SEL(N, take(take(activate(X1''), activate(X2'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_s}(X''), X2'))) -> SEL(N, take(s(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_take}(n_{_from}(X''), X2'))) -> SEL(N, take(from(activate(X'')), activate(X2')))
SEL(s(N), cons(X, n_{_s}(n_{_take}(X1', X2')))) -> SEL(N, s(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_s}(n_{_s}(X''')))) -> SEL(N, s(s(activate(X'''))))
SEL(s(N), cons(X, n_{_s}(n_{_from}(X''')))) -> SEL(N, s(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, from(X'''))
SEL(s(N), cons(X, n_{_from}(n_{_take}(X1', X2')))) -> SEL(N, from(take(activate(X1'), activate(X2'))))
SEL(s(N), cons(X, n_{_from}(n_{_from}(X''')))) -> SEL(N, from(from(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(n_{_s}(X''')))) -> SEL(N, from(s(activate(X'''))))
SEL(s(N), cons(X, n_{_from}(X'''))) -> SEL(N, cons(activate(X'''), n_{_from}(n_{_s}(activate(X''')))))
SEL(s(N), cons(X, XS')) -> SEL(N, XS')
SEL(s(N), cons(X, n_{_s}(X'''))) -> SEL(N, s(X'''))

There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__from(x₁)) = 0

POL(from(x₁)) = 0

POL(activate(x₁)) = 0

POL(0) = 0

POL(n__take(x₁, x₂)) = 0

POL(cons(x₁, x₂)) = 0

POL(SEL(x₁, x₂)) = x₁

POL(take(x₁, x₂)) = 0

POL(n__s(x₁)) = 0

POL(nil) = 0

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Nar

       →DP Problem 2

         ↳Nar

           →DP Problem 16

             ↳Nar

...

               →DP Problem 20

                 ↳Dependency Graph

Dependency Pair:

Rules:

from(X) -> cons(X, n_{_from}(n_{_s}(X)))
from(X) -> n_{_from}(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)))
take(X1, X2) -> n_{_take}(X1, X2)
sel(0, cons(X, XS)) -> X
sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
s(X) -> n_{_s}(X)
activate(n_{_from}(X)) -> from(activate(X))
activate(n_{_s}(X)) -> s(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:18 minutes

POL(n__from(x₁))	= x₁
POL(from(x₁))	= x₁
POL(activate(x₁))	= x₁
POL(0)	= 0
POL(n__take(x₁, x₂))	= 1 + x₁ + x₂
POL(cons(x₁, x₂))	= x₂
POL(take(x₁, x₂))	= 1 + x₁ + x₂
POL(TAKE(x₁, x₂))	= x₂
POL(n__s(x₁))	= x₁
POL(nil)	= 0
POL(s(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁

POL(n__from(x₁))	= 1 + x₁
POL(n__s(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁