Input TRS:
    1: f(a(),n__b(),X) -> f(X,X,X)
    2: c() -> a()
    3: c() -> b()
    4: b() -> n__b()
    5: activate(n__b()) -> b()
    6: activate(X) -> X
Number of strict rules: 6
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #activate(n__b()) -> #b()
   #2: #c() -> #b()
   #3: #f(a(),n__b(),X) -> #f(X,X,X)
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #3 }
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...  failed.
MAYBE