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

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