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 XS)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(tail 1)
0.00/0.01	(zeros)
0.00/0.01	(0)
0.00/0.01	(cons 1)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	tail(cons(X,XS)) -> XS
0.00/0.01	zeros -> cons(0,zeros)
0.00/0.01	)
0.00/0.01	
0.00/0.01	Problem 1: 
0.00/0.01	
0.00/0.01	Innermost Equivalent Processor:
0.00/0.01	-> Rules:
0.00/0.01	 tail(cons(X,XS)) -> XS
0.00/0.01	 zeros -> cons(0,zeros)
0.00/0.01	-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
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	 TAIL(cons(X,XS)) -> XS
0.00/0.01	-> Rules:
0.00/0.01	 tail(cons(X,XS)) -> XS
0.00/0.01	 zeros -> cons(0,zeros)
0.00/0.01	-> Unhiding Rules:
0.00/0.01	 zeros -> ZEROS
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	 TAIL(cons(X,XS)) -> XS
0.00/0.01	-> Rules:
0.00/0.01	 tail(cons(X,XS)) -> XS
0.00/0.01	 zeros -> cons(0,zeros)
0.00/0.01	-> Unhiding rules:
0.00/0.01	 zeros -> ZEROS
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