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


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


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