Term Rewriting System R:
[X, Y, L, X1, X2]
eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

EQ(ns(X), ns(Y)) -> EQ(activate(X), activate(Y))
EQ(ns(X), ns(Y)) -> ACTIVATE(X)
EQ(ns(X), ns(Y)) -> ACTIVATE(Y)
INF(X) -> S(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)
LENGTH(nil) -> 0'
LENGTH(cons(X, L)) -> S(nlength(activate(L)))
LENGTH(cons(X, L)) -> ACTIVATE(L)
ACTIVATE(n0) -> 0'
ACTIVATE(ns(X)) -> S(X)
ACTIVATE(ninf(X)) -> INF(X)
ACTIVATE(ntake(X1, X2)) -> TAKE(X1, X2)
ACTIVATE(nlength(X)) -> LENGTH(X)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering
       →DP Problem 2
         ↳Nar


Dependency Pairs:

TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
LENGTH(cons(X, L)) -> ACTIVATE(L)
ACTIVATE(nlength(X)) -> LENGTH(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
ACTIVATE(ntake(X1, X2)) -> TAKE(X1, X2)


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





The following dependency pair can be strictly oriented:

ACTIVATE(nlength(X)) -> LENGTH(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__length(x1))=  1 + x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(n__take(x1, x2))=  x1 + x2  
  POL(TAKE(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(ACTIVATE(x1))=  x1  
  POL(LENGTH(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 3
             ↳Dependency Graph
       →DP Problem 2
         ↳Nar


Dependency Pairs:

TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
LENGTH(cons(X, L)) -> ACTIVATE(L)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
ACTIVATE(ntake(X1, X2)) -> TAKE(X1, X2)


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





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


   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 3
             ↳DGraph
             ...
               →DP Problem 4
                 ↳Polynomial Ordering
       →DP Problem 2
         ↳Nar


Dependency Pairs:

TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
ACTIVATE(ntake(X1, X2)) -> TAKE(X1, X2)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





The following dependency pair can be strictly oriented:

ACTIVATE(ntake(X1, X2)) -> TAKE(X1, X2)


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(cons(x1, x2))=  x1 + x2  
  POL(n__take(x1, x2))=  1 + x1 + x2  
  POL(TAKE(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(ACTIVATE(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 3
             ↳DGraph
             ...
               →DP Problem 5
                 ↳Dependency Graph
       →DP Problem 2
         ↳Nar


Dependency Pairs:

TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Narrowing Transformation


Dependency Pair:

EQ(ns(X), ns(Y)) -> EQ(activate(X), activate(Y))


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





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

EQ(ns(X), ns(Y)) -> EQ(activate(X), activate(Y))
12 new Dependency Pairs are created:

EQ(ns(n0), ns(Y)) -> EQ(0, activate(Y))
EQ(ns(ns(X'')), ns(Y)) -> EQ(s(X''), activate(Y))
EQ(ns(ninf(X'')), ns(Y)) -> EQ(inf(X''), activate(Y))
EQ(ns(ntake(X1', X2')), ns(Y)) -> EQ(take(X1', X2'), activate(Y))
EQ(ns(nlength(X'')), ns(Y)) -> EQ(length(X''), activate(Y))
EQ(ns(X''), ns(Y)) -> EQ(X'', activate(Y))
EQ(ns(X), ns(n0)) -> EQ(activate(X), 0)
EQ(ns(X), ns(ns(X''))) -> EQ(activate(X), s(X''))
EQ(ns(X), ns(ninf(X''))) -> EQ(activate(X), inf(X''))
EQ(ns(X), ns(ntake(X1', X2'))) -> EQ(activate(X), take(X1', X2'))
EQ(ns(X), ns(nlength(X''))) -> EQ(activate(X), length(X''))
EQ(ns(X), ns(Y')) -> EQ(activate(X), Y')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Nar
           →DP Problem 6
             ↳Polynomial Ordering


Dependency Pairs:

EQ(ns(X), ns(Y')) -> EQ(activate(X), Y')
EQ(ns(X), ns(nlength(X''))) -> EQ(activate(X), length(X''))
EQ(ns(X), ns(ntake(X1', X2'))) -> EQ(activate(X), take(X1', X2'))
EQ(ns(X), ns(ninf(X''))) -> EQ(activate(X), inf(X''))
EQ(ns(X), ns(ns(X''))) -> EQ(activate(X), s(X''))
EQ(ns(X), ns(n0)) -> EQ(activate(X), 0)
EQ(ns(X''), ns(Y)) -> EQ(X'', activate(Y))
EQ(ns(nlength(X'')), ns(Y)) -> EQ(length(X''), activate(Y))
EQ(ns(ntake(X1', X2')), ns(Y)) -> EQ(take(X1', X2'), activate(Y))
EQ(ns(ninf(X'')), ns(Y)) -> EQ(inf(X''), activate(Y))
EQ(ns(ns(X'')), ns(Y)) -> EQ(s(X''), activate(Y))
EQ(ns(n0), ns(Y)) -> EQ(0, activate(Y))


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





The following dependency pairs can be strictly oriented:

EQ(ns(X''), ns(Y)) -> EQ(X'', activate(Y))
EQ(ns(ntake(X1', X2')), ns(Y)) -> EQ(take(X1', X2'), activate(Y))
EQ(ns(ninf(X'')), ns(Y)) -> EQ(inf(X''), activate(Y))
EQ(ns(ns(X'')), ns(Y)) -> EQ(s(X''), activate(Y))
EQ(ns(n0), ns(Y)) -> EQ(0, activate(Y))


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

activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
s(X) -> ns(X)
0 -> n0


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(activate(x1))=  1 + x1  
  POL(n__length(x1))=  0  
  POL(EQ(x1, x2))=  1 + x1  
  POL(n__take(x1, x2))=  0  
  POL(take(x1, x2))=  0  
  POL(n__s(x1))=  1 + x1  
  POL(n__inf(x1))=  0  
  POL(0)=  0  
  POL(cons(x1, x2))=  0  
  POL(inf(x1))=  0  
  POL(nil)=  0  
  POL(n__0)=  0  
  POL(s(x1))=  1 + x1  
  POL(length(x1))=  1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Nar
           →DP Problem 6
             ↳Polo
             ...
               →DP Problem 7
                 ↳Polynomial Ordering


Dependency Pairs:

EQ(ns(X), ns(Y')) -> EQ(activate(X), Y')
EQ(ns(X), ns(nlength(X''))) -> EQ(activate(X), length(X''))
EQ(ns(X), ns(ntake(X1', X2'))) -> EQ(activate(X), take(X1', X2'))
EQ(ns(X), ns(ninf(X''))) -> EQ(activate(X), inf(X''))
EQ(ns(X), ns(ns(X''))) -> EQ(activate(X), s(X''))
EQ(ns(X), ns(n0)) -> EQ(activate(X), 0)
EQ(ns(nlength(X'')), ns(Y)) -> EQ(length(X''), activate(Y))


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X





The following dependency pairs can be strictly oriented:

EQ(ns(X), ns(Y')) -> EQ(activate(X), Y')
EQ(ns(X), ns(ntake(X1', X2'))) -> EQ(activate(X), take(X1', X2'))
EQ(ns(X), ns(ninf(X''))) -> EQ(activate(X), inf(X''))
EQ(ns(X), ns(ns(X''))) -> EQ(activate(X), s(X''))
EQ(ns(X), ns(n0)) -> EQ(activate(X), 0)


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

activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
s(X) -> ns(X)
0 -> n0


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(activate(x1))=  1 + x1  
  POL(n__length(x1))=  0  
  POL(EQ(x1, x2))=  1 + x2  
  POL(n__take(x1, x2))=  0  
  POL(take(x1, x2))=  0  
  POL(n__s(x1))=  1 + x1  
  POL(n__inf(x1))=  0  
  POL(0)=  0  
  POL(cons(x1, x2))=  0  
  POL(inf(x1))=  0  
  POL(nil)=  0  
  POL(n__0)=  0  
  POL(s(x1))=  1 + x1  
  POL(length(x1))=  1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Nar
           →DP Problem 6
             ↳Polo
             ...
               →DP Problem 8
                 ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

EQ(ns(X), ns(nlength(X''))) -> EQ(activate(X), length(X''))
EQ(ns(nlength(X'')), ns(Y)) -> EQ(length(X''), activate(Y))


Rules:


eq(n0, n0) -> true
eq(ns(X), ns(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, ninf(s(X)))
inf(X) -> ninf(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), ntake(activate(X), activate(L)))
take(X1, X2) -> ntake(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(nlength(activate(L)))
length(X) -> nlength(X)
0 -> n0
s(X) -> ns(X)
activate(n0) -> 0
activate(ns(X)) -> s(X)
activate(ninf(X)) -> inf(X)
activate(ntake(X1, X2)) -> take(X1, X2)
activate(nlength(X)) -> length(X)
activate(X) -> X




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