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

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {4,3}
   transitions:
    g1(19) -> 20*
    g1(11) -> 12*
    g1(13) -> 14*
    a1() -> 11*
    f1(5) -> 6*
    b1() -> 5*
    g2(21) -> 22*
    f0(2) -> 3*
    f0(1) -> 3*
    a2() -> 25*
    a0() -> 1*
    b0() -> 2*
    g0(2) -> 4*
    g0(1) -> 4*
    1 -> 13*
    2 -> 19*
    5 -> 21*
    6 -> 3*
    12 -> 20,3,4
    14 -> 3*
    20 -> 3*
    22 -> 6,3
    25 -> 21*
  problem:
   
  Qed