YES
Input TRS:
      1: a__c() -> a__f(g(c()))
      2: a__f(g(X)) -> g(X)
      3: mark(c()) -> a__c()
      4: mark(f(X)) -> a__f(X)
      5: mark(g(X)) -> g(X)
      6: a__c() -> c()
      7: a__f(X) -> f(X)
Number of strict rules: 7
Direct POLO(bPol) ... removes: 4 1 3 5 7 6 2
      a__f	w: 2 * x1 + 2
      c 	w: 1
      f 	w: 2 * x1 + 1
      mark	w: 2 * x1 + 15446
      g 	w: 2 * x1 + 7720
      a__c	w: 15447
Number of strict rules: 0