YES(?,O(n^1))
0.00/0.13	YES(?,O(n^1))
0.00/0.13	
0.00/0.13	We are left with following problem, upon which TcT provides the
0.00/0.13	certificate YES(?,O(n^1)).
0.00/0.13	
0.00/0.13	Strict Trs:
0.00/0.13	  { duplicate(Cons(x, xs)) -> Cons(x, Cons(x, duplicate(xs)))
0.00/0.13	  , duplicate(Nil()) -> Nil()
0.00/0.13	  , goal(x) -> duplicate(x) }
0.00/0.13	Obligation:
0.00/0.13	  innermost runtime complexity
0.00/0.13	Answer:
0.00/0.13	  YES(?,O(n^1))
0.00/0.13	
0.00/0.13	The input was oriented with the instance of 'Small Polynomial Path
0.00/0.13	Order (PS,1-bounded)' as induced by the safe mapping
0.00/0.13	
0.00/0.13	 safe(duplicate) = {}, safe(Cons) = {1, 2}, safe(Nil) = {},
0.00/0.13	 safe(goal) = {}
0.00/0.13	
0.00/0.13	and precedence
0.00/0.13	
0.00/0.13	 goal > duplicate .
0.00/0.13	
0.00/0.13	Following symbols are considered recursive:
0.00/0.13	
0.00/0.13	 {duplicate}
0.00/0.13	
0.00/0.13	The recursion depth is 1.
0.00/0.13	
0.00/0.13	For your convenience, here are the satisfied ordering constraints:
0.00/0.13	
0.00/0.13	  duplicate(Cons(; x,  xs);) > Cons(; x,  Cons(; x,  duplicate(xs;)))
0.00/0.13	                                                                     
0.00/0.13	           duplicate(Nil();) > Nil()                                 
0.00/0.13	                                                                     
0.00/0.13	                    goal(x;) > duplicate(x;)                         
0.00/0.13	                                                                     
0.00/0.13	
0.00/0.13	Hurray, we answered YES(?,O(n^1))
0.00/0.14	EOF