Term Rewriting System R:
[X, Y, X1, X2]
from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

FROM(X) -> CONS(X, nfrom(ns(X)))
LENGTH(ncons(X, Y)) -> S(length1(activate(Y)))
LENGTH(ncons(X, Y)) -> LENGTH1(activate(Y))
LENGTH(ncons(X, Y)) -> ACTIVATE(Y)
LENGTH1(X) -> LENGTH(activate(X))
LENGTH1(X) -> ACTIVATE(X)
ACTIVATE(nfrom(X)) -> FROM(activate(X))
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
ACTIVATE(ns(X)) -> S(activate(X))
ACTIVATE(ns(X)) -> ACTIVATE(X)
ACTIVATE(nnil) -> NIL
ACTIVATE(ncons(X1, X2)) -> CONS(activate(X1), X2)
ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)

Furthermore, R contains two SCCs.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Argument Filtering and Ordering`
`       →DP Problem 2`
`         ↳Remaining`

Dependency Pairs:

ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(ns(X)) -> ACTIVATE(X)
ACTIVATE(nfrom(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(nfrom(X)) -> ACTIVATE(X)

The following rules can be oriented:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(n__from(x1)) =  1 + x1 POL(from(x1)) =  1 + x1 POL(activate(x1)) =  x1 POL(0) =  0 POL(n__s(x1)) =  x1 POL(nil) =  0 POL(s(x1)) =  x1 POL(n__nil) =  0 POL(ACTIVATE(x1)) =  x1 POL(length) =  0 POL(length1) =  0

resulting in one new DP problem.
Used Argument Filtering System:
ACTIVATE(x1) -> ACTIVATE(x1)
ncons(x1, x2) -> x1
ns(x1) -> ns(x1)
nfrom(x1) -> nfrom(x1)
from(x1) -> from(x1)
cons(x1, x2) -> x1
length(x1) -> length
s(x1) -> s(x1)
length1(x1) -> length1
nil -> nil
activate(x1) -> activate(x1)

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳AFS`
`           →DP Problem 3`
`             ↳Argument Filtering and Ordering`
`       →DP Problem 2`
`         ↳Remaining`

Dependency Pairs:

ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(ns(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

The following dependency pair can be strictly oriented:

ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)

The following rules can be oriented:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(from(x1)) =  1 + x1 POL(activate(x1)) =  x1 POL(n__s(x1)) =  x1 POL(n__nil) =  0 POL(ACTIVATE(x1)) =  x1 POL(length1) =  0 POL(n__cons(x1)) =  1 + x1 POL(n__from(x1)) =  1 + x1 POL(0) =  0 POL(cons(x1)) =  1 + x1 POL(nil) =  0 POL(s(x1)) =  x1 POL(length) =  0

resulting in one new DP problem.
Used Argument Filtering System:
ACTIVATE(x1) -> ACTIVATE(x1)
ncons(x1, x2) -> ncons(x1)
ns(x1) -> ns(x1)
from(x1) -> from(x1)
cons(x1, x2) -> cons(x1)
nfrom(x1) -> nfrom(x1)
length(x1) -> length
s(x1) -> s(x1)
length1(x1) -> length1
nil -> nil
activate(x1) -> activate(x1)

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳AFS`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

ACTIVATE(ns(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

• Dependency Pairs:

LENGTH1(X) -> LENGTH(activate(X))
LENGTH(ncons(X, Y)) -> LENGTH1(activate(Y))

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳AFS`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

ACTIVATE(ns(X)) -> ACTIVATE(X)

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

• Dependency Pairs:

LENGTH1(X) -> LENGTH(activate(X))
LENGTH(ncons(X, Y)) -> LENGTH1(activate(Y))

Rules:

from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
length(nnil) -> 0
length(ncons(X, Y)) -> s(length1(activate(Y)))
length1(X) -> length(activate(X))
s(X) -> ns(X)
nil -> nnil
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(nnil) -> nil
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Termination of R could not be shown.
Duration:
0:34 minutes