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