YES

Problem:
 p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))

Proof:
 DP Processor:
  DPs:
   p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(b(a(x1)),b(x0))
   p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(x3,a(x2))
   p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0)))
  TRS:
   p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
  EDG Processor:
   DPs:
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(b(a(x1)),b(x0))
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(x3,a(x2))
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0)))
   TRS:
    p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
   graph:
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0))) ->
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(b(a(x1)),b(x0))
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0))) ->
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(x3,a(x2))
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0))) ->
    p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0)))
   CDG Processor:
    DPs:
     p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(b(a(x1)),b(x0))
     p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(x3,a(x2))
     p#(p(b(a(x0)),x1),p(x2,x3)) -> p#(p(x3,a(x2)),p(b(a(x1)),b(x0)))
    TRS:
     p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
    graph:
     
    Qed