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


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


MAYBE
Input TRS:
    1: f(true(),x,y) -> f(gt(x,y),plus2(x),plus1(y))
    2: gt(s(x),0()) -> true()
    3: gt(0(),y) -> false()
    4: gt(s(x),s(y)) -> gt(x,y)
    5: plus1(x) -> plus(x,s(0()))
    6: plus2(x) -> plus(x,s(s(0())))
    7: plus(0(),y) -> y
    8: plus(s(x),y) -> plus(x,s(y))
Number of strict rules: 8
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #plus2(x) -> #plus(x,s(s(0())))
   #2: #plus1(x) -> #plus(x,s(0()))
   #3: #f(true(),x,y) -> #f(gt(x,y),plus2(x),plus1(y))
   #4: #f(true(),x,y) -> #gt(x,y)
   #5: #f(true(),x,y) -> #plus2(x)
   #6: #f(true(),x,y) -> #plus1(y)
   #7: #plus(s(x),y) -> #plus(x,s(y))
   #8: #gt(s(x),s(y)) -> #gt(x,y)
Number of SCCs: 3, DPs: 3
	SCC { #8 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  plus1(x1)		w: (0)
  #plus(x1,x2)		w: (0)
  false()		w: (0)
  #plus2(x1)		w: (0)
  true()		w: (0)
  f(x1,x2,x3)		w: (0)
  0()		w: (0)
  #gt(x1,x2)		w: (x2 + x1)
  #f(x1,x2,x3)		w: (0)
  plus(x1,x2)		w: (0)
  #plus1(x1)		w: (0)
  plus2(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 2
	SCC { #7 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  plus1(x1)		w: (0)
  #plus(x1,x2)		w: (x1)
  false()		w: (0)
  #plus2(x1)		w: (0)
  true()		w: (0)
  f(x1,x2,x3)		w: (0)
  0()		w: (0)
  #gt(x1,x2)		w: (0)
  #f(x1,x2,x3)		w: (0)
  plus(x1,x2)		w: (0)
  #plus1(x1)		w: (0)
  plus2(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 1
	SCC { #3 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.