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

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