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


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


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