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

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