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