Input TRS:
    1: terms(N) -> cons(recip(sqr(N)),terms(s(N)))
    2: sqr(0()) -> 0()
    3: sqr(s(X)) -> s(add(sqr(X),dbl(X)))
    4: dbl(0()) -> 0()
    5: dbl(s(X)) -> s(s(dbl(X)))
    6: add(0(),X) -> X
    7: add(s(X),Y) -> s(add(X,Y))
    8: first(0(),X) -> nil()
    9: first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
Number of strict rules: 9
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #first(s(X),cons(Y,Z)) -> #first(X,Z)
   #2: #add(s(X),Y) -> #add(X,Y)
   #3: #dbl(s(X)) -> #dbl(X)
   #4: #sqr(s(X)) -> #add(sqr(X),dbl(X))
   #5: #sqr(s(X)) -> #sqr(X)
   #6: #sqr(s(X)) -> #dbl(X)
   #7: #terms(N) -> #sqr(N)
   #8: #terms(N) -> #terms(s(N))
Number of SCCs: 5, DPs: 5, edges: 5
	SCC { #3 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 2) + x1
 recip(x1)	weight: 0
   dbl(x1)	weight: 0
 #dbl(x1)	weight: x1
#terms(x1)	weight: 0
 #sqr(x1)	weight: 0
     0()	weight: 0
#first(x1,x2)	weight: 0
   nil()	weight: 0
 first(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
 #add(x1,x2)	weight: 0
   add(x1,x2)	weight: 0
   sqr(x1)	weight: 0
 terms(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #3
Number of SCCs: 4, DPs: 4, edges: 4
	SCC { #5 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 2) + x1
 recip(x1)	weight: 0
   dbl(x1)	weight: 0
 #dbl(x1)	weight: 0
#terms(x1)	weight: 0
 #sqr(x1)	weight: x1
     0()	weight: 0
#first(x1,x2)	weight: 0
   nil()	weight: 0
 first(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
 #add(x1,x2)	weight: 0
   add(x1,x2)	weight: 0
   sqr(x1)	weight: 0
 terms(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #5
Number of SCCs: 3, DPs: 3, edges: 3
	SCC { #8 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  found.
  #terms(N)	-#8->
  #terms(s(N))	--->*
  #terms(s(N))
  Looping with: [ N := s(N); ]
NO