YES

Problem:
 le(0(),Y) -> true()
 le(s(X),0()) -> false()
 le(s(X),s(Y)) -> le(X,Y)
 minus(0(),Y) -> 0()
 minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
 ifMinus(true(),s(X),Y) -> 0()
 ifMinus(false(),s(X),Y) -> s(minus(X,Y))
 quot(0(),s(Y)) -> 0()
 quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))

Proof:
 DP Processor:
  DPs:
   le#(s(X),s(Y)) -> le#(X,Y)
   minus#(s(X),Y) -> le#(s(X),Y)
   minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
   ifMinus#(false(),s(X),Y) -> minus#(X,Y)
   quot#(s(X),s(Y)) -> minus#(X,Y)
   quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y))
  TRS:
   le(0(),Y) -> true()
   le(s(X),0()) -> false()
   le(s(X),s(Y)) -> le(X,Y)
   minus(0(),Y) -> 0()
   minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
   ifMinus(true(),s(X),Y) -> 0()
   ifMinus(false(),s(X),Y) -> s(minus(X,Y))
   quot(0(),s(Y)) -> 0()
   quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
  EDG Processor:
   DPs:
    le#(s(X),s(Y)) -> le#(X,Y)
    minus#(s(X),Y) -> le#(s(X),Y)
    minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
    ifMinus#(false(),s(X),Y) -> minus#(X,Y)
    quot#(s(X),s(Y)) -> minus#(X,Y)
    quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y))
   TRS:
    le(0(),Y) -> true()
    le(s(X),0()) -> false()
    le(s(X),s(Y)) -> le(X,Y)
    minus(0(),Y) -> 0()
    minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
    ifMinus(true(),s(X),Y) -> 0()
    ifMinus(false(),s(X),Y) -> s(minus(X,Y))
    quot(0(),s(Y)) -> 0()
    quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
   graph:
    quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y)) ->
    quot#(s(X),s(Y)) -> minus#(X,Y)
    quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y)) ->
    quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y))
    quot#(s(X),s(Y)) -> minus#(X,Y) -> minus#(s(X),Y) -> le#(s(X),Y)
    quot#(s(X),s(Y)) -> minus#(X,Y) ->
    minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
    ifMinus#(false(),s(X),Y) -> minus#(X,Y) ->
    minus#(s(X),Y) -> le#(s(X),Y)
    ifMinus#(false(),s(X),Y) -> minus#(X,Y) ->
    minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
    minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y) ->
    ifMinus#(false(),s(X),Y) -> minus#(X,Y)
    minus#(s(X),Y) -> le#(s(X),Y) -> le#(s(X),s(Y)) -> le#(X,Y)
    le#(s(X),s(Y)) -> le#(X,Y) -> le#(s(X),s(Y)) -> le#(X,Y)
   SCC Processor:
    #sccs: 3
    #rules: 4
    #arcs: 9/36
    DPs:
     quot#(s(X),s(Y)) -> quot#(minus(X,Y),s(Y))
    TRS:
     le(0(),Y) -> true()
     le(s(X),0()) -> false()
     le(s(X),s(Y)) -> le(X,Y)
     minus(0(),Y) -> 0()
     minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
     ifMinus(true(),s(X),Y) -> 0()
     ifMinus(false(),s(X),Y) -> s(minus(X,Y))
     quot(0(),s(Y)) -> 0()
     quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
    Matrix Interpretation Processor:
     dimension: 1
     interpretation:
      [quot#](x0, x1) = x0 + 1,
      
      [quot](x0, x1) = x0 + 1,
      
      [ifMinus](x0, x1, x2) = x1,
      
      [minus](x0, x1) = x0,
      
      [false] = 0,
      
      [s](x0) = x0 + 1,
      
      [true] = 0,
      
      [le](x0, x1) = 0,
      
      [0] = 0
     orientation:
      quot#(s(X),s(Y)) = X + 2 >= X + 1 = quot#(minus(X,Y),s(Y))
      
      le(0(),Y) = 0 >= 0 = true()
      
      le(s(X),0()) = 0 >= 0 = false()
      
      le(s(X),s(Y)) = 0 >= 0 = le(X,Y)
      
      minus(0(),Y) = 0 >= 0 = 0()
      
      minus(s(X),Y) = X + 1 >= X + 1 = ifMinus(le(s(X),Y),s(X),Y)
      
      ifMinus(true(),s(X),Y) = X + 1 >= 0 = 0()
      
      ifMinus(false(),s(X),Y) = X + 1 >= X + 1 = s(minus(X,Y))
      
      quot(0(),s(Y)) = 1 >= 0 = 0()
      
      quot(s(X),s(Y)) = X + 2 >= X + 2 = s(quot(minus(X,Y),s(Y)))
     problem:
      DPs:
       
      TRS:
       le(0(),Y) -> true()
       le(s(X),0()) -> false()
       le(s(X),s(Y)) -> le(X,Y)
       minus(0(),Y) -> 0()
       minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
       ifMinus(true(),s(X),Y) -> 0()
       ifMinus(false(),s(X),Y) -> s(minus(X,Y))
       quot(0(),s(Y)) -> 0()
       quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
     Qed
    
    DPs:
     minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
     ifMinus#(false(),s(X),Y) -> minus#(X,Y)
    TRS:
     le(0(),Y) -> true()
     le(s(X),0()) -> false()
     le(s(X),s(Y)) -> le(X,Y)
     minus(0(),Y) -> 0()
     minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
     ifMinus(true(),s(X),Y) -> 0()
     ifMinus(false(),s(X),Y) -> s(minus(X,Y))
     quot(0(),s(Y)) -> 0()
     quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
    Subterm Criterion Processor:
     simple projection:
      pi(minus#) = 0
      pi(ifMinus#) = 1
     problem:
      DPs:
       minus#(s(X),Y) -> ifMinus#(le(s(X),Y),s(X),Y)
      TRS:
       le(0(),Y) -> true()
       le(s(X),0()) -> false()
       le(s(X),s(Y)) -> le(X,Y)
       minus(0(),Y) -> 0()
       minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
       ifMinus(true(),s(X),Y) -> 0()
       ifMinus(false(),s(X),Y) -> s(minus(X,Y))
       quot(0(),s(Y)) -> 0()
       quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
     Matrix Interpretation Processor:
      dimension: 1
      interpretation:
       [ifMinus#](x0, x1, x2) = 0,
       
       [minus#](x0, x1) = x0,
       
       [quot](x0, x1) = x1,
       
       [ifMinus](x0, x1, x2) = 1,
       
       [minus](x0, x1) = 1,
       
       [false] = 0,
       
       [s](x0) = 1,
       
       [true] = 0,
       
       [le](x0, x1) = 0,
       
       [0] = 1
      orientation:
       minus#(s(X),Y) = 1 >= 0 = ifMinus#(le(s(X),Y),s(X),Y)
       
       le(0(),Y) = 0 >= 0 = true()
       
       le(s(X),0()) = 0 >= 0 = false()
       
       le(s(X),s(Y)) = 0 >= 0 = le(X,Y)
       
       minus(0(),Y) = 1 >= 1 = 0()
       
       minus(s(X),Y) = 1 >= 1 = ifMinus(le(s(X),Y),s(X),Y)
       
       ifMinus(true(),s(X),Y) = 1 >= 1 = 0()
       
       ifMinus(false(),s(X),Y) = 1 >= 1 = s(minus(X,Y))
       
       quot(0(),s(Y)) = 1 >= 1 = 0()
       
       quot(s(X),s(Y)) = 1 >= 1 = s(quot(minus(X,Y),s(Y)))
      problem:
       DPs:
        
       TRS:
        le(0(),Y) -> true()
        le(s(X),0()) -> false()
        le(s(X),s(Y)) -> le(X,Y)
        minus(0(),Y) -> 0()
        minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
        ifMinus(true(),s(X),Y) -> 0()
        ifMinus(false(),s(X),Y) -> s(minus(X,Y))
        quot(0(),s(Y)) -> 0()
        quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
      Qed
    
    DPs:
     le#(s(X),s(Y)) -> le#(X,Y)
    TRS:
     le(0(),Y) -> true()
     le(s(X),0()) -> false()
     le(s(X),s(Y)) -> le(X,Y)
     minus(0(),Y) -> 0()
     minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
     ifMinus(true(),s(X),Y) -> 0()
     ifMinus(false(),s(X),Y) -> s(minus(X,Y))
     quot(0(),s(Y)) -> 0()
     quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
    Subterm Criterion Processor:
     simple projection:
      pi(le#) = 1
     problem:
      DPs:
       
      TRS:
       le(0(),Y) -> true()
       le(s(X),0()) -> false()
       le(s(X),s(Y)) -> le(X,Y)
       minus(0(),Y) -> 0()
       minus(s(X),Y) -> ifMinus(le(s(X),Y),s(X),Y)
       ifMinus(true(),s(X),Y) -> 0()
       ifMinus(false(),s(X),Y) -> s(minus(X,Y))
       quot(0(),s(Y)) -> 0()
       quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
     Qed