YES

Problem:
 minus(n__0(),Y) -> 0()
 minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
 geq(X,n__0()) -> true()
 geq(n__0(),n__s(Y)) -> false()
 geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
 div(0(),n__s(Y)) -> 0()
 div(s(X),n__s(Y)) ->
 if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
 if(true(),X,Y) -> activate(X)
 if(false(),X,Y) -> activate(Y)
 0() -> n__0()
 s(X) -> n__s(X)
 activate(n__0()) -> 0()
 activate(n__s(X)) -> s(X)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   minus#(n__0(),Y) -> 0#()
   minus#(n__s(X),n__s(Y)) -> activate#(Y)
   minus#(n__s(X),n__s(Y)) -> activate#(X)
   minus#(n__s(X),n__s(Y)) -> minus#(activate(X),activate(Y))
   geq#(n__s(X),n__s(Y)) -> activate#(Y)
   geq#(n__s(X),n__s(Y)) -> activate#(X)
   geq#(n__s(X),n__s(Y)) -> geq#(activate(X),activate(Y))
   div#(s(X),n__s(Y)) -> minus#(X,activate(Y))
   div#(s(X),n__s(Y)) -> div#(minus(X,activate(Y)),n__s(activate(Y)))
   div#(s(X),n__s(Y)) -> activate#(Y)
   div#(s(X),n__s(Y)) -> geq#(X,activate(Y))
   div#(s(X),n__s(Y)) ->
   if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
   if#(true(),X,Y) -> activate#(X)
   if#(false(),X,Y) -> activate#(Y)
   activate#(n__0()) -> 0#()
   activate#(n__s(X)) -> s#(X)
  TRS:
   minus(n__0(),Y) -> 0()
   minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
   geq(X,n__0()) -> true()
   geq(n__0(),n__s(Y)) -> false()
   geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
   div(0(),n__s(Y)) -> 0()
   div(s(X),n__s(Y)) ->
   if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
   if(true(),X,Y) -> activate(X)
   if(false(),X,Y) -> activate(Y)
   0() -> n__0()
   s(X) -> n__s(X)
   activate(n__0()) -> 0()
   activate(n__s(X)) -> s(X)
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [s#](x0) = 0,
    
    [if#](x0, x1, x2) = x0 + 4x2 + 2,
    
    [div#](x0, x1) = 2x0 + 4x1,
    
    [geq#](x0, x1) = x0 + 3,
    
    [activate#](x0) = 1,
    
    [0#] = 0,
    
    [minus#](x0, x1) = x1 + 4,
    
    [if](x0, x1, x2) = x1 + 4x2,
    
    [s](x0) = x0 + 1,
    
    [div](x0, x1) = 4x0,
    
    [false] = 2,
    
    [true] = 0,
    
    [geq](x0, x1) = x0 + 4x1 + 1,
    
    [activate](x0) = x0,
    
    [n__s](x0) = x0 + 1,
    
    [0] = 0,
    
    [minus](x0, x1) = x0,
    
    [n__0] = 0
   orientation:
    minus#(n__0(),Y) = Y + 4 >= 0 = 0#()
    
    minus#(n__s(X),n__s(Y)) = Y + 5 >= 1 = activate#(Y)
    
    minus#(n__s(X),n__s(Y)) = Y + 5 >= 1 = activate#(X)
    
    minus#(n__s(X),n__s(Y)) = Y + 5 >= Y + 4 = minus#(activate(X),activate(Y))
    
    geq#(n__s(X),n__s(Y)) = X + 4 >= 1 = activate#(Y)
    
    geq#(n__s(X),n__s(Y)) = X + 4 >= 1 = activate#(X)
    
    geq#(n__s(X),n__s(Y)) = X + 4 >= X + 3 = geq#(activate(X),activate(Y))
    
    div#(s(X),n__s(Y)) = 2X + 4Y + 6 >= Y + 4 = minus#(X,activate(Y))
    
    div#(s(X),n__s(Y)) = 2X + 4Y + 6 >= 2X + 4Y + 4 = div#(minus(X,activate(Y)),n__s(activate(Y)))
    
    div#(s(X),n__s(Y)) = 2X + 4Y + 6 >= 1 = activate#(Y)
    
    div#(s(X),n__s(Y)) = 2X + 4Y + 6 >= X + 3 = geq#(X,activate(Y))
    
    div#(s(X),n__s(Y)) = 2X + 4Y + 6 >= X + 4Y + 3 = if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),
    n__0())
    
    if#(true(),X,Y) = 4Y + 2 >= 1 = activate#(X)
    
    if#(false(),X,Y) = 4Y + 4 >= 1 = activate#(Y)
    
    activate#(n__0()) = 1 >= 0 = 0#()
    
    activate#(n__s(X)) = 1 >= 0 = s#(X)
    
    minus(n__0(),Y) = 0 >= 0 = 0()
    
    minus(n__s(X),n__s(Y)) = X + 1 >= X = minus(activate(X),activate(Y))
    
    geq(X,n__0()) = X + 1 >= 0 = true()
    
    geq(n__0(),n__s(Y)) = 4Y + 5 >= 2 = false()
    
    geq(n__s(X),n__s(Y)) = X + 4Y + 6 >= X + 4Y + 1 = geq(activate(X),activate(Y))
    
    div(0(),n__s(Y)) = 0 >= 0 = 0()
    
    div(s(X),n__s(Y)) = 4X + 4 >= 4X + 1 = if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),
   n__0())
    
    if(true(),X,Y) = X + 4Y >= X = activate(X)
    
    if(false(),X,Y) = X + 4Y >= Y = activate(Y)
    
    0() = 0 >= 0 = n__0()
    
    s(X) = X + 1 >= X + 1 = n__s(X)
    
    activate(n__0()) = 0 >= 0 = 0()
    
    activate(n__s(X)) = X + 1 >= X + 1 = s(X)
    
    activate(X) = X >= X = X
   problem:
    DPs:
     
    TRS:
     minus(n__0(),Y) -> 0()
     minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
     geq(X,n__0()) -> true()
     geq(n__0(),n__s(Y)) -> false()
     geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
     div(0(),n__s(Y)) -> 0()
     div(s(X),n__s(Y)) ->
     if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
     if(true(),X,Y) -> activate(X)
     if(false(),X,Y) -> activate(Y)
     0() -> n__0()
     s(X) -> n__s(X)
     activate(n__0()) -> 0()
     activate(n__s(X)) -> s(X)
     activate(X) -> X
   Qed