/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO
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 POLO(bPol) ... failed.
Uncurrying ... 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
  SCC { #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #terms(N)	-#8->
  #terms(s(N))	--->*
  #terms(s(N))
  Looping with: [ N := s(N); ]