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


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


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