Term Rewriting System R:
[X, Z, N, Y, X1, X2]
from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
2ndspos(0, Z) -> rnil
2ndspos(s(N), cons(X, ncons(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) -> rnil
2ndsneg(s(N), cons(X, ncons(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
plus(s(X), Y) -> s(plus(X, Y))
times(0, Y) -> 0
times(s(X), Y) -> plus(Y, times(X, Y))
square(X) -> times(X, X)
s(X) -> ns(X)
cons(X1, X2) -> ncons(X1, X2)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X

Innermost Termination of R to be shown. 



   R
     ↳Removing Redundant Rules for Innermost Termination



Removing the following rules from R which left hand sides contain non normal subterms

2ndspos(s(N), cons(X, ncons(Y, Z))) -> rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(s(N), cons(X, ncons(Y, Z))) -> rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
plus(s(X), Y) -> s(plus(X, Y))
times(s(X), Y) -> plus(Y, times(X, Y))


   R
     ↳RRRI
       →TRS2
         ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

FROM(X) -> CONS(X, nfrom(ns(X)))
PI(X) -> 2NDSPOS(X, from(0))
PI(X) -> FROM(0)
SQUARE(X) -> TIMES(X, X)
ACTIVATE(nfrom(X)) -> FROM(activate(X))
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
ACTIVATE(ns(X)) -> S(activate(X))
ACTIVATE(ns(X)) -> ACTIVATE(X)
ACTIVATE(ncons(X1, X2)) -> CONS(activate(X1), X2)
ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)

Furthermore, R contains one SCC. 


   R
     ↳RRRI
       →TRS2
         ↳DPs
           →DP Problem 1
             ↳Size-Change Principle


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)
cons(X1, X2) -> ncons(X1, X2)
2ndspos(0, Z) -> rnil
2ndsneg(0, Z) -> rnil
pi(X) -> 2ndspos(X, from(0))
plus(0, Y) -> Y
times(0, Y) -> 0
square(X) -> times(X, X)
s(X) -> ns(X)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(ncons(X1, X2)) -> cons(activate(X1), X2)
activate(X) -> X





We number the DPs as follows:
  1. ACTIVATE(ncons(X1, X2)) -> ACTIVATE(X1)
  2. ACTIVATE(ns(X)) -> ACTIVATE(X)
  3. ACTIVATE(nfrom(X)) -> ACTIVATE(X)
and get the following Size-Change Graph(s):
{3, 2, 1} , {3, 2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{3, 2, 1} , {3, 2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
ncons(x1, x2) -> ncons(x1, x2)
nfrom(x1) -> nfrom(x1)
ns(x1) -> ns(x1)

We obtain no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes