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


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


YES
Input TRS:
    1: 0(\#()) -> \#()
    2: +(x,\#()) -> x
    3: +(\#(),x) -> x
    4: +(0(x),0(y)) -> 0(+(x,y))
    5: +(0(x),1(y)) -> 1(+(x,y))
    6: +(1(x),0(y)) -> 1(+(x,y))
    7: +(1(x),1(y)) -> 0(+(+(x,y),1(\#())))
    8: +(+(x,y),z) -> +(x,+(y,z))
    9: *(\#(),x) -> \#()
    10: *(0(x),y) -> 0(*(x,y))
    11: *(1(x),y) -> +(0(*(x,y)),y)
    12: *(*(x,y),z) -> *(x,*(y,z))
    13: sum(nil()) -> 0(\#())
    14: sum(cons(x,l)) -> +(x,sum(l))
    15: prod(nil()) -> 1(\#())
    16: prod(cons(x,l)) -> *(x,prod(l))
Number of strict rules: 16
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #+(1(x),0(y)) -> #+(x,y)
   #2: #sum(nil()) -> #0(\#())
   #3: #*(1(x),y) -> #+(0(*(x,y)),y)
   #4: #*(1(x),y) -> #0(*(x,y))
   #5: #*(1(x),y) -> #*(x,y)
   #6: #*(*(x,y),z) -> #*(x,*(y,z))
   #7: #*(*(x,y),z) -> #*(y,z)
   #8: #sum(cons(x,l)) -> #+(x,sum(l))
   #9: #sum(cons(x,l)) -> #sum(l)
   #10: #+(1(x),1(y)) -> #0(+(+(x,y),1(\#())))
   #11: #+(1(x),1(y)) -> #+(+(x,y),1(\#()))
   #12: #+(1(x),1(y)) -> #+(x,y)
   #13: #*(0(x),y) -> #0(*(x,y))
   #14: #*(0(x),y) -> #*(x,y)
   #15: #+(0(x),1(y)) -> #+(x,y)
   #16: #prod(cons(x,l)) -> #*(x,prod(l))
   #17: #prod(cons(x,l)) -> #prod(l)
   #18: #+(+(x,y),z) -> #+(x,+(y,z))
   #19: #+(+(x,y),z) -> #+(y,z)
   #20: #+(0(x),0(y)) -> #0(+(x,y))
   #21: #+(0(x),0(y)) -> #+(x,y)
Number of SCCs: 4, DPs: 13
  SCC { #9 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: 0
      prod	w: 0
      #prod	w: 0
      #* 	w: 0
      \#	w: 0
      sum	w: 0
      0 	w: 0
      nil	w: 0
      cons	w: x2 + 1
      + 	w: 0
      #sum	w: x1
      #+ 	w: 0
      * 	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 3, DPs: 12
  SCC { #17 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: 0
      prod	w: 0
      #prod	w: x1
      #* 	w: 0
      \#	w: 0
      sum	w: 0
      0 	w: 0
      nil	w: 0
      cons	w: x2 + 1
      + 	w: 0
      #sum	w: 0
      #+ 	w: 0
      * 	w: 0
    USABLE RULES: { }
    Removed DPs: #17
Number of SCCs: 2, DPs: 11
  SCC { #5..7 #14 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: x1 + 1
      prod	w: 0
      #prod	w: 0
      #* 	w: x1
      \#	w: 1
      sum	w: 0
      0 	w: x1 + 2
      nil	w: 0
      cons	w: 1
      + 	w: x1 + x2 + 1
      #sum	w: 0
      #+ 	w: 0
      * 	w: x1 + x2 + 1
    USABLE RULES: { }
    Removed DPs: #5..7 #14
Number of SCCs: 1, DPs: 7
  SCC { #1 #11 #12 #15 #18 #19 #21 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: x1 + 3
      prod	w: 0
      #prod	w: 0
      #* 	w: 0
      \#	w: 1
      sum	w: 0
      0 	w: x1 + 1
      nil	w: 0
      cons	w: 1
      + 	w: x1 + x2 + 1
      #sum	w: 0
      #+ 	w: x1 + x2
      * 	w: x2
    USABLE RULES: { 1..8 }
    Removed DPs: #1 #11 #12 #15 #19 #21
Number of SCCs: 1, DPs: 1
  SCC { #18 }
POLO(Sum)... succeeded.
      #0 	w: 0
      1 	w: x1 + 3
      prod	w: 0
      #prod	w: 0
      #* 	w: 0
      \#	w: 1
      sum	w: 0
      0 	w: x1 + 1
      nil	w: 0
      cons	w: 1
      + 	w: x1 + x2 + 1
      #sum	w: 0
      #+ 	w: x1
      * 	w: x2
    USABLE RULES: { 1..8 }
    Removed DPs: #18
Number of SCCs: 0, DPs: 0