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