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


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


YES
Input TRS:
    1: terms(N) -> cons(recip(sqr(N)),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,n__first(X,activate(Z)))
    10: half(0()) -> 0()
    11: half(s(0())) -> 0()
    12: half(s(s(X))) -> s(half(X))
    13: half(dbl(X)) -> X
    14: terms(X) -> n__terms(X)
    15: first(X1,X2) -> n__first(X1,X2)
    16: activate(n__terms(X)) -> terms(X)
    17: activate(n__first(X1,X2)) -> first(X1,X2)
    18: activate(X) -> X
Number of strict rules: 18
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #first(s(X),cons(Y,Z)) -> #activate(Z)
   #2: #half(s(s(X))) -> #half(X)
   #3: #add(s(X),Y) -> #add(X,Y)
   #4: #dbl(s(X)) -> #dbl(X)
   #5: #activate(n__first(X1,X2)) -> #first(X1,X2)
   #6: #activate(n__terms(X)) -> #terms(X)
   #7: #sqr(s(X)) -> #add(sqr(X),dbl(X))
   #8: #sqr(s(X)) -> #sqr(X)
   #9: #sqr(s(X)) -> #dbl(X)
   #10: #terms(N) -> #sqr(N)
Number of SCCs: 5, DPs: 6
  SCC { #8 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      n__first	w: 0
      recip	w: 0
      activate	w: 0
      dbl	w: 0
      #dbl	w: 0
      #terms	w: 0
      #activate	w: 0
      #half	w: 0
      half	w: 0
      #sqr	w: x1
      0 	w: 0
      #first	w: 0
      nil	w: 0
      first	w: 0
      n__terms	w: 0
      cons	w: 0
      #add	w: 0
      add	w: 0
      sqr	w: 0
      terms	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 4, DPs: 5
  SCC { #4 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      n__first	w: 0
      recip	w: 0
      activate	w: 0
      dbl	w: 0
      #dbl	w: x1
      #terms	w: 0
      #activate	w: 0
      #half	w: 0
      half	w: 0
      #sqr	w: 0
      0 	w: 0
      #first	w: 0
      nil	w: 0
      first	w: 0
      n__terms	w: 0
      cons	w: 0
      #add	w: 0
      add	w: 0
      sqr	w: 0
      terms	w: 0
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 3, DPs: 4
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      n__first	w: 0
      recip	w: 0
      activate	w: 0
      dbl	w: 0
      #dbl	w: 0
      #terms	w: 0
      #activate	w: 0
      #half	w: x1
      half	w: 0
      #sqr	w: 0
      0 	w: 0
      #first	w: 0
      nil	w: 0
      first	w: 0
      n__terms	w: 0
      cons	w: 0
      #add	w: 0
      add	w: 0
      sqr	w: 0
      terms	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      n__first	w: 0
      recip	w: 0
      activate	w: 0
      dbl	w: 0
      #dbl	w: 0
      #terms	w: 0
      #activate	w: 0
      #half	w: 0
      half	w: 0
      #sqr	w: 0
      0 	w: 0
      #first	w: 0
      nil	w: 0
      first	w: 0
      n__terms	w: 0
      cons	w: 0
      #add	w: x1
      add	w: 0
      sqr	w: 0
      terms	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 2
  SCC { #1 #5 }
POLO(Sum)... succeeded.
      s 	w: 1
      n__first	w: x1 + x2 + 1
      recip	w: 0
      activate	w: 0
      dbl	w: 0
      #dbl	w: 0
      #terms	w: 0
      #activate	w: x1
      #half	w: 0
      half	w: 0
      #sqr	w: 0
      0 	w: 0
      #first	w: x2
      nil	w: 0
      first	w: 0
      n__terms	w: 0
      cons	w: x2 + 1
      #add	w: 0
      add	w: 0
      sqr	w: 0
      terms	w: 0
    USABLE RULES: { }
    Removed DPs: #1 #5
Number of SCCs: 0, DPs: 0