Input TRS:
    1: f(n__b(),X,n__c()) -> f(X,c(),X)
    2: c() -> b()
    3: b() -> n__b()
    4: c() -> n__c()
    5: activate(n__b()) -> b()
    6: activate(n__c()) -> c()
    7: activate(X) -> X
Number of strict rules: 7
Direct Order(PosReal,>,Poly) ... removes: 5 7 6
     b()	weight: 0
activate(x1)	weight: (/ 1 2) + x1
  n__c()	weight: 0
     c()	weight: 0
     f(x1,x2,x3)	weight: x1 + 2 * x2 + x3
  n__b()	weight: 0
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #c() -> #b()
   #2: #f(n__b(),X,n__c()) -> #f(X,c(),X)
   #3: #f(n__b(),X,n__c()) -> #c()
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
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