YES(?,O(1))
0.00/0.05	YES(?,O(1))
0.00/0.05	
0.00/0.05	We are left with following problem, upon which TcT provides the
0.00/0.05	certificate YES(?,O(1)).
0.00/0.05	
0.00/0.05	Strict Trs:
0.00/0.05	  { first(0(), X) -> nil()
0.00/0.05	  , first(s(X), cons(Y)) -> cons(Y)
0.00/0.05	  , from(X) -> cons(X) }
0.00/0.05	Obligation:
0.00/0.05	  innermost runtime complexity
0.00/0.05	Answer:
0.00/0.05	  YES(?,O(1))
0.00/0.05	
0.00/0.05	The input was oriented with the instance of 'Small Polynomial Path
0.00/0.05	Order (PS)' as induced by the safe mapping
0.00/0.05	
0.00/0.05	 safe(first) = {1}, safe(0) = {}, safe(nil) = {}, safe(s) = {1},
0.00/0.05	 safe(cons) = {1}, safe(from) = {}
0.00/0.05	
0.00/0.05	and precedence
0.00/0.05	
0.00/0.05	 first > from .
0.00/0.05	
0.00/0.05	Following symbols are considered recursive:
0.00/0.05	
0.00/0.05	 {}
0.00/0.05	
0.00/0.05	The recursion depth is 0.
0.00/0.05	
0.00/0.05	For your convenience, here are the satisfied ordering constraints:
0.00/0.05	
0.00/0.05	             first(X; 0()) > nil()    
0.00/0.05	                                      
0.00/0.05	  first(cons(; Y); s(; X)) > cons(; Y)
0.00/0.05	                                      
0.00/0.05	                  from(X;) > cons(; X)
0.00/0.05	                                      
0.00/0.05	
0.00/0.05	Hurray, we answered YES(?,O(1))
0.00/0.06	EOF