/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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) -> \#()
    9: *(0(x),y) -> 0(*(x,y))
    10: *(1(x),y) -> +(0(*(x,y)),y)
    11: sum(nil()) -> 0(\#())
    12: sum(cons(x,l)) -> +(x,sum(l))
    13: prod(nil()) -> 1(\#())
    14: prod(cons(x,l)) -> *(x,prod(l))
Number of strict rules: 14
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #+(1(x),0(y)) -> #+(x,y)
   #2: #*(0(x),y) -> #0(*(x,y))
   #3: #*(0(x),y) -> #*(x,y)
   #4: #sum(nil()) -> #0(\#())
   #5: #sum(cons(x,l)) -> #+(x,sum(l))
   #6: #sum(cons(x,l)) -> #sum(l)
   #7: #prod(cons(x,l)) -> #*(x,prod(l))
   #8: #prod(cons(x,l)) -> #prod(l)
   #9: #+(1(x),1(y)) -> #0(+(+(x,y),1(\#())))
   #10: #+(1(x),1(y)) -> #+(+(x,y),1(\#()))
   #11: #+(1(x),1(y)) -> #+(x,y)
   #12: #*(1(x),y) -> #+(0(*(x,y)),y)
   #13: #*(1(x),y) -> #0(*(x,y))
   #14: #*(1(x),y) -> #*(x,y)
   #15: #+(0(x),1(y)) -> #+(x,y)
   #16: #+(0(x),0(y)) -> #0(+(x,y))
   #17: #+(0(x),0(y)) -> #+(x,y)
Number of SCCs: 4, DPs: 9
	SCC { #8 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (0)
  prod(x1)		w: (0)
  #prod(x1)		w: (x1)
  #*(x1,x2)		w: (0)
  \#()		w: (0)
  sum(x1)		w: (0)
  0(x1)		w: (0)
  nil()		w: (0)
  cons(x1,x2)		w: (1 + x2)
  +(x1,x2)		w: (0)
  #sum(x1)		w: (0)
  #+(x1,x2)		w: (0)
  *(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 3, DPs: 8
	SCC { #6 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (0)
  prod(x1)		w: (0)
  #prod(x1)		w: (0)
  #*(x1,x2)		w: (0)
  \#()		w: (0)
  sum(x1)		w: (0)
  0(x1)		w: (0)
  nil()		w: (0)
  cons(x1,x2)		w: (1 + x2)
  +(x1,x2)		w: (0)
  #sum(x1)		w: (x1)
  #+(x1,x2)		w: (0)
  *(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 7
	SCC { #3 #14 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (1 + x1)
  prod(x1)		w: (0)
  #prod(x1)		w: (0)
  #*(x1,x2)		w: (x1)
  \#()		w: (0)
  sum(x1)		w: (0)
  0(x1)		w: (1 + x1)
  nil()		w: (0)
  cons(x1,x2)		w: (1)
  +(x1,x2)		w: (0)
  #sum(x1)		w: (0)
  #+(x1,x2)		w: (0)
  *(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #3 #14
Number of SCCs: 1, DPs: 5
	SCC { #1 #10 #11 #15 #17 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (21239 + x1)
  prod(x1)		w: (0)
  #prod(x1)		w: (0)
  #*(x1,x2)		w: (0)
  \#()		w: (0)
  sum(x1)		w: (0)
  0(x1)		w: (39 + x1)
  nil()		w: (0)
  cons(x1,x2)		w: (1)
  +(x1,x2)		w: (7720)
  #sum(x1)		w: (0)
  #+(x1,x2)		w: (x2)
  *(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1 #11 #15 #17
Number of SCCs: 1, DPs: 1
	SCC { #10 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (1144 + x1)
  prod(x1)		w: (0)
  #prod(x1)		w: (0)
  #*(x1,x2)		w: (0)
  \#()		w: (0)
  sum(x1)		w: (0)
  0(x1)		w: (1 + x1)
  nil()		w: (0)
  cons(x1,x2)		w: (1)
  +(x1,x2)		w: (1143 + x2 + x1)
  #sum(x1)		w: (0)
  #+(x1,x2)		w: (x2 + x1)
  *(x1,x2)		w: (0)
    USABLE RULES: { 1..7 }
    Removed DPs: #10
Number of SCCs: 0, DPs: 0