YES

Problem:
 quot(0(),s(y),s(z)) -> 0()
 quot(s(x),s(y),z) -> quot(x,y,z)
 plus(0(),y) -> y
 plus(s(x),y) -> s(plus(x,y))
 quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))

Proof:
 DP Processor:
  DPs:
   quot#(s(x),s(y),z) -> quot#(x,y,z)
   plus#(s(x),y) -> plus#(x,y)
   quot#(x,0(),s(z)) -> plus#(z,s(0()))
   quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
  TRS:
   quot(0(),s(y),s(z)) -> 0()
   quot(s(x),s(y),z) -> quot(x,y,z)
   plus(0(),y) -> y
   plus(s(x),y) -> s(plus(x,y))
   quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
  EDG Processor:
   DPs:
    quot#(s(x),s(y),z) -> quot#(x,y,z)
    plus#(s(x),y) -> plus#(x,y)
    quot#(x,0(),s(z)) -> plus#(z,s(0()))
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
   TRS:
    quot(0(),s(y),s(z)) -> 0()
    quot(s(x),s(y),z) -> quot(x,y,z)
    plus(0(),y) -> y
    plus(s(x),y) -> s(plus(x,y))
    quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
   graph:
    plus#(s(x),y) -> plus#(x,y) -> plus#(s(x),y) -> plus#(x,y)
    quot#(s(x),s(y),z) -> quot#(x,y,z) ->
    quot#(s(x),s(y),z) -> quot#(x,y,z)
    quot#(s(x),s(y),z) -> quot#(x,y,z) ->
    quot#(x,0(),s(z)) -> plus#(z,s(0()))
    quot#(s(x),s(y),z) -> quot#(x,y,z) ->
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
    quot#(x,0(),s(z)) -> plus#(z,s(0())) ->
    plus#(s(x),y) -> plus#(x,y)
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) ->
    quot#(s(x),s(y),z) -> quot#(x,y,z)
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) ->
    quot#(x,0(),s(z)) -> plus#(z,s(0()))
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z)) ->
    quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
   SCC Processor:
    #sccs: 2
    #rules: 3
    #arcs: 8/16
    DPs:
     quot#(s(x),s(y),z) -> quot#(x,y,z)
     quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
    TRS:
     quot(0(),s(y),s(z)) -> 0()
     quot(s(x),s(y),z) -> quot(x,y,z)
     plus(0(),y) -> y
     plus(s(x),y) -> s(plus(x,y))
     quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
    Subterm Criterion Processor:
     simple projection:
      pi(quot#) = 0
     problem:
      DPs:
       quot#(x,0(),s(z)) -> quot#(x,plus(z,s(0())),s(z))
      TRS:
       quot(0(),s(y),s(z)) -> 0()
       quot(s(x),s(y),z) -> quot(x,y,z)
       plus(0(),y) -> y
       plus(s(x),y) -> s(plus(x,y))
       quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
     Matrix Interpretation Processor:
      dimension: 1
      interpretation:
       [quot#](x0, x1, x2) = x1,
       
       [plus](x0, x1) = x1,
       
       [quot](x0, x1, x2) = 1,
       
       [s](x0) = 0,
       
       [0] = 1
      orientation:
       quot#(x,0(),s(z)) = 1 >= 0 = quot#(x,plus(z,s(0())),s(z))
       
       quot(0(),s(y),s(z)) = 1 >= 1 = 0()
       
       quot(s(x),s(y),z) = 1 >= 1 = quot(x,y,z)
       
       plus(0(),y) = y >= y = y
       
       plus(s(x),y) = y >= 0 = s(plus(x,y))
       
       quot(x,0(),s(z)) = 1 >= 0 = s(quot(x,plus(z,s(0())),s(z)))
      problem:
       DPs:
        
       TRS:
        quot(0(),s(y),s(z)) -> 0()
        quot(s(x),s(y),z) -> quot(x,y,z)
        plus(0(),y) -> y
        plus(s(x),y) -> s(plus(x,y))
        quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
      Qed
    
    DPs:
     plus#(s(x),y) -> plus#(x,y)
    TRS:
     quot(0(),s(y),s(z)) -> 0()
     quot(s(x),s(y),z) -> quot(x,y,z)
     plus(0(),y) -> y
     plus(s(x),y) -> s(plus(x,y))
     quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
    Subterm Criterion Processor:
     simple projection:
      pi(plus#) = 0
     problem:
      DPs:
       
      TRS:
       quot(0(),s(y),s(z)) -> 0()
       quot(s(x),s(y),z) -> quot(x,y,z)
       plus(0(),y) -> y
       plus(s(x),y) -> s(plus(x,y))
       quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z)))
     Qed