YES(?,O(n^1))

Problem:
 a(a(a(a(b(b(x1)))))) -> b(b(a(a(b(b(x1))))))
 b(b(a(a(x1)))) -> a(a(b(b(b(b(x1))))))
 b(b(c(c(a(a(x1)))))) -> c(c(c(c(a(a(a(a(b(b(x1))))))))))

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