Problem:
 a() -> a()
 a() -> b()
 g(b()) -> g(g(b()))
 g(g(a())) -> a()

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