YES

TRS:

  U11(tt(),V1,V2) -> U12(isNatKind(activate(V1)),activate(V1),activate(V2))
  U12(tt(),V1,V2) -> U13(isNatKind(activate(V2)),activate(V1),activate(V2))
  U13(tt(),V1,V2) -> U14(isNatKind(activate(V2)),activate(V1),activate(V2))
  U14(tt(),V1,V2) -> U15(isNat(activate(V1)),activate(V2))
  U15(tt(),V2) -> U16(isNat(activate(V2)))
  U16(tt()) -> tt()
  U21(tt(),V1) -> U22(isNatKind(activate(V1)),activate(V1))
  U22(tt(),V1) -> U23(isNat(activate(V1)))
  U23(tt()) -> tt()
  U31(tt(),V2) -> U32(isNatKind(activate(V2)))
  U32(tt()) -> tt()
  U41(tt()) -> tt()
  U51(tt(),N) -> U52(isNatKind(activate(N)),activate(N))
  U52(tt(),N) -> activate(N)
  U61(tt(),M,N) -> U62(isNatKind(activate(M)),activate(M),activate(N))
  U62(tt(),M,N) -> U63(isNat(activate(N)),activate(M),activate(N))
  U63(tt(),M,N) -> U64(isNatKind(activate(N)),activate(M),activate(N))
  U64(tt(),M,N) -> s(plus(activate(N),activate(M)))
  isNat(n__0()) -> tt()
  isNat(n__plus(V1,V2)) -> U11(isNatKind(activate(V1)),activate(V1),activate(V2))
  isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
  isNatKind(n__0()) -> tt()
  isNatKind(n__plus(V1,V2)) -> U31(isNatKind(activate(V1)),activate(V2))
  isNatKind(n__s(V1)) -> U41(isNatKind(activate(V1)))
  plus(N,0()) -> U51(isNat(N),N)
  plus(N,s(M)) -> U61(isNat(M),M,N)
  0() -> n__0()
  plus(X1,X2) -> n__plus(X1,X2)
  s(X) -> n__s(X)
  activate(n__0()) -> 0()
  activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2))
  activate(n__s(X)) -> s(activate(X))
  activate(X) -> X

linear polynomial interpretations on N:

  U11_A(x1,x2,x3) = 1
  U11#_A(x1,x2,x3) = x2 + x3 + 14
  tt_A = 1
  tt#_A = 2
  U12_A(x1,x2,x3) = 1
  U12#_A(x1,x2,x3) = x2 + x3 + 13
  isNatKind_A(x1) = 1
  isNatKind#_A(x1) = x1
  activate_A(x1) = x1
  activate#_A(x1) = x1 + 9
  U13_A(x1,x2,x3) = 1
  U13#_A(x1,x2,x3) = x2 + x3 + 12
  U14_A(x1,x2,x3) = x1
  U14#_A(x1,x2,x3) = x2 + x3 + 11
  U15_A(x1,x2) = 1
  U15#_A(x1,x2) = x2 + 10
  isNat_A(x1) = 1
  isNat#_A(x1) = x1 + 4
  U16_A(x1) = 1
  U16#_A(x1) = 3
  U21_A(x1,x2) = x1
  U21#_A(x1,x2) = x2 + 11
  U22_A(x1,x2) = x1
  U22#_A(x1,x2) = x2 + 10
  U23_A(x1) = 1
  U23#_A(x1) = 0
  U31_A(x1,x2) = 1
  U31#_A(x1,x2) = x2 + 10
  U32_A(x1) = 1
  U32#_A(x1) = 3
  U41_A(x1) = 1
  U41#_A(x1) = 3
  U51_A(x1,x2) = x2
  U51#_A(x1,x2) = x2 + 11
  U52_A(x1,x2) = x2
  U52#_A(x1,x2) = x2 + 10
  U61_A(x1,x2,x3) = x2 + x3 + 19
  U61#_A(x1,x2,x3) = x2 + x3 + 26
  U62_A(x1,x2,x3) = x2 + x3 + 19
  U62#_A(x1,x2,x3) = x2 + x3 + 25
  U63_A(x1,x2,x3) = x2 + x3 + 19
  U63#_A(x1,x2,x3) = x2 + x3 + 24
  U64_A(x1,x2,x3) = x2 + x3 + 19
  U64#_A(x1,x2,x3) = x2 + x3 + 23
  s_A(x1) = x1 + 8
  s#_A(x1) = x1 + 11
  plus_A(x1,x2) = x1 + x2 + 11
  plus#_A(x1,x2) = x1 + x2 + 19
  n__0_A = 1
  n__0#_A = 3
  n__plus_A(x1,x2) = x1 + x2 + 11
  n__plus#_A(x1,x2) = x2 + 15
  n__s_A(x1) = x1 + 8
  n__s#_A(x1) = x1 + 10
  0_A = 1
  0#_A = 4

precedence:

  plus > n__plus > U11 = U61 > U12 = U62 > U13 = U63 > U14 = U64 > U15 = U22 = s > isNat = U16 = U23 = U51 > U21 = U52 > activate = n__s > isNatKind = 0 > U31 = U41 = n__0 > U32 > tt