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