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

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