YES

Problem:
 U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2))
 U12(tt(),V2) -> U13(isNat(activate(V2)))
 U13(tt()) -> tt()
 U21(tt(),V1) -> U22(isNat(activate(V1)))
 U22(tt()) -> tt()
 U31(tt(),N) -> activate(N)
 U41(tt(),M,N) -> s(plus(activate(N),activate(M)))
 and(tt(),X) -> activate(X)
 isNat(n__0()) -> tt()
 isNat(n__plus(V1,V2)) ->
 U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
 isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
 isNatKind(n__0()) -> tt()
 isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
 isNatKind(n__s(V1)) -> isNatKind(activate(V1))
 plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N)
 plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
 0() -> n__0()
 plus(X1,X2) -> n__plus(X1,X2)
 isNatKind(X) -> n__isNatKind(X)
 s(X) -> n__s(X)
 and(X1,X2) -> n__and(X1,X2)
 activate(n__0()) -> 0()
 activate(n__plus(X1,X2)) -> plus(X1,X2)
 activate(n__isNatKind(X)) -> isNatKind(X)
 activate(n__s(X)) -> s(X)
 activate(n__and(X1,X2)) -> and(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   U11#(tt(),V1,V2) -> activate#(V2)
   U11#(tt(),V1,V2) -> activate#(V1)
   U11#(tt(),V1,V2) -> isNat#(activate(V1))
   U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2))
   U12#(tt(),V2) -> activate#(V2)
   U12#(tt(),V2) -> isNat#(activate(V2))
   U12#(tt(),V2) -> U13#(isNat(activate(V2)))
   U21#(tt(),V1) -> activate#(V1)
   U21#(tt(),V1) -> isNat#(activate(V1))
   U21#(tt(),V1) -> U22#(isNat(activate(V1)))
   U31#(tt(),N) -> activate#(N)
   U41#(tt(),M,N) -> activate#(M)
   U41#(tt(),M,N) -> activate#(N)
   U41#(tt(),M,N) -> plus#(activate(N),activate(M))
   U41#(tt(),M,N) -> s#(plus(activate(N),activate(M)))
   and#(tt(),X) -> activate#(X)
   isNat#(n__plus(V1,V2)) -> activate#(V2)
   isNat#(n__plus(V1,V2)) -> activate#(V1)
   isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1))
   isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   isNat#(n__plus(V1,V2)) ->
   U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
   isNat#(n__s(V1)) -> activate#(V1)
   isNat#(n__s(V1)) -> isNatKind#(activate(V1))
   isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1))
   isNatKind#(n__plus(V1,V2)) -> activate#(V2)
   isNatKind#(n__plus(V1,V2)) -> activate#(V1)
   isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1))
   isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   isNatKind#(n__s(V1)) -> activate#(V1)
   isNatKind#(n__s(V1)) -> isNatKind#(activate(V1))
   plus#(N,0()) -> isNat#(N)
   plus#(N,0()) -> and#(isNat(N),n__isNatKind(N))
   plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N)
   plus#(N,s(M)) -> isNat#(N)
   plus#(N,s(M)) -> isNat#(M)
   plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M))
   plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N)))
   plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
   activate#(n__0()) -> 0#()
   activate#(n__plus(X1,X2)) -> plus#(X1,X2)
   activate#(n__isNatKind(X)) -> isNatKind#(X)
   activate#(n__s(X)) -> s#(X)
   activate#(n__and(X1,X2)) -> and#(X1,X2)
  TRS:
   U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2))
   U12(tt(),V2) -> U13(isNat(activate(V2)))
   U13(tt()) -> tt()
   U21(tt(),V1) -> U22(isNat(activate(V1)))
   U22(tt()) -> tt()
   U31(tt(),N) -> activate(N)
   U41(tt(),M,N) -> s(plus(activate(N),activate(M)))
   and(tt(),X) -> activate(X)
   isNat(n__0()) -> tt()
   isNat(n__plus(V1,V2)) ->
   U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
   isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
   isNatKind(n__0()) -> tt()
   isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   isNatKind(n__s(V1)) -> isNatKind(activate(V1))
   plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N)
   plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
   0() -> n__0()
   plus(X1,X2) -> n__plus(X1,X2)
   isNatKind(X) -> n__isNatKind(X)
   s(X) -> n__s(X)
   and(X1,X2) -> n__and(X1,X2)
   activate(n__0()) -> 0()
   activate(n__plus(X1,X2)) -> plus(X1,X2)
   activate(n__isNatKind(X)) -> isNatKind(X)
   activate(n__s(X)) -> s(X)
   activate(n__and(X1,X2)) -> and(X1,X2)
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [0#] = 0,
    
    [isNatKind#](x0) = x0,
    
    [and#](x0, x1) = x1 + 1,
    
    [s#](x0) = 0,
    
    [plus#](x0, x1) = x0 + 2x1 + 1,
    
    [U41#](x0, x1, x2) = 2x1 + x2 + 2,
    
    [U31#](x0, x1) = x1 + 1,
    
    [U22#](x0) = 0,
    
    [U21#](x0, x1) = x1 + 3,
    
    [U13#](x0) = 2,
    
    [U12#](x0, x1) = x1 + 3,
    
    [isNat#](x0) = x0 + 1,
    
    [activate#](x0) = x0,
    
    [U11#](x0, x1, x2) = x1 + x2 + 4,
    
    [n__and](x0, x1) = x1 + 2,
    
    [0] = 4,
    
    [n__s](x0) = x0 + 3,
    
    [n__isNatKind](x0) = x0 + 1,
    
    [isNatKind](x0) = x0 + 1,
    
    [n__plus](x0, x1) = x0 + 4x1 + 4,
    
    [n__0] = 4,
    
    [and](x0, x1) = x1 + 2,
    
    [s](x0) = x0 + 3,
    
    [plus](x0, x1) = x0 + 4x1 + 4,
    
    [U41](x0, x1, x2) = 4x1 + x2 + 7,
    
    [U31](x0, x1) = x1 + 3,
    
    [U22](x0) = 0,
    
    [U21](x0, x1) = 0,
    
    [U13](x0) = 0,
    
    [U12](x0, x1) = 0,
    
    [isNat](x0) = 0,
    
    [activate](x0) = x0,
    
    [U11](x0, x1, x2) = 0,
    
    [tt] = 0
   orientation:
    U11#(tt(),V1,V2) = V1 + V2 + 4 >= V2 = activate#(V2)
    
    U11#(tt(),V1,V2) = V1 + V2 + 4 >= V1 = activate#(V1)
    
    U11#(tt(),V1,V2) = V1 + V2 + 4 >= V1 + 1 = isNat#(activate(V1))
    
    U11#(tt(),V1,V2) = V1 + V2 + 4 >= V2 + 3 = U12#(isNat(activate(V1)),activate(V2))
    
    U12#(tt(),V2) = V2 + 3 >= V2 = activate#(V2)
    
    U12#(tt(),V2) = V2 + 3 >= V2 + 1 = isNat#(activate(V2))
    
    U12#(tt(),V2) = V2 + 3 >= 2 = U13#(isNat(activate(V2)))
    
    U21#(tt(),V1) = V1 + 3 >= V1 = activate#(V1)
    
    U21#(tt(),V1) = V1 + 3 >= V1 + 1 = isNat#(activate(V1))
    
    U21#(tt(),V1) = V1 + 3 >= 0 = U22#(isNat(activate(V1)))
    
    U31#(tt(),N) = N + 1 >= N = activate#(N)
    
    U41#(tt(),M,N) = 2M + N + 2 >= M = activate#(M)
    
    U41#(tt(),M,N) = 2M + N + 2 >= N = activate#(N)
    
    U41#(tt(),M,N) = 2M + N + 2 >= 2M + N + 1 = plus#(activate(N),activate(M))
    
    U41#(tt(),M,N) = 2M + N + 2 >= 0 = s#(plus(activate(N),activate(M)))
    
    and#(tt(),X) = X + 1 >= X = activate#(X)
    
    isNat#(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V2 = activate#(V2)
    
    isNat#(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V1 = activate#(V1)
    
    isNat#(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V1 = isNatKind#(activate(V1))
    
    isNat#(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V2 + 2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
    
    isNat#(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V1 + V2 + 4 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),
     activate(V2))
    
    isNat#(n__s(V1)) = V1 + 4 >= V1 = activate#(V1)
    
    isNat#(n__s(V1)) = V1 + 4 >= V1 = isNatKind#(activate(V1))
    
    isNat#(n__s(V1)) = V1 + 4 >= V1 + 3 = U21#(isNatKind(activate(V1)),activate(V1))
    
    isNatKind#(n__plus(V1,V2)) = V1 + 4V2 + 4 >= V2 = activate#(V2)
    
    isNatKind#(n__plus(V1,V2)) = V1 + 4V2 + 4 >= V1 = activate#(V1)
    
    isNatKind#(n__plus(V1,V2)) = V1 + 4V2 + 4 >= V1 = isNatKind#(activate(V1))
    
    isNatKind#(n__plus(V1,V2)) = V1 + 4V2 + 4 >= V2 + 2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
    
    isNatKind#(n__s(V1)) = V1 + 3 >= V1 = activate#(V1)
    
    isNatKind#(n__s(V1)) = V1 + 3 >= V1 = isNatKind#(activate(V1))
    
    plus#(N,0()) = N + 9 >= N + 1 = isNat#(N)
    
    plus#(N,0()) = N + 9 >= N + 2 = and#(isNat(N),n__isNatKind(N))
    
    plus#(N,0()) = N + 9 >= N + 1 = U31#(and(isNat(N),n__isNatKind(N)),N)
    
    plus#(N,s(M)) = 2M + N + 7 >= N + 1 = isNat#(N)
    
    plus#(N,s(M)) = 2M + N + 7 >= M + 1 = isNat#(M)
    
    plus#(N,s(M)) = 2M + N + 7 >= M + 2 = and#(isNat(M),n__isNatKind(M))
    
    plus#(N,s(M)) = 2M + N + 7 >= N + 4 = and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N)))
    
    plus#(N,s(M)) = 2M + N + 7 >= 2M + N + 2 = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
    
    activate#(n__0()) = 4 >= 0 = 0#()
    
    activate#(n__plus(X1,X2)) = X1 + 4X2 + 4 >= X1 + 2X2 + 1 = plus#(X1,X2)
    
    activate#(n__isNatKind(X)) = X + 1 >= X = isNatKind#(X)
    
    activate#(n__s(X)) = X + 3 >= 0 = s#(X)
    
    activate#(n__and(X1,X2)) = X2 + 2 >= X2 + 1 = and#(X1,X2)
    
    U11(tt(),V1,V2) = 0 >= 0 = U12(isNat(activate(V1)),activate(V2))
    
    U12(tt(),V2) = 0 >= 0 = U13(isNat(activate(V2)))
    
    U13(tt()) = 0 >= 0 = tt()
    
    U21(tt(),V1) = 0 >= 0 = U22(isNat(activate(V1)))
    
    U22(tt()) = 0 >= 0 = tt()
    
    U31(tt(),N) = N + 3 >= N = activate(N)
    
    U41(tt(),M,N) = 4M + N + 7 >= 4M + N + 7 = s(plus(activate(N),activate(M)))
    
    and(tt(),X) = X + 2 >= X = activate(X)
    
    isNat(n__0()) = 0 >= 0 = tt()
    
    isNat(n__plus(V1,V2)) = 0 >= 0 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),
    activate(V2))
    
    isNat(n__s(V1)) = 0 >= 0 = U21(isNatKind(activate(V1)),activate(V1))
    
    isNatKind(n__0()) = 5 >= 0 = tt()
    
    isNatKind(n__plus(V1,V2)) = V1 + 4V2 + 5 >= V2 + 3 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
    
    isNatKind(n__s(V1)) = V1 + 4 >= V1 + 1 = isNatKind(activate(V1))
    
    plus(N,0()) = N + 20 >= N + 3 = U31(and(isNat(N),n__isNatKind(N)),N)
    
    plus(N,s(M)) = 4M + N + 16 >= 4M + N + 7 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
    
    0() = 4 >= 4 = n__0()
    
    plus(X1,X2) = X1 + 4X2 + 4 >= X1 + 4X2 + 4 = n__plus(X1,X2)
    
    isNatKind(X) = X + 1 >= X + 1 = n__isNatKind(X)
    
    s(X) = X + 3 >= X + 3 = n__s(X)
    
    and(X1,X2) = X2 + 2 >= X2 + 2 = n__and(X1,X2)
    
    activate(n__0()) = 4 >= 4 = 0()
    
    activate(n__plus(X1,X2)) = X1 + 4X2 + 4 >= X1 + 4X2 + 4 = plus(X1,X2)
    
    activate(n__isNatKind(X)) = X + 1 >= X + 1 = isNatKind(X)
    
    activate(n__s(X)) = X + 3 >= X + 3 = s(X)
    
    activate(n__and(X1,X2)) = X2 + 2 >= X2 + 2 = and(X1,X2)
    
    activate(X) = X >= X = X
   problem:
    DPs:
     
    TRS:
     U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2))
     U12(tt(),V2) -> U13(isNat(activate(V2)))
     U13(tt()) -> tt()
     U21(tt(),V1) -> U22(isNat(activate(V1)))
     U22(tt()) -> tt()
     U31(tt(),N) -> activate(N)
     U41(tt(),M,N) -> s(plus(activate(N),activate(M)))
     and(tt(),X) -> activate(X)
     isNat(n__0()) -> tt()
     isNat(n__plus(V1,V2)) ->
     U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
     isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
     isNatKind(n__0()) -> tt()
     isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
     isNatKind(n__s(V1)) -> isNatKind(activate(V1))
     plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N)
     plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
     0() -> n__0()
     plus(X1,X2) -> n__plus(X1,X2)
     isNatKind(X) -> n__isNatKind(X)
     s(X) -> n__s(X)
     and(X1,X2) -> n__and(X1,X2)
     activate(n__0()) -> 0()
     activate(n__plus(X1,X2)) -> plus(X1,X2)
     activate(n__isNatKind(X)) -> isNatKind(X)
     activate(n__s(X)) -> s(X)
     activate(n__and(X1,X2)) -> and(X1,X2)
     activate(X) -> X
   Qed