0.00/0.00	YES
0.00/0.00	
0.00/0.00	Problem 1: 
0.00/0.00	
0.00/0.00	(VAR X Y Z)
0.00/0.00	(STRATEGY CONTEXTSENSITIVE
0.00/0.00	(first 1 2)
0.00/0.00	(from 1)
0.00/0.00	(0)
0.00/0.00	(cons 1)
0.00/0.00	(nil)
0.00/0.00	(s 1)
0.00/0.00	)
0.00/0.00	(RULES
0.00/0.00	first(0,X) -> nil
0.00/0.00	first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
0.00/0.00	from(X) -> cons(X,from(s(X)))
0.00/0.00	)
0.00/0.00	
0.00/0.00	Problem 1: 
0.00/0.00	
0.00/0.00	Innermost Equivalent Processor:
0.00/0.00	-> Rules:
0.00/0.00	 first(0,X) -> nil
0.00/0.00	 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
0.00/0.00	 from(X) -> cons(X,from(s(X)))
0.00/0.00	-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
0.00/0.00	 
0.00/0.00	
0.00/0.00	Problem 1: 
0.00/0.00	
0.00/0.00	Dependency Pairs Processor:
0.00/0.00	-> Pairs:
0.00/0.00	 Empty
0.00/0.00	-> Rules:
0.00/0.00	 first(0,X) -> nil
0.00/0.00	 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
0.00/0.00	 from(X) -> cons(X,from(s(X)))
0.00/0.00	-> Unhiding Rules:
0.00/0.00	 Empty
0.00/0.00	
0.00/0.00	Problem 1: 
0.00/0.00	
0.00/0.00	Basic Processor:
0.00/0.00	-> Pairs:
0.00/0.00	 Empty
0.00/0.00	-> Rules:
0.00/0.00	 first(0,X) -> nil
0.00/0.00	 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
0.00/0.00	 from(X) -> cons(X,from(s(X)))
0.00/0.00	-> Unhiding rules:
0.00/0.00	 Empty
0.00/0.00	-> Result:
0.00/0.00	 Set P is empty
0.00/0.00	
0.00/0.00	The problem is finite.
0.00/0.01	EOF