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