YES

Problem:
 cond(true(),x) -> cond(and(even(x),gr(x,0())),p(x))
 and(x,false()) -> false()
 and(false(),x) -> false()
 and(true(),true()) -> true()
 even(0()) -> true()
 even(s(0())) -> false()
 even(s(s(x))) -> even(x)
 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) -> p#(x)
   cond#(true(),x) -> gr#(x,0())
   cond#(true(),x) -> even#(x)
   cond#(true(),x) -> and#(even(x),gr(x,0()))
   cond#(true(),x) -> cond#(and(even(x),gr(x,0())),p(x))
   even#(s(s(x))) -> even#(x)
   gr#(s(x),s(y())) -> gr#(x,y())
  TRS:
   cond(true(),x) -> cond(and(even(x),gr(x,0())),p(x))
   and(x,false()) -> false()
   and(false(),x) -> false()
   and(true(),true()) -> true()
   even(0()) -> true()
   even(s(0())) -> false()
   even(s(s(x))) -> even(x)
   gr(0(),x) -> false()
   gr(s(x),0()) -> true()
   gr(s(x),s(y())) -> gr(x,y())
   p(0()) -> 0()
   p(s(x)) -> x
  Usable Rule Processor:
   DPs:
    cond#(true(),x) -> p#(x)
    cond#(true(),x) -> gr#(x,0())
    cond#(true(),x) -> even#(x)
    cond#(true(),x) -> and#(even(x),gr(x,0()))
    cond#(true(),x) -> cond#(and(even(x),gr(x,0())),p(x))
    even#(s(s(x))) -> even#(x)
    gr#(s(x),s(y())) -> gr#(x,y())
   TRS:
    gr(0(),x) -> false()
    gr(s(x),0()) -> true()
    even(0()) -> true()
    even(s(0())) -> false()
    even(s(s(x))) -> even(x)
    p(0()) -> 0()
    p(s(x)) -> x
    and(x,false()) -> false()
    and(false(),x) -> false()
    and(true(),true()) -> true()
   Matrix Interpretation Processor: dim=1
    
    usable rules:
     gr(0(),x) -> false()
     gr(s(x),0()) -> true()
     p(0()) -> 0()
     p(s(x)) -> x
     and(x,false()) -> false()
     and(false(),x) -> false()
     and(true(),true()) -> true()
    interpretation:
     [and#](x0, x1) = x1,
     
     [even#](x0) = 1/2x0,
     
     [gr#](x0, x1) = 1/2x0 + 3/2x1,
     
     [p#](x0) = 0,
     
     [cond#](x0, x1) = 1/2x0 + 2x1 + 2,
     
     [y] = 3,
     
     [s](x0) = 2x0 + 1,
     
     [false] = 0,
     
     [p](x0) = 1/2x0,
     
     [and](x0, x1) = x1,
     
     [gr](x0, x1) = x0,
     
     [0] = 0,
     
     [even](x0) = 0,
     
     [true] = 1
    orientation:
     cond#(true(),x) = 2x + 5/2 >= 0 = p#(x)
     
     cond#(true(),x) = 2x + 5/2 >= 1/2x = gr#(x,0())
     
     cond#(true(),x) = 2x + 5/2 >= 1/2x = even#(x)
     
     cond#(true(),x) = 2x + 5/2 >= x = and#(even(x),gr(x,0()))
     
     cond#(true(),x) = 2x + 5/2 >= 3/2x + 2 = cond#(and(even(x),gr(x,0())),p(x))
     
     even#(s(s(x))) = 2x + 3/2 >= 1/2x = even#(x)
     
     gr#(s(x),s(y())) = x + 11 >= 1/2x + 9/2 = gr#(x,y())
     
     gr(0(),x) = 0 >= 0 = false()
     
     gr(s(x),0()) = 2x + 1 >= 1 = true()
     
     even(0()) = 0 >= 1 = true()
     
     even(s(0())) = 0 >= 0 = false()
     
     even(s(s(x))) = 0 >= 0 = even(x)
     
     p(0()) = 0 >= 0 = 0()
     
     p(s(x)) = x + 1/2 >= x = x
     
     and(x,false()) = 0 >= 0 = false()
     
     and(false(),x) = x >= 0 = false()
     
     and(true(),true()) = 1 >= 1 = true()
    problem:
     DPs:
      
     TRS:
      gr(0(),x) -> false()
      gr(s(x),0()) -> true()
      even(0()) -> true()
      even(s(0())) -> false()
      even(s(s(x))) -> even(x)
      p(0()) -> 0()
      p(s(x)) -> x
      and(x,false()) -> false()
      and(false(),x) -> false()
      and(true(),true()) -> true()
    Qed