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