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