YES(?,O(n^1))

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

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {4,3,2}
   transitions:
    c1(11) -> 12*
    b1(5) -> 6*
    c2(13) -> 14*
    a0(1) -> 2*
    b0(1) -> 3*
    c0(1) -> 4*
    f60() -> 1*
    1 -> 11,5
    5 -> 13*
    6 -> 2*
    12 -> 3*
    14 -> 6*
  problem:
   
  Qed