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