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

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