YES(?,O(n^1))

Problem:
 C(x1) -> c(x1)
 c(c(x1)) -> x1
 b(b(x1)) -> B(x1)
 B(B(x1)) -> b(x1)
 c(B(c(b(c(x1))))) -> B(c(b(c(B(c(b(x1)))))))
 b(B(x1)) -> x1
 B(b(x1)) -> x1
 c(C(x1)) -> x1
 C(c(x1)) -> x1

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {5,4,3,2}
   transitions:
    c1(6) -> 7*
    C0(1) -> 2*
    c0(1) -> 3*
    b0(1) -> 4*
    B0(1) -> 5*
    f80() -> 1*
    1 -> 6*
    7 -> 2*
  problem:
   
  Qed