YES

Problem:
 cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
 and(true(),true()) -> true()
 and(x,false()) -> false()
 and(false(),x) -> false()
 gr(0(),0()) -> false()
 gr(0(),x) -> false()
 gr(s(x),0()) -> true()
 gr(s(x),s(y)) -> gr(x,y)
 p(0()) -> 0()
 p(s(x)) -> x

Proof:
 DP Processor:
  DPs:
   cond#(true(),x,y) -> p#(y)
   cond#(true(),x,y) -> p#(x)
   cond#(true(),x,y) -> gr#(y,0())
   cond#(true(),x,y) -> gr#(x,0())
   cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0()))
   cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y))
   gr#(s(x),s(y)) -> gr#(x,y)
  TRS:
   cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
   and(true(),true()) -> true()
   and(x,false()) -> false()
   and(false(),x) -> false()
   gr(0(),0()) -> false()
   gr(0(),x) -> false()
   gr(s(x),0()) -> true()
   gr(s(x),s(y)) -> gr(x,y)
   p(0()) -> 0()
   p(s(x)) -> x
  TDG Processor:
   DPs:
    cond#(true(),x,y) -> p#(y)
    cond#(true(),x,y) -> p#(x)
    cond#(true(),x,y) -> gr#(y,0())
    cond#(true(),x,y) -> gr#(x,0())
    cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0()))
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y))
    gr#(s(x),s(y)) -> gr#(x,y)
   TRS:
    cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
    and(true(),true()) -> true()
    and(x,false()) -> false()
    and(false(),x) -> false()
    gr(0(),0()) -> false()
    gr(0(),x) -> false()
    gr(s(x),0()) -> true()
    gr(s(x),s(y)) -> gr(x,y)
    p(0()) -> 0()
    p(s(x)) -> x
   graph:
    gr#(s(x),s(y)) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y)
    cond#(true(),x,y) -> gr#(y,0()) -> gr#(s(x),s(y)) -> gr#(x,y)
    cond#(true(),x,y) -> gr#(x,0()) ->
    gr#(s(x),s(y)) -> gr#(x,y)
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) ->
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y))
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) ->
    cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0()))
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) ->
    cond#(true(),x,y) -> gr#(x,0())
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) ->
    cond#(true(),x,y) -> gr#(y,0())
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) ->
    cond#(true(),x,y) -> p#(x)
    cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> 
    cond#(true(),x,y) -> p#(y)
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 9/49
    DPs:
     cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y))
    TRS:
     cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
     and(true(),true()) -> true()
     and(x,false()) -> false()
     and(false(),x) -> false()
     gr(0(),0()) -> false()
     gr(0(),x) -> false()
     gr(s(x),0()) -> true()
     gr(s(x),s(y)) -> gr(x,y)
     p(0()) -> 0()
     p(s(x)) -> x
    Matrix Interpretation Processor: dim=1
     
     interpretation:
      [cond#](x0, x1, x2) = x0 + 2x2,
      
      [s](x0) = 2x0 + 1,
      
      [false] = 0,
      
      [p](x0) = 1/2x0,
      
      [and](x0, x1) = 2x1,
      
      [gr](x0, x1) = 1/2x0,
      
      [0] = 0,
      
      [cond](x0, x1, x2) = x0 + x1 + 2x2,
      
      [true] = 1/2
     orientation:
      cond#(true(),x,y) = 2y + 1/2 >= 2y = cond#(and(gr(x,0()),gr(y,0())),p(x),p(y))
      
      cond(true(),x,y) = x + 2y + 1/2 >= 1/2x + 2y = cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
      
      and(true(),true()) = 1 >= 1/2 = true()
      
      and(x,false()) = 0 >= 0 = false()
      
      and(false(),x) = 2x >= 0 = false()
      
      gr(0(),0()) = 0 >= 0 = false()
      
      gr(0(),x) = 0 >= 0 = false()
      
      gr(s(x),0()) = x + 1/2 >= 1/2 = true()
      
      gr(s(x),s(y)) = x + 1/2 >= 1/2x = gr(x,y)
      
      p(0()) = 0 >= 0 = 0()
      
      p(s(x)) = x + 1/2 >= x = x
     problem:
      DPs:
       
      TRS:
       cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
       and(true(),true()) -> true()
       and(x,false()) -> false()
       and(false(),x) -> false()
       gr(0(),0()) -> false()
       gr(0(),x) -> false()
       gr(s(x),0()) -> true()
       gr(s(x),s(y)) -> gr(x,y)
       p(0()) -> 0()
       p(s(x)) -> x
     Qed
    
    DPs:
     gr#(s(x),s(y)) -> gr#(x,y)
    TRS:
     cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
     and(true(),true()) -> true()
     and(x,false()) -> false()
     and(false(),x) -> false()
     gr(0(),0()) -> false()
     gr(0(),x) -> false()
     gr(s(x),0()) -> true()
     gr(s(x),s(y)) -> gr(x,y)
     p(0()) -> 0()
     p(s(x)) -> x
    Subterm Criterion Processor:
     simple projection:
      pi(gr#) = 1
     problem:
      DPs:
       
      TRS:
       cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y))
       and(true(),true()) -> true()
       and(x,false()) -> false()
       and(false(),x) -> false()
       gr(0(),0()) -> false()
       gr(0(),x) -> false()
       gr(s(x),0()) -> true()
       gr(s(x),s(y)) -> gr(x,y)
       p(0()) -> 0()
       p(s(x)) -> x
     Qed