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


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


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