YES

TRS:

  a__c() -> a__f(g(c()))
  a__f(g(X)) -> g(X)
  mark(c()) -> a__c()
  mark(f(X)) -> a__f(X)
  mark(g(X)) -> g(X)
  a__c() -> c()
  a__f(X) -> f(X)

linear polynomial interpretations on N:

  a__c_A = 2
  a__c#_A = 2
  a__f_A(x1) = x1 + 1
  a__f#_A(x1) = x1 + 1
  g_A(x1) = x1
  g#_A(x1) = x1
  c_A = 0
  c#_A = 0
  mark_A(x1) = x1 + 3
  mark#_A(x1) = x1 + 3
  f_A(x1) = x1
  f#_A(x1) = x1

precedence:

  c > a__c > mark > a__f > g = f