YES

TRS:

  a__g(X) -> a__h(X)
  a__c() -> d()
  a__h(d()) -> a__g(c())
  mark(g(X)) -> a__g(X)
  mark(h(X)) -> a__h(X)
  mark(c()) -> a__c()
  mark(d()) -> d()
  a__g(X) -> g(X)
  a__h(X) -> h(X)
  a__c() -> c()

max/plus interpretations on N:

  a__g_A(x1) = max{0, x1}
  a__g#_A(x1) = max{0, x1}
  a__h_A(x1) = max{0, x1}
  a__h#_A(x1) = max{0, x1}
  a__c_A = 0
  a__c#_A = 0
  d_A = 0
  d#_A = 0
  c_A = 0
  c#_A = 0
  mark_A(x1) = max{0, x1}
  mark#_A(x1) = max{0, x1}
  g_A(x1) = max{0, x1}
  g#_A(x1) = max{0, x1}
  h_A(x1) = max{0, x1}
  h#_A(x1) = max{0, x1}

precedence:

  a__c = mark > d > a__g = c > a__h = g > h