Problem:
 a__f(X) -> g(h(f(X)))
 mark(f(X)) -> a__f(mark(X))
 mark(g(X)) -> g(X)
 mark(h(X)) -> h(mark(X))
 a__f(X) -> f(X)

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {5,4}
   transitions:
    f1(16) -> 17*
    f1(6) -> 7*
    f1(18) -> 19*
    h1(50) -> 51*
    h1(7) -> 8*
    mark1(25) -> 26*
    mark1(34) -> 35*
    mark1(28) -> 29*
    g1(42) -> 43*
    g1(44) -> 45*
    g1(36) -> 37*
    g1(8) -> 9*
    a__f1(26) -> 27*
    f2(56) -> 57*
    a__f0(2) -> 4*
    a__f0(1) -> 4*
    a__f0(3) -> 4*
    g2(58) -> 59*
    g0(2) -> 1*
    g0(1) -> 1*
    g0(3) -> 1*
    h2(57) -> 58*
    h0(2) -> 2*
    h0(1) -> 2*
    h0(3) -> 2*
    f0(2) -> 3*
    f0(1) -> 3*
    f0(3) -> 3*
    mark0(2) -> 5*
    mark0(1) -> 5*
    mark0(3) -> 5*
    1 -> 42,28,16
    2 -> 36,25,18
    3 -> 44,34,6
    7 -> 4*
    9 -> 4*
    17 -> 7*
    19 -> 7*
    26 -> 56,50
    27 -> 35,26,50,5
    29 -> 26*
    35 -> 26*
    37 -> 29,26,50,5
    43 -> 29,26,50,5
    45 -> 29,26,50,5
    51 -> 26,50,5
    57 -> 27,5
    59 -> 27,5
  problem:
   
  Qed