0.00/0.01	YES
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	(VAR X)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(c)
0.00/0.01	(f 1)
0.00/0.01	(h 1)
0.00/0.01	(d)
0.00/0.01	(g)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	c(X) -> d(X)
0.00/0.01	f(f(X)) -> c(f(g(f(X))))
0.00/0.01	h(X) -> c(d(X))
0.00/0.01	)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Dependency Pairs Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 F(f(X)) -> C(f(g(f(X))))
0.00/0.01	 H(X) -> C(d(X))
0.00/0.01	-> Rules:
0.00/0.01	 c(X) -> d(X)
0.00/0.01	 f(f(X)) -> c(f(g(f(X))))
0.00/0.01	 h(X) -> c(d(X))
0.00/0.01	-> Unhiding Rules:
0.00/0.01	 Empty
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	SCC Processor:
0.00/0.01	-> Pairs:
0.00/0.01	 F(f(X)) -> C(f(g(f(X))))
0.00/0.01	 H(X) -> C(d(X))
0.00/0.01	-> Rules:
0.00/0.01	 c(X) -> d(X)
0.00/0.01	 f(f(X)) -> c(f(g(f(X))))
0.00/0.01	 h(X) -> c(d(X))
0.00/0.01	-> Unhiding rules:
0.00/0.01	 Empty
0.00/0.01	->Strongly Connected Components:
0.00/0.01	 There is no strongly connected component
0.00/0.01	
0.00/0.01	The problem is finite.
0.00/0.01	EOF