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


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


MAYBE
Input TRS:
    1: active(f(b(),c(),x)) -> mark(f(x,x,x))
    2: active(f(x,y,z)) -> f(x,y,active(z))
    3: active(d()) -> m(b())
    4: f(x,y,mark(z)) -> mark(f(x,y,z))
    5: active(d()) -> mark(c())
    6: proper(b()) -> ok(b())
    7: proper(c()) -> ok(c())
    8: proper(d()) -> ok(d())
    9: proper(f(x,y,z)) -> f(proper(x),proper(y),proper(z))
    10: f(ok(x),ok(y),ok(z)) -> ok(f(x,y,z))
    11: top(mark(x)) -> top(proper(x))
    12: top(ok(x)) -> top(active(x))
Number of strict rules: 12
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(f(x,y,z)) -> #f(x,y,active(z))
   #2: #active(f(x,y,z)) -> #active(z)
   #3: #proper(f(x,y,z)) -> #f(proper(x),proper(y),proper(z))
   #4: #proper(f(x,y,z)) -> #proper(x)
   #5: #proper(f(x,y,z)) -> #proper(y)
   #6: #proper(f(x,y,z)) -> #proper(z)
   #7: #top(mark(x)) -> #top(proper(x))
   #8: #top(mark(x)) -> #proper(x)
   #9: #top(ok(x)) -> #top(active(x))
   #10: #top(ok(x)) -> #active(x)
   #11: #f(ok(x),ok(y),ok(z)) -> #f(x,y,z)
   #12: #active(f(b(),c(),x)) -> #f(x,x,x)
   #13: #f(x,y,mark(z)) -> #f(x,y,z)
Number of SCCs: 4, DPs: 8
	SCC { #2 }
Sum... succeeded.
  d()		w: (0)
  b()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  c()		w: (0)
  f(x1,x2,x3)		w: (1 + x3)
  proper(x1)		w: (0)
  ok(x1)		w: (0)
  mark(x1)		w: (0)
  #f(x1,x2,x3)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (0)
  #active(x1)		w: (x1)
  m(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 3, DPs: 7
	SCC { #7 #9 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.