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


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


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