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