YES

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

Proof:
 DP Processor:
  DPs:
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
  TRS:
   p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
  EDG Processor:
   DPs:
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
   TRS:
    p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
   graph:
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
   SCC Processor:
    #sccs: 1
    #rules: 2
    #arcs: 6/9
    DPs:
     p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
     p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
    TRS:
     p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
    Bounds Processor:
     bound: 1
     enrichment: match-dp
     automaton:
      final states: {7,1}
      transitions:
       p{#,1}(5,17) -> 7*
       p{#,1}(16,14) -> 7*
       p{#,1}(2,17) -> 7*
       p{#,1}(6,17) -> 7*
       p1(5,17) -> 17*
       p1(16,14) -> 17*
       p1(2,17) -> 17*
       p1(13,4) -> 14*
       p1(13,8) -> 14*
       p1(6,17) -> 17*
       a1(15) -> 16*
       a1(5) -> 15*
       a1(16) -> 16*
       a1(6) -> 15*
       b1(2) -> 13*
       f40() -> 2*
       p{#,0}(6,4) -> 1*
       p{#,0}(6,8) -> 7*
       p{#,0}(5,8) -> 7*
       p{#,0}(2,8) -> 7*
       a0(5) -> 6*
       a0(2) -> 5*
       a0(6) -> 6*
       p0(6,4) -> 8*
       p0(6,8) -> 8*
       p0(3,2) -> 4*
       p0(3,4) -> 4*
       p0(3,8) -> 4*
       p0(5,8) -> 8*
       p0(2,8) -> 8*
       b0(2) -> 3*
       1 -> 7*
       7 -> 1*
     problem:
      DPs:
       
      TRS:
       p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
     Qed