YES(?,O(n^1))
0.00/0.81	YES(?,O(n^1))
0.00/0.81	
0.00/0.81	We are left with following problem, upon which TcT provides the
0.00/0.81	certificate YES(?,O(n^1)).
0.00/0.81	
0.00/0.81	Strict Trs:
0.00/0.81	  { f(X) -> n__f(X)
0.00/0.81	  , f(n__f(n__a())) -> f(n__g(n__f(n__a())))
0.00/0.81	  , a() -> n__a()
0.00/0.81	  , g(X) -> n__g(X)
0.00/0.81	  , activate(X) -> X
0.00/0.81	  , activate(n__f(X)) -> f(X)
0.00/0.81	  , activate(n__a()) -> a()
0.00/0.81	  , activate(n__g(X)) -> g(activate(X)) }
0.00/0.81	Obligation:
0.00/0.81	  runtime complexity
0.00/0.81	Answer:
0.00/0.81	  YES(?,O(n^1))
0.00/0.81	
0.00/0.81	The input is overlay and right-linear. Switching to innermost
0.00/0.81	rewriting.
0.00/0.81	
0.00/0.81	We are left with following problem, upon which TcT provides the
0.00/0.81	certificate YES(?,O(n^1)).
0.00/0.81	
0.00/0.81	Strict Trs:
0.00/0.81	  { f(X) -> n__f(X)
0.00/0.81	  , f(n__f(n__a())) -> f(n__g(n__f(n__a())))
0.00/0.81	  , a() -> n__a()
0.00/0.81	  , g(X) -> n__g(X)
0.00/0.81	  , activate(X) -> X
0.00/0.81	  , activate(n__f(X)) -> f(X)
0.00/0.81	  , activate(n__a()) -> a()
0.00/0.81	  , activate(n__g(X)) -> g(activate(X)) }
0.00/0.81	Obligation:
0.00/0.81	  innermost runtime complexity
0.00/0.81	Answer:
0.00/0.81	  YES(?,O(n^1))
0.00/0.81	
0.00/0.81	The problem is match-bounded by 2. The enriched problem is
0.00/0.81	compatible with the following automaton.
0.00/0.81	{ f_0(2) -> 1
0.00/0.81	, f_1(2) -> 1
0.00/0.81	, f_1(2) -> 6
0.00/0.81	, f_1(3) -> 1
0.00/0.81	, f_1(3) -> 6
0.00/0.81	, n__f_0(2) -> 1
0.00/0.81	, n__f_0(2) -> 2
0.00/0.81	, n__f_0(2) -> 6
0.00/0.81	, n__f_1(2) -> 1
0.00/0.81	, n__f_1(5) -> 4
0.00/0.81	, n__f_2(2) -> 1
0.00/0.81	, n__f_2(2) -> 6
0.00/0.81	, n__f_2(3) -> 1
0.00/0.81	, n__f_2(3) -> 6
0.00/0.81	, n__a_0() -> 1
0.00/0.81	, n__a_0() -> 2
0.00/0.81	, n__a_0() -> 6
0.00/0.81	, n__a_1() -> 1
0.00/0.81	, n__a_1() -> 5
0.00/0.81	, n__a_2() -> 1
0.00/0.81	, n__a_2() -> 6
0.00/0.81	, n__g_0(2) -> 1
0.00/0.81	, n__g_0(2) -> 2
0.00/0.81	, n__g_0(2) -> 6
0.00/0.81	, n__g_1(2) -> 1
0.00/0.81	, n__g_1(4) -> 3
0.00/0.81	, n__g_2(6) -> 1
0.00/0.81	, n__g_2(6) -> 6
0.00/0.81	, a_0() -> 1
0.00/0.81	, a_1() -> 1
0.00/0.81	, a_1() -> 6
0.00/0.81	, g_0(2) -> 1
0.00/0.81	, g_1(6) -> 1
0.00/0.81	, g_1(6) -> 6
0.00/0.81	, activate_0(2) -> 1
0.00/0.81	, activate_1(2) -> 6 }
0.00/0.81	
0.00/0.81	Hurray, we answered YES(?,O(n^1))
0.00/0.82	EOF