YES(?,O(n^1))

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

Proof:
 RT Transformation Processor:
  strict:
   p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
  weak:
   
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {4}
    transitions:
     p1(13,11) -> 14*
     p1(16,14) -> 4*
     p1(11,18) -> 16*
     p1(14,17) -> 16*
     p1(4,15) -> 16*
     a1(15) -> 12*
     a1(4) -> 15,12
     a1(16) -> 17*
     a1(18) -> 12*
     a1(13) -> 18*
     b1(12) -> 13*
     b1(4) -> 11*
     p0(4,4) -> 4*
     b0(4) -> 4*
     a0(4) -> 4*
   problem:
    strict:
     
    weak:
     p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
   Qed