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