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