YES
O(n)
TRS:
 {p(p(b(a(x0)), x1), p(x2, x3)) -> p(p(x3, a(x2)), p(b(a(x1)), b(x0)))}
 DUP: We consider a non-duplicating system.
  Trs:
   {p(p(b(a(x0)), x1), p(x2, x3)) -> p(p(x3, a(x2)), p(b(a(x1)), b(x0)))}
  BOUND:
   Automaton:
    {
         b_1(6) -> 7,
         b_1(3) -> 8,
         b_0(3) -> 3,
        a_1(16) -> 6,
         a_1(7) -> 16,
         a_1(5) -> 17,
         a_1(4) -> 6,
         a_1(3) -> 6 | 4,
         a_0(3) -> 3,
     p_1(9, 17) -> 5,
     p_1(8, 16) -> 5,
      p_1(7, 8) -> 9,
      p_1(5, 9) -> 3,
      p_1(3, 4) -> 5,
      p_0(3, 3) -> 3
    }
   Strict:
    {}
   Qed