/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),trunc(x),s(y))
    2: trunc(0()) -> 0()
    3: trunc(s(0())) -> 0()
    4: trunc(s(s(x))) -> s(s(trunc(x)))
    5: gt(0(),v) -> false()
    6: gt(s(u),0()) -> true()
    7: gt(s(u),s(v)) -> gt(u,v)
Number of strict rules: 7
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #gt(s(u),s(v)) -> #gt(u,v)
   #2: #f(true(),x,y) -> #f(gt(x,y),trunc(x),s(y))
   #3: #f(true(),x,y) -> #gt(x,y)
   #4: #f(true(),x,y) -> #trunc(x)
   #5: #trunc(s(s(x))) -> #trunc(x)
Number of SCCs: 3, DPs: 3
	SCC { #5 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  false()		w: (0)
  true()		w: (0)
  f(x1,x2,x3)		w: (0)
  #trunc(x1)		w: (x1)
  0()		w: (0)
  #gt(x1,x2)		w: (0)
  #f(x1,x2,x3)		w: (0)
  trunc(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 2, DPs: 2
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  false()		w: (0)
  true()		w: (0)
  f(x1,x2,x3)		w: (0)
  #trunc(x1)		w: (0)
  0()		w: (0)
  #gt(x1,x2)		w: (x2)
  #f(x1,x2,x3)		w: (0)
  trunc(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
	SCC { #2 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.