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


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


YES
Input TRS:
    1: from(X) -> cons(X,n__from(s(X)))
    2: 2ndspos(0(),Z) -> rnil()
    3: 2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
    4: 2ndsneg(0(),Z) -> rnil()
    5: 2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
    6: pi(X) -> 2ndspos(X,from(0()))
    7: plus(0(),Y) -> Y
    8: plus(s(X),Y) -> s(plus(X,Y))
    9: times(0(),Y) -> 0()
    10: times(s(X),Y) -> plus(Y,times(X,Y))
    11: square(X) -> times(X,X)
    12: from(X) -> n__from(X)
    13: cons(X1,X2) -> n__cons(X1,X2)
    14: activate(n__from(X)) -> from(X)
    15: activate(n__cons(X1,X2)) -> cons(X1,X2)
    16: activate(X) -> X
Number of strict rules: 16
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #pi(X) -> #2ndspos(X,from(0()))
   #2: #pi(X) -> #from(0())
   #3: #square(X) -> #times(X,X)
   #4: #activate(n__from(X)) -> #from(X)
   #5: #times(s(X),Y) -> #plus(Y,times(X,Y))
   #6: #times(s(X),Y) -> #times(X,Y)
   #7: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #activate(Y)
   #8: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #2ndspos(N,activate(Z))
   #9: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #activate(Z)
   #10: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #activate(Y)
   #11: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #2ndsneg(N,activate(Z))
   #12: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #activate(Z)
   #13: #from(X) -> #cons(X,n__from(s(X)))
   #14: #plus(s(X),Y) -> #plus(X,Y)
   #15: #activate(n__cons(X1,X2)) -> #cons(X1,X2)
Number of SCCs: 3, DPs: 4
  SCC { #6 }
POLO(Sum)... succeeded.
      negrecip	w: 0
      #cons	w: 0
      s 	w: x1 + 1
      2ndspos	w: 0
      activate	w: 0
      rnil	w: 0
      #plus	w: 0
      n__from	w: 0
      square	w: 0
      #activate	w: 0
      #square	w: 0
      pi	w: 0
      rcons	w: 0
      #times	w: x1
      0 	w: 0
      from	w: 0
      times	w: 0
      n__cons	w: 0
      2ndsneg	w: 0
      plus	w: 0
      #2ndspos	w: 0
      #from	w: 0
      cons	w: 0
      #pi	w: 0
      #2ndsneg	w: 0
      posrecip	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 3
  SCC { #14 }
POLO(Sum)... succeeded.
      negrecip	w: 0
      #cons	w: 0
      s 	w: x1 + 1
      2ndspos	w: 0
      activate	w: 0
      rnil	w: 0
      #plus	w: x1
      n__from	w: 0
      square	w: 0
      #activate	w: 0
      #square	w: 0
      pi	w: 0
      rcons	w: 0
      #times	w: 0
      0 	w: 0
      from	w: 0
      times	w: 0
      n__cons	w: 0
      2ndsneg	w: 0
      plus	w: 0
      #2ndspos	w: 0
      #from	w: 0
      cons	w: 0
      #pi	w: 0
      #2ndsneg	w: 0
      posrecip	w: 0
    USABLE RULES: { }
    Removed DPs: #14
Number of SCCs: 1, DPs: 2
  SCC { #8 #11 }
POLO(Sum)... succeeded.
      negrecip	w: 0
      #cons	w: 0
      s 	w: x1 + 1
      2ndspos	w: 0
      activate	w: x1 + 2
      rnil	w: 0
      #plus	w: 0
      n__from	w: x1 + 1
      square	w: 0
      #activate	w: 0
      #square	w: 0
      pi	w: 0
      rcons	w: 0
      #times	w: 0
      0 	w: 0
      from	w: x1 + 3
      times	w: 0
      n__cons	w: 1
      2ndsneg	w: 0
      plus	w: 0
      #2ndspos	w: x1
      #from	w: 0
      cons	w: x2 + 1
      #pi	w: 0
      #2ndsneg	w: x1
      posrecip	w: 0
    USABLE RULES: { 1 12 13 }
    Removed DPs: #8 #11
Number of SCCs: 0, DPs: 0