Problem:
 a() -> h(c())
 a() -> h(f(c()))
 g(x) -> g(x)
 h(f(x)) -> h(f(g(x)))

Proof:
 Nonconfluence Processor:
  terms: h(c()) *<- a() ->* h(f(c()))
  Qed
  
  first automaton:
   final states: {4}
   transitions:
    c() -> 5*
    h(5) -> 4*
  
  second automaton:
   final states: {1}
   transitions:
    f(2) -> 3*
    c() -> 2*
    g(2) -> 2*
    h(3) -> 1*