YES(?,O(n^1))
3.50/1.18	YES(?,O(n^1))
3.50/1.18	
3.50/1.18	We are left with following problem, upon which TcT provides the
3.50/1.18	certificate YES(?,O(n^1)).
3.50/1.18	
3.50/1.18	Strict Trs:
3.50/1.18	  { f(X) -> n__f(X)
3.50/1.18	  , f(f(a())) -> c(n__f(n__g(n__f(n__a()))))
3.50/1.18	  , a() -> n__a()
3.50/1.18	  , g(X) -> n__g(X)
3.50/1.18	  , activate(X) -> X
3.50/1.18	  , activate(n__f(X)) -> f(activate(X))
3.50/1.18	  , activate(n__g(X)) -> g(activate(X))
3.50/1.18	  , activate(n__a()) -> a() }
3.50/1.18	Obligation:
3.50/1.18	  runtime complexity
3.50/1.18	Answer:
3.50/1.18	  YES(?,O(n^1))
3.50/1.18	
3.50/1.18	The problem is match-bounded by 2. The enriched problem is
3.50/1.18	compatible with the following automaton.
3.50/1.18	{ f_0(2) -> 1
3.50/1.18	, f_1(3) -> 1
3.50/1.18	, f_1(3) -> 3
3.50/1.18	, a_0() -> 1
3.50/1.18	, a_1() -> 1
3.50/1.18	, a_1() -> 3
3.50/1.18	, c_0(2) -> 1
3.50/1.18	, c_0(2) -> 2
3.50/1.18	, c_0(2) -> 3
3.50/1.18	, c_2(3) -> 1
3.50/1.18	, c_2(3) -> 3
3.50/1.18	, n__f_0(2) -> 1
3.50/1.18	, n__f_0(2) -> 2
3.50/1.18	, n__f_0(2) -> 3
3.50/1.18	, n__f_1(2) -> 1
3.50/1.18	, n__f_2(3) -> 1
3.50/1.18	, n__f_2(3) -> 3
3.50/1.18	, n__g_0(2) -> 1
3.50/1.18	, n__g_0(2) -> 2
3.50/1.18	, n__g_0(2) -> 3
3.50/1.18	, n__g_1(2) -> 1
3.50/1.18	, n__g_2(3) -> 1
3.50/1.18	, n__g_2(3) -> 3
3.50/1.18	, n__a_0() -> 1
3.50/1.18	, n__a_0() -> 2
3.50/1.18	, n__a_0() -> 3
3.50/1.18	, n__a_1() -> 1
3.50/1.18	, n__a_2() -> 1
3.50/1.18	, n__a_2() -> 3
3.50/1.18	, g_0(2) -> 1
3.50/1.18	, g_1(3) -> 1
3.50/1.18	, g_1(3) -> 3
3.50/1.18	, activate_0(2) -> 1
3.50/1.18	, activate_1(2) -> 3 }
3.50/1.18	
3.50/1.18	Hurray, we answered YES(?,O(n^1))
3.50/1.19	EOF