YES

TRS:

  -(x,0()) -> x
  -(0(),s(y)) -> 0()
  -(s(x),s(y)) -> -(x,y)
  f(0()) -> 0()
  f(s(x)) -> -(s(x),g(f(x)))
  g(0()) -> s(0())
  g(s(x)) -> -(s(x),f(g(x)))

max/plus interpretations on N:

  -_A(x1,x2) = max{20, x1, 20}
  -#_A(x1,x2) = max{0, -1, 9}
  0_A = 18
  0#_A = 10
  s_A(x1) = max{16, 8 + x1}
  s#_A(x1) = max{7, 11}
  f_A(x1) = max{10, 4 + x1}
  f#_A(x1) = max{5, -7 + x1}
  g_A(x1) = max{19, 11 + x1}
  g#_A(x1) = max{8, -4 + x1}

precedence:

  s > g > f > 0 > -