0.00/0.12	YES
0.00/0.12	
0.00/0.12	Problem 1: 
0.00/0.12	
0.00/0.12	(VAR X)
0.00/0.12	(STRATEGY CONTEXTSENSITIVE
0.00/0.12	(c)
0.00/0.12	(f 1 3)
0.00/0.12	(a)
0.00/0.12	(b)
0.00/0.12	)
0.00/0.12	(RULES
0.00/0.12	c -> a
0.00/0.12	c -> b
0.00/0.12	f(a,b,X) -> f(X,X,X)
0.00/0.12	)
0.00/0.12	
0.00/0.12	Problem 1: 
0.00/0.12	
0.00/0.12	Dependency Pairs Processor:
0.00/0.12	-> Pairs:
0.00/0.12	 F(a,b,X) -> F(X,X,X)
0.00/0.12	-> Rules:
0.00/0.12	 c -> a
0.00/0.12	 c -> b
0.00/0.12	 f(a,b,X) -> f(X,X,X)
0.00/0.12	-> Unhiding Rules:
0.00/0.12	 Empty
0.00/0.12	
0.00/0.12	Problem 1: 
0.00/0.12	
0.00/0.12	SCC Processor:
0.00/0.12	-> Pairs:
0.00/0.12	 F(a,b,X) -> F(X,X,X)
0.00/0.12	-> Rules:
0.00/0.12	 c -> a
0.00/0.12	 c -> b
0.00/0.12	 f(a,b,X) -> f(X,X,X)
0.00/0.12	-> Unhiding rules:
0.00/0.12	 Empty
0.00/0.12	->Strongly Connected Components:
0.00/0.12	->->Cycle:
0.00/0.12	->->-> Pairs:
0.00/0.12	 F(a,b,X) -> F(X,X,X)
0.00/0.12	->->-> Rules:
0.00/0.12	 c -> a
0.00/0.12	 c -> b
0.00/0.12	 f(a,b,X) -> f(X,X,X)
0.00/0.12	->->-> Unhiding rules:
0.00/0.12	 Empty
0.00/0.12	
0.00/0.12	Problem 1: 
0.00/0.12	
0.00/0.12	Forward Instantiation Processor:
0.00/0.12	-> Pairs:
0.00/0.12	 F(a,b,X) -> F(X,X,X)
0.00/0.12	-> Rules:
0.00/0.12	 c -> a
0.00/0.12	 c -> b
0.00/0.12	 f(a,b,X) -> f(X,X,X)
0.00/0.12	-> Unhiding rules:
0.00/0.12	 Empty
0.00/0.12	->Instantiated Pairs:
0.00/0.12	->->Original Pair:
0.00/0.12	 F(a,b,X) -> F(X,X,X)
0.00/0.12	->-> Instantiated pairs:
0.00/0.12	 F(a,b,b) -> F(b,b,b)
0.00/0.12	
0.00/0.12	Problem 1: 
0.00/0.12	
0.00/0.12	SCC Processor:
0.00/0.12	-> Pairs:
0.00/0.12	 F(a,b,b) -> F(b,b,b)
0.00/0.12	-> Rules:
0.00/0.12	 c -> a
0.00/0.12	 c -> b
0.00/0.12	 f(a,b,X) -> f(X,X,X)
0.00/0.12	-> Unhiding rules:
0.00/0.12	 Empty
0.00/0.12	->Strongly Connected Components:
0.00/0.12	 There is no strongly connected component
0.00/0.12	
0.00/0.12	The problem is finite.
0.00/0.12	EOF