YES

Problem:
 cond(true(),x) -> cond(odd(x),p(x))
 odd(0()) -> false()
 odd(s(0())) -> true()
 odd(s(s(x))) -> odd(x)
 p(0()) -> 0()
 p(s(x)) -> x

Proof:
 DP Processor:
  DPs:
   cond#(true(),x) -> p#(x)
   cond#(true(),x) -> odd#(x)
   cond#(true(),x) -> cond#(odd(x),p(x))
   odd#(s(s(x))) -> odd#(x)
  TRS:
   cond(true(),x) -> cond(odd(x),p(x))
   odd(0()) -> false()
   odd(s(0())) -> true()
   odd(s(s(x))) -> odd(x)
   p(0()) -> 0()
   p(s(x)) -> x
  Usable Rule Processor:
   DPs:
    cond#(true(),x) -> p#(x)
    cond#(true(),x) -> odd#(x)
    cond#(true(),x) -> cond#(odd(x),p(x))
    odd#(s(s(x))) -> odd#(x)
   TRS:
    p(0()) -> 0()
    p(s(x)) -> x
    odd(0()) -> false()
    odd(s(0())) -> true()
    odd(s(s(x))) -> odd(x)
   Arctic Interpretation Processor:
    dimension: 1
    usable rules:
     p(0()) -> 0()
     p(s(x)) -> x
     odd(0()) -> false()
     odd(s(0())) -> true()
     odd(s(s(x))) -> odd(x)
    interpretation:
     [odd#](x0) = x0 + -16,
     
     [p#](x0) = x0,
     
     [cond#](x0, x1) = x0 + 1x1 + 0,
     
     [s](x0) = 3x0 + 4,
     
     [false] = 0,
     
     [0] = 0,
     
     [p](x0) = -2x0 + 1,
     
     [odd](x0) = x0 + 1,
     
     [true] = 3
    orientation:
     cond#(true(),x) = 1x + 3 >= x = p#(x)
     
     cond#(true(),x) = 1x + 3 >= x + -16 = odd#(x)
     
     cond#(true(),x) = 1x + 3 >= x + 2 = cond#(odd(x),p(x))
     
     odd#(s(s(x))) = 6x + 7 >= x + -16 = odd#(x)
     
     p(0()) = 1 >= 0 = 0()
     
     p(s(x)) = 1x + 2 >= x = x
     
     odd(0()) = 1 >= 0 = false()
     
     odd(s(0())) = 4 >= 3 = true()
     
     odd(s(s(x))) = 6x + 7 >= x + 1 = odd(x)
    problem:
     DPs:
      
     TRS:
      p(0()) -> 0()
      p(s(x)) -> x
      odd(0()) -> false()
      odd(s(0())) -> true()
      odd(s(s(x))) -> odd(x)
    Qed