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


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


MAYBE
Input TRS:
    1: h(X) -> g(X,X)
    2: g(a(),X) -> f(b(),activate(X))
    3: f(X,X) -> h(a())
    4: a() -> b()
    5: activate(X) -> X
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #g(a(),X) -> #f(b(),activate(X))
   #2: #g(a(),X) -> #activate(X)
   #3: #f(X,X) -> #h(a())
   #4: #f(X,X) -> #a()
   #5: #h(X) -> #g(X,X)
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.