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


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


MAYBE
Input TRS:
    1: min(0(),y) -> 0()
    2: min(x,0()) -> 0()
    3: min(s(x),s(y)) -> s(min(x,y))
    4: max(0(),y) -> y
    5: max(x,0()) -> x
    6: max(s(x),s(y)) -> s(max(x,y))
    7: twice(0()) -> 0()
    8: twice(s(x)) -> s(s(twice(x)))
    9: -(x,0()) -> x
    10: -(s(x),s(y)) -> -(x,y)
    11: p(s(x)) -> x
    12: f(s(x),s(y)) -> f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y))))
Number of strict rules: 12
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #max(s(x),s(y)) -> #max(x,y)
   #2: #f(s(x),s(y)) -> #f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y))))
   #3: #f(s(x),s(y)) -> #-(max(s(x),s(y)),min(s(x),s(y)))
   #4: #f(s(x),s(y)) -> #max(s(x),s(y))
   #5: #f(s(x),s(y)) -> #min(s(x),s(y))
   #6: #f(s(x),s(y)) -> #p(twice(min(x,y)))
   #7: #f(s(x),s(y)) -> #twice(min(x,y))
   #8: #f(s(x),s(y)) -> #min(x,y)
   #9: #-(s(x),s(y)) -> #-(x,y)
   #10: #min(s(x),s(y)) -> #min(x,y)
   #11: #twice(s(x)) -> #twice(x)
Number of SCCs: 5, DPs: 5
	SCC { #11 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  twice(x1)		w: (0)
  #min(x1,x2)		w: (0)
  #p(x1)		w: (0)
  f(x1,x2)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  max(x1,x2)		w: (0)
  #max(x1,x2)		w: (0)
  -(x1,x2)		w: (0)
  #f(x1,x2)		w: (0)
  #twice(x1)		w: (x1)
  min(x1,x2)		w: (0)
  #-(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 4, DPs: 4
	SCC { #9 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  twice(x1)		w: (0)
  #min(x1,x2)		w: (0)
  #p(x1)		w: (0)
  f(x1,x2)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  max(x1,x2)		w: (0)
  #max(x1,x2)		w: (0)
  -(x1,x2)		w: (0)
  #f(x1,x2)		w: (0)
  #twice(x1)		w: (0)
  min(x1,x2)		w: (0)
  #-(x1,x2)		w: (x2)
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 3, DPs: 3
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  twice(x1)		w: (0)
  #min(x1,x2)		w: (0)
  #p(x1)		w: (0)
  f(x1,x2)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  max(x1,x2)		w: (0)
  #max(x1,x2)		w: (x2)
  -(x1,x2)		w: (0)
  #f(x1,x2)		w: (0)
  #twice(x1)		w: (0)
  min(x1,x2)		w: (0)
  #-(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 2
	SCC { #10 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  twice(x1)		w: (0)
  #min(x1,x2)		w: (x2)
  #p(x1)		w: (0)
  f(x1,x2)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  max(x1,x2)		w: (0)
  #max(x1,x2)		w: (0)
  -(x1,x2)		w: (0)
  #f(x1,x2)		w: (0)
  #twice(x1)		w: (0)
  min(x1,x2)		w: (0)
  #-(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #10
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.