YES(?,O(n^1))

Problem:
 a(l(x1)) -> l(a(x1))
 a(c(x1)) -> c(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(a(x1)))) -> a(a(l(c(c(c(r(x1)))))))

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