YES(?,O(n^1))
361.34/211.50	YES(?,O(n^1))
361.34/211.50	
361.34/211.50	We are left with following problem, upon which TcT provides the
361.34/211.50	certificate YES(?,O(n^1)).
361.34/211.50	
361.34/211.50	Strict Trs:
361.34/211.50	  { f(X) -> if(X, c(), n__f(n__true()))
361.34/211.50	  , f(X) -> n__f(X)
361.34/211.50	  , if(true(), X, Y) -> X
361.34/211.50	  , if(false(), X, Y) -> activate(Y)
361.34/211.50	  , true() -> n__true()
361.34/211.50	  , activate(X) -> X
361.34/211.50	  , activate(n__f(X)) -> f(activate(X))
361.34/211.50	  , activate(n__true()) -> true() }
361.34/211.50	Obligation:
361.34/211.50	  runtime complexity
361.34/211.50	Answer:
361.34/211.50	  YES(?,O(n^1))
361.34/211.50	
361.34/211.50	The problem is match-bounded by 4. The enriched problem is
361.34/211.50	compatible with the following automaton.
361.34/211.50	{ f_0(2) -> 1
361.34/211.50	, f_1(1) -> 1
361.34/211.50	, f_2(6) -> 1
361.34/211.50	, if_0(2, 2, 2) -> 1
361.34/211.50	, if_1(2, 3, 4) -> 1
361.34/211.50	, if_2(1, 7, 8) -> 1
361.34/211.50	, if_3(6, 10, 11) -> 1
361.34/211.50	, c_0() -> 1
361.34/211.50	, c_0() -> 2
361.34/211.50	, c_1() -> 3
361.34/211.50	, c_2() -> 1
361.34/211.50	, c_2() -> 7
361.34/211.50	, c_3() -> 1
361.34/211.50	, c_3() -> 10
361.34/211.50	, n__f_0(2) -> 1
361.34/211.50	, n__f_0(2) -> 2
361.34/211.50	, n__f_1(2) -> 1
361.34/211.50	, n__f_1(5) -> 1
361.34/211.50	, n__f_1(5) -> 4
361.34/211.50	, n__f_2(1) -> 1
361.34/211.50	, n__f_2(9) -> 1
361.34/211.50	, n__f_2(9) -> 8
361.34/211.50	, n__f_3(6) -> 1
361.34/211.50	, n__f_3(12) -> 11
361.34/211.50	, n__true_0() -> 1
361.34/211.50	, n__true_0() -> 2
361.34/211.50	, n__true_1() -> 1
361.34/211.50	, n__true_1() -> 5
361.34/211.50	, n__true_1() -> 6
361.34/211.50	, n__true_2() -> 1
361.34/211.50	, n__true_2() -> 6
361.34/211.50	, n__true_2() -> 9
361.34/211.50	, n__true_3() -> 6
361.34/211.50	, n__true_3() -> 12
361.34/211.50	, n__true_4() -> 6
361.34/211.50	, true_0() -> 1
361.34/211.50	, true_1() -> 1
361.34/211.50	, true_2() -> 6
361.34/211.50	, true_3() -> 6
361.34/211.50	, false_0() -> 1
361.34/211.50	, false_0() -> 2
361.34/211.50	, activate_0(2) -> 1
361.34/211.50	, activate_1(2) -> 1
361.34/211.50	, activate_1(4) -> 1
361.34/211.50	, activate_1(8) -> 1
361.34/211.50	, activate_2(5) -> 6
361.34/211.50	, activate_2(9) -> 6 }
361.34/211.50	
361.34/211.50	Hurray, we answered YES(?,O(n^1))
361.65/211.81	EOF