0.00/0.00	YES
0.00/0.00	We consider the system theBenchmark.
0.00/0.00	
0.00/0.00	  Alphabet:
0.00/0.00	
0.00/0.00	    uncurry : [a -> b -> c * a * b] --> c 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    uncurry(f, x, y) => f x y 
0.00/0.00	
0.00/0.00	This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).
0.00/0.00	
0.00/0.00	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:
0.00/0.00	
0.00/0.00	  Alphabet:
0.00/0.00	
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	
0.00/0.00	EOF