YES

Problem:
 d(0()) -> 0()
 d(s(x)) -> s(s(d(x)))
 e(0()) -> s(0())
 e(r(x)) -> d(e(x))

Proof:
 DP Processor:
  DPs:
   d#(s(x)) -> d#(x)
   e#(r(x)) -> e#(x)
   e#(r(x)) -> d#(e(x))
  TRS:
   d(0()) -> 0()
   d(s(x)) -> s(s(d(x)))
   e(0()) -> s(0())
   e(r(x)) -> d(e(x))
  TDG Processor:
   DPs:
    d#(s(x)) -> d#(x)
    e#(r(x)) -> e#(x)
    e#(r(x)) -> d#(e(x))
   TRS:
    d(0()) -> 0()
    d(s(x)) -> s(s(d(x)))
    e(0()) -> s(0())
    e(r(x)) -> d(e(x))
   graph:
    e#(r(x)) -> e#(x) -> e#(r(x)) -> d#(e(x))
    e#(r(x)) -> e#(x) -> e#(r(x)) -> e#(x)
    e#(r(x)) -> d#(e(x)) -> d#(s(x)) -> d#(x)
    d#(s(x)) -> d#(x) -> d#(s(x)) -> d#(x)
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 4/9
    DPs:
     e#(r(x)) -> e#(x)
    TRS:
     d(0()) -> 0()
     d(s(x)) -> s(s(d(x)))
     e(0()) -> s(0())
     e(r(x)) -> d(e(x))
    Subterm Criterion Processor:
     simple projection:
      pi(e#) = 0
     problem:
      DPs:
       
      TRS:
       d(0()) -> 0()
       d(s(x)) -> s(s(d(x)))
       e(0()) -> s(0())
       e(r(x)) -> d(e(x))
     Qed
    
    DPs:
     d#(s(x)) -> d#(x)
    TRS:
     d(0()) -> 0()
     d(s(x)) -> s(s(d(x)))
     e(0()) -> s(0())
     e(r(x)) -> d(e(x))
    Subterm Criterion Processor:
     simple projection:
      pi(d#) = 0
     problem:
      DPs:
       
      TRS:
       d(0()) -> 0()
       d(s(x)) -> s(s(d(x)))
       e(0()) -> s(0())
       e(r(x)) -> d(e(x))
     Qed