We consider the system AotoYamada_05__017.

  Alphabet:

    uncurry : [a -> b -> c * a * b] --> c 

  Rules:

    uncurry(f, x, y) => f x y 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).

Symbol uncurry is an encoding for application that is only used in innocuous ways.  We can simplify the program (without losing non-termination) by removing it.  This gives:

  Alphabet:


  Rules: