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