YES
O(n^5)
TRS:
 {
               f(X) -> n__f(X),
          f(f(a())) -> f(g(n__f(a()))),
        activate(X) -> X,
  activate(n__f(X)) -> f(X)
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
                 f(X) -> n__f(X),
            f(f(a())) -> f(g(n__f(a()))),
          activate(X) -> X,
    activate(n__f(X)) -> f(X)
   }
  Matrix Interpretation:
   Interpretation class: triangular
              [X4]    [1 1 0 0 0][X4]   [1]
              [X3]    [0 1 0 0 0][X3]   [0]
   [activate]([X2]) = [0 0 1 0 0][X2] + [0]
              [X1]    [0 0 0 1 0][X1]   [0]
              [X0]    [0 0 0 0 1][X0]   [0]
   
         [0]
         [0]
   [a] = [0]
         [0]
         [0]
   
          [X4]    [1 0 0 0 0][X4]   [0]
          [X3]    [0 0 0 0 0][X3]   [1]
   [n__f]([X2]) = [0 0 0 0 0][X2] + [0]
          [X1]    [0 0 0 0 0][X1]   [0]
          [X0]    [0 0 0 0 0][X0]   [0]
   
       [X4]    [1 0 0 0 0][X4]   [0]
       [X3]    [0 0 0 0 0][X3]   [0]
   [g]([X2]) = [0 0 0 0 0][X2] + [0]
       [X1]    [0 0 0 0 0][X1]   [0]
       [X0]    [0 0 0 0 0][X0]   [0]
   
       [X4]    [1 0 0 0 0][X4]   [1]
       [X3]    [0 0 0 0 0][X3]   [1]
   [f]([X2]) = [0 0 0 0 0][X2] + [0]
       [X1]    [0 0 0 0 0][X1]   [0]
       [X0]    [0 0 0 0 0][X0]   [0]
   
   
   Qed