Problem:
 f(f(a())) -> c()

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