YES

TRS:

  app(app(plus(),0()),y) -> y
  app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y))
  app(app(app(curry(),f),x),y) -> app(app(f,x),y)
  add() -> app(curry(),plus())

linear polynomial interpretations on N:

  app_A(x1,x2) = x1 + x2 + 1
  app#_A(x1,x2) = x1 + x2 + 1
  plus_A = 0
  plus#_A = 0
  0_A = 0
  0#_A = 0
  s_A = 1
  s#_A = 1
  curry_A = 0
  curry#_A = 0
  add_A = 2
  add#_A = 2

precedence:

  add > app = 0 = curry > s > plus