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)))
  TDG 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#(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)) -> plus#(z,s(0()))
    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())) ->
    plus#(s(x),y) -> plus#(x,y)
    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))
    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#(s(x),s(y),z) -> quot#(x,y,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)))
     EDG Processor:
      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)))
      graph:
       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))
      Bounds Processor:
       bound: 1
       enrichment: top-dp
       automaton:
        final states: {7}
        transitions:
         quot{#,0}(6,6,6) -> 7*
         01() -> 13*
         s0(6) -> 6*
         00() -> 6*
         s1(15) -> 15*
         s1(13) -> 14*
         s1(6) -> 12*
         plus1(6,14) -> 15*
         plus0(6,6) -> 6*
         quot{#,1}(6,15,12) -> 7*
         quot0(6,6,6) -> 6*
         14 -> 15*
       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