/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(tt(),x) -> f(eq(x,half(double(x))),s(x))
    2: eq(s(x),s(y)) -> eq(x,y)
    3: eq(0(),0()) -> tt()
    4: double(s(x)) -> s(s(double(x)))
    5: double(0()) -> 0()
    6: half(s(s(x))) -> s(half(x))
    7: half(0()) -> 0()
Number of strict rules: 7
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #eq(s(x),s(y)) -> #eq(x,y)
   #2: #half(s(s(x))) -> #half(x)
   #3: #f(tt(),x) -> #f(eq(x,half(double(x))),s(x))
   #4: #f(tt(),x) -> #eq(x,half(double(x)))
   #5: #f(tt(),x) -> #half(double(x))
   #6: #f(tt(),x) -> #double(x)
   #7: #double(s(x)) -> #double(x)
Number of SCCs: 4, DPs: 4
	SCC { #7 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  eq(x1,x2)		w: (0)
  #half(x1)		w: (0)
  f(x1,x2)		w: (0)
  #eq(x1,x2)		w: (0)
  half(x1)		w: (0)
  0()		w: (0)
  #double(x1)		w: (x1)
  double(x1)		w: (0)
  #f(x1,x2)		w: (0)
  tt()		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 3, DPs: 3
	SCC { #2 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  eq(x1,x2)		w: (0)
  #half(x1)		w: (x1)
  f(x1,x2)		w: (0)
  #eq(x1,x2)		w: (0)
  half(x1)		w: (0)
  0()		w: (0)
  #double(x1)		w: (0)
  double(x1)		w: (0)
  #f(x1,x2)		w: (0)
  tt()		w: (0)
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 2
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  eq(x1,x2)		w: (0)
  #half(x1)		w: (0)
  f(x1,x2)		w: (0)
  #eq(x1,x2)		w: (x2)
  half(x1)		w: (0)
  0()		w: (0)
  #double(x1)		w: (0)
  double(x1)		w: (0)
  #f(x1,x2)		w: (0)
  tt()		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
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.