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