YES

TRS:

  le(0(),y) -> true()
  le(s(x),0()) -> false()
  le(s(x),s(y)) -> le(x,y)
  minus(x,0()) -> x
  minus(s(x),s(y)) -> minus(x,y)
  mod(0(),y) -> 0()
  mod(s(x),0()) -> 0()
  mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
  if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
  if_mod(false(),s(x),s(y)) -> s(x)

linear polynomial interpretations on N:

  le_A(x1,x2) = 1
  le#_A(x1,x2) = 1
  0_A = 5
  0#_A = 9
  true_A = 1
  true#_A = 0
  s_A(x1) = x1 + 3
  s#_A(x1) = 8
  false_A = 1
  false#_A = 0
  minus_A(x1,x2) = x1 + 1
  minus#_A(x1,x2) = 0
  mod_A(x1,x2) = x1 + 2
  mod#_A(x1,x2) = x1 + x2 + 2
  if_mod_A(x1,x2,x3) = x2 + 2
  if_mod#_A(x1,x2,x3) = x1 + x2 + x3

precedence:

  minus = if_mod > s = mod > le > false > 0 > true