YES

TRS:

  active(f(X)) -> mark(g(h(f(X))))
  active(f(X)) -> f(active(X))
  active(h(X)) -> h(active(X))
  f(mark(X)) -> mark(f(X))
  h(mark(X)) -> mark(h(X))
  proper(f(X)) -> f(proper(X))
  proper(g(X)) -> g(proper(X))
  proper(h(X)) -> h(proper(X))
  f(ok(X)) -> ok(f(X))
  g(ok(X)) -> ok(g(X))
  h(ok(X)) -> ok(h(X))
  top(mark(X)) -> top(proper(X))
  top(ok(X)) -> top(active(X))

linear polynomial interpretations on N:

  active_A(x1) = x1 + 9
  active#_A(x1) = x1 + 9
  f_A(x1) = x1 + 11
  f#_A(x1) = x1 + 11
  mark_A(x1) = x1 + 3
  mark#_A(x1) = x1 + 3
  g_A(x1) = x1 + 1
  g#_A(x1) = x1 + 1
  h_A(x1) = x1 + 4
  h#_A(x1) = x1 + 4
  proper_A(x1) = x1 + 2
  proper#_A(x1) = x1 + 2
  ok_A(x1) = x1 + 10
  ok#_A(x1) = x1 + 10
  top_A(x1) = x1 + 2
  top#_A(x1) = x1 + 2

precedence:

  top > active > f = proper > h > mark = g = ok