0.00/0.00	NO
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	    f : [a -> a] --> b 
0.00/0.00	    g : [a -> a] --> a -> a 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    g(h) x => x 
0.00/0.00	    f(h) => f(g(h)) 
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	It is easy to see that this system is non-terminating:
0.00/0.00	
0.00/0.00	  f(h) 
0.00/0.00	    => f(g(h)) 
0.00/0.00	
0.00/0.00	That is, a term s reduces to a term t which instantiates s.
0.00/0.00	
0.00/0.00	EOF