YES
O(n^3)
TRS:
 {
    mark(g(X)) -> active(g(X)),
    mark(h(X)) -> active(h(mark(X))),
    mark(f(X)) -> active(f(mark(X))),
    g(mark(X)) -> g(X),
  g(active(X)) -> g(X),
    h(mark(X)) -> h(X),
  h(active(X)) -> h(X),
    f(mark(X)) -> f(X),
  f(active(X)) -> f(X),
  active(f(X)) -> mark(g(h(f(X))))
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
      mark(g(X)) -> active(g(X)),
      mark(h(X)) -> active(h(mark(X))),
      mark(f(X)) -> active(f(mark(X))),
      g(mark(X)) -> g(X),
    g(active(X)) -> g(X),
      h(mark(X)) -> h(X),
    h(active(X)) -> h(X),
      f(mark(X)) -> f(X),
    f(active(X)) -> f(X),
    active(f(X)) -> mark(g(h(f(X))))
   }
  Matrix Interpretation:
   Interpretation class: triangular
            [X2]    [1 0 2][X2]   [1]
   [active]([X1]) = [0 1 1][X1] + [0]
            [X0]    [0 0 0][X0]   [0]
   
       [X2]    [1 1 2][X2]   [0]
   [f]([X1]) = [0 1 1][X1] + [3]
       [X0]    [0 0 0][X0]   [1]
   
       [X2]    [1 0 0][X2]   [0]
   [h]([X1]) = [0 1 1][X1] + [2]
       [X0]    [0 0 0][X0]   [1]
   
       [X2]    [1 0 0][X2]   [0]
   [g]([X1]) = [0 0 0][X1] + [0]
       [X0]    [0 0 0][X0]   [0]
   
          [X2]    [1 2 1][X2]   [2]
   [mark]([X1]) = [0 1 1][X1] + [0]
          [X0]    [0 0 0][X0]   [0]
   
   
   Qed