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 X1 Y Z)
0.00/0.01	(STRATEGY CONTEXTSENSITIVE
0.00/0.01	(2nd 1)
0.00/0.01	(from 1)
0.00/0.01	(cons 1)
0.00/0.01	(cons1 1 2)
0.00/0.01	(s 1)
0.00/0.01	)
0.00/0.01	(RULES
0.00/0.01	2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
0.00/0.01	2nd(cons1(X,cons(Y,Z))) -> Y
0.00/0.01	from(X) -> cons(X,from(s(X)))
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	 2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
0.00/0.01	 2nd(cons1(X,cons(Y,Z))) -> Y
0.00/0.01	 from(X) -> cons(X,from(s(X)))
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	 2ND(cons(X,X1)) -> 2ND(cons1(X,X1))
0.00/0.01	 2ND(cons(X,X1)) -> X1
0.00/0.01	-> Rules:
0.00/0.01	 2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
0.00/0.01	 2nd(cons1(X,cons(Y,Z))) -> Y
0.00/0.01	 from(X) -> cons(X,from(s(X)))
0.00/0.01	-> Unhiding Rules:
0.00/0.01	 from(s(X)) -> FROM(s(X))
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	 2ND(cons(X,X1)) -> 2ND(cons1(X,X1))
0.00/0.01	 2ND(cons(X,X1)) -> X1
0.00/0.01	-> Rules:
0.00/0.01	 2nd(cons(X,X1)) -> 2nd(cons1(X,X1))
0.00/0.01	 2nd(cons1(X,cons(Y,Z))) -> Y
0.00/0.01	 from(X) -> cons(X,from(s(X)))
0.00/0.01	-> Unhiding rules:
0.00/0.01	 from(s(X)) -> FROM(s(X))
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