Problem:
 f(X) -> g()

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