YES(?,O(n^1))

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

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {3}
   transitions:
    p0(1,2) -> 3*
    p0(2,1) -> 3*
    p0(1,1) -> 3*
    p0(2,2) -> 3*
    a0(2) -> 1*
    a0(1) -> 1*
    b0(2) -> 2*
    b0(1) -> 2*
  problem:
   
  Qed