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 Order(PosReal,>,Poly) ... failed.
Freezing ... 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, edges: 1
	SCC { #4 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: 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: [ ]
NO