YES(?,O(1))
0.00/0.32	YES(?,O(1))
0.00/0.32	
0.00/0.32	We are left with following problem, upon which TcT provides the
0.00/0.32	certificate YES(?,O(1)).
0.00/0.32	
0.00/0.32	Strict Trs:
0.00/0.32	  { f(X) -> n__f(X)
0.00/0.32	  , f(f(X)) -> c(n__f(g(n__f(X))))
0.00/0.32	  , c(X) -> d(activate(X))
0.00/0.32	  , d(X) -> n__d(X)
0.00/0.32	  , activate(X) -> X
0.00/0.32	  , activate(n__f(X)) -> f(X)
0.00/0.32	  , activate(n__d(X)) -> d(X)
0.00/0.32	  , h(X) -> c(n__d(X)) }
0.00/0.32	Obligation:
0.00/0.32	  innermost runtime complexity
0.00/0.32	Answer:
0.00/0.32	  YES(?,O(1))
0.00/0.32	
0.00/0.32	Arguments of following rules are not normal-forms:
0.00/0.32	
0.00/0.32	{ f(f(X)) -> c(n__f(g(n__f(X)))) }
0.00/0.32	
0.00/0.32	All above mentioned rules can be savely removed.
0.00/0.32	
0.00/0.32	We are left with following problem, upon which TcT provides the
0.00/0.32	certificate YES(?,O(1)).
0.00/0.32	
0.00/0.32	Strict Trs:
0.00/0.32	  { f(X) -> n__f(X)
0.00/0.32	  , c(X) -> d(activate(X))
0.00/0.32	  , d(X) -> n__d(X)
0.00/0.32	  , activate(X) -> X
0.00/0.32	  , activate(n__f(X)) -> f(X)
0.00/0.32	  , activate(n__d(X)) -> d(X)
0.00/0.32	  , h(X) -> c(n__d(X)) }
0.00/0.32	Obligation:
0.00/0.32	  innermost runtime complexity
0.00/0.32	Answer:
0.00/0.32	  YES(?,O(1))
0.00/0.32	
0.00/0.32	The input was oriented with the instance of 'Small Polynomial Path
0.00/0.32	Order (PS,0-bounded)' as induced by the safe mapping
0.00/0.32	
0.00/0.32	 safe(f) = {1}, safe(c) = {1}, safe(n__f) = {1}, safe(d) = {1},
0.00/0.32	 safe(activate) = {1}, safe(h) = {1}, safe(n__d) = {1}
0.00/0.32	
0.00/0.32	and precedence
0.00/0.32	
0.00/0.32	 c > f, c > d, c > activate, activate > f, activate > d, h > f,
0.00/0.32	 h > c, h > d, h > activate, f ~ d .
0.00/0.32	
0.00/0.32	Following symbols are considered recursive:
0.00/0.32	
0.00/0.32	 {}
0.00/0.32	
0.00/0.32	The recursion depth is 0.
0.00/0.32	
0.00/0.32	For your convenience, here are the satisfied ordering constraints:
0.00/0.32	
0.00/0.32	                 f(; X) > n__f(; X)         
0.00/0.32	                                            
0.00/0.32	                 c(; X) > d(; activate(; X))
0.00/0.32	                                            
0.00/0.32	                 d(; X) > n__d(; X)         
0.00/0.32	                                            
0.00/0.32	          activate(; X) > X                 
0.00/0.32	                                            
0.00/0.32	  activate(; n__f(; X)) > f(; X)            
0.00/0.32	                                            
0.00/0.32	  activate(; n__d(; X)) > d(; X)            
0.00/0.32	                                            
0.00/0.32	                 h(; X) > c(; n__d(; X))    
0.00/0.32	                                            
0.00/0.32	
0.00/0.32	Hurray, we answered YES(?,O(1))
0.00/0.32	EOF