YES
Input TRS:
      1: f(f(a())) -> f(g(n__f(a())))
      2: f(X) -> n__f(X)
      3: activate(n__f(X)) -> f(X)
      4: activate(X) -> X
Number of strict rules: 4
Direct POLO(bPol) ... removes: 4 1 3 2
      a 	w: 1
      activate	w: x1 + 2442
      f 	w: 2 * x1 + 5
      n__f	w: 2 * x1 + 1
      g 	w: 2 * x1
Number of strict rules: 0