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

Proof:
 Nonconfluence Processor:
  terms: h(g(b())) *<- a() ->* h(c())
  Qed
  
  first automaton:
   final states: {9}
   transitions:
    h(11) -> 11,32,9
    h(32) -> 9*
    h(9) -> 9*
    h(10) -> 10,11,32
    b() -> 10*
    g(32) -> 9*
    g(9) -> 9*
    g(11) -> 32,11
    g(10) -> 10,11
  
  second automaton:
   final states: {7}
   transitions:
    h(8) -> 7*
    c() -> 8*