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