/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(a(),b(),X)) -> mark(f(X,X,X))
    2: active(c()) -> mark(a())
    3: active(c()) -> mark(b())
    4: active(f(X1,X2,X3)) -> f(X1,X2,active(X3))
    5: f(X1,X2,mark(X3)) -> mark(f(X1,X2,X3))
    6: proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
    7: proper(a()) -> ok(a())
    8: proper(b()) -> ok(b())
    9: proper(c()) -> ok(c())
    10: f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
    11: top(mark(X)) -> top(proper(X))
    12: top(ok(X)) -> top(active(X))
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying ... 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(mark(X)) -> #top(proper(X))
   #6: #top(mark(X)) -> #proper(X)
   #7: #top(ok(X)) -> #top(active(X))
   #8: #top(ok(X)) -> #active(X)
   #9: #f(ok(X1),ok(X2),ok(X3)) -> #f(X1,X2,X3)
   #10: #f(X1,X2,mark(X3)) -> #f(X1,X2,X3)
   #11: #active(f(a(),b(),X)) -> #f(X,X,X)
   #12: #active(f(X1,X2,X3)) -> #f(X1,X2,active(X3))
   #13: #active(f(X1,X2,X3)) -> #active(X3)
Number of SCCs: 4, DPs: 8
  SCC { #13 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: 0
      top	w: 0
      #top	w: 0
      c 	w: 0
      f 	w: x3 + 1
      proper	w: 0
      ok	w: 0
      mark	w: 0
      #f 	w: 0
      #proper	w: 0
      active	w: 0
      #active	w: x1
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 3, DPs: 7
  SCC { #5 #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.