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