YES

TRS:

  f(g(x)) -> g(f(f(x)))
  f(h(x)) -> h(g(x))
  f'(s(x),y,y) -> f'(y,x,s(x))

max/plus interpretations on N:

  f_A(x1) = max{0, x1}
  f#_A(x1) = max{0, -1 + x1}
  g_A(x1) = max{3, 4 + x1}
  g#_A(x1) = max{1, -4}
  h_A(x1) = max{4, -1}
  h#_A(x1) = max{2, -3}
  f'_A(x1,x2,x3) = max{0, 0, 1, 1}
  f'#_A(x1,x2,x3) = max{7, 5 + x1, 6 + x2, 2 + x3}
  s_A(x1) = max{3, 3 + x1}
  s#_A(x1) = max{0, 1}

precedence:

  f = f' > h = s > g