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


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


MAYBE
Input TRS:
    1: suc(1()) -> .0(1())
    2: suc(.0(x)) -> .1(x)
    3: suc(.1(x)) -> .0(suc(x))
    4: add(x,1()) -> suc(x)
    5: add(1(),y) -> suc(y)
    6: add(.0(x),.0(y)) -> .0(add(x,y))
    7: add(.1(x),.0(y)) -> .1(add(x,y))
    8: add(.0(x),.1(y)) -> .1(add(x,y))
    9: add(.1(x),.1(y)) -> .0(suc(add(x,y)))
    10: C(.0(x)) -> C(x)
    11: C(.1(x)) -> C(add(.1(x),.1(.1(x))))
Number of strict rules: 11
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #add(.0(x),.0(y)) -> #add(x,y)
   #2: #add(.1(x),.1(y)) -> #suc(add(x,y))
   #3: #add(.1(x),.1(y)) -> #add(x,y)
   #4: #C(.1(x)) -> #C(add(.1(x),.1(.1(x))))
   #5: #C(.1(x)) -> #add(.1(x),.1(.1(x)))
   #6: #add(.1(x),.0(y)) -> #add(x,y)
   #7: #C(.0(x)) -> #C(x)
   #8: #add(1(),y) -> #suc(y)
   #9: #suc(.1(x)) -> #suc(x)
   #10: #add(.0(x),.1(y)) -> #add(x,y)
   #11: #add(x,1()) -> #suc(x)
Number of SCCs: 3, DPs: 7
	SCC { #9 }
Sum... succeeded.
  1()		w: (0)
  .0(x1)		w: (0)
  #suc(x1)		w: (x1)
  C(x1)		w: (0)
  #C(x1)		w: (0)
  suc(x1)		w: (0)
  #add(x1,x2)		w: (0)
  add(x1,x2)		w: (0)
  .1(x1)		w: (1 + x1)
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 2, DPs: 6
	SCC { #4 #7 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.