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 : [nat * nat] --> nat 
0.00/0.00	    g : [nat -> nat] --> nat 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    f(g(/\x.f(x, x)), g(/\y.f(y, y))) => (/\z.f(z, z)) g(/\u.f(u, u)) 
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(g(/\x.f(x, x)), g(/\y.f(y, y))) 
0.00/0.00	    => (/\x.f(x, x)) g(/\y.f(y, y)) 
0.00/0.00	    => f(g(/\x.f(x, x)), g(/\y.f(y, y))) 
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