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