YES(?,O(n^1))
776.11/232.37	YES(?,O(n^1))
776.11/232.37	
776.11/232.37	We are left with following problem, upon which TcT provides the
776.11/232.37	certificate YES(?,O(n^1)).
776.11/232.37	
776.11/232.37	Strict Trs:
776.11/232.37	  { active(f(f(a()))) -> mark(f(g(f(a()))))
776.11/232.37	  , active(g(X)) -> g(active(X))
776.11/232.37	  , f(ok(X)) -> ok(f(X))
776.11/232.37	  , g(mark(X)) -> mark(g(X))
776.11/232.37	  , g(ok(X)) -> ok(g(X))
776.11/232.37	  , proper(f(X)) -> f(proper(X))
776.11/232.37	  , proper(a()) -> ok(a())
776.11/232.37	  , proper(g(X)) -> g(proper(X))
776.11/232.37	  , top(mark(X)) -> top(proper(X))
776.11/232.37	  , top(ok(X)) -> top(active(X)) }
776.11/232.37	Obligation:
776.11/232.37	  innermost runtime complexity
776.11/232.37	Answer:
776.11/232.37	  YES(?,O(n^1))
776.11/232.37	
776.11/232.37	The problem is match-bounded by 2. The enriched problem is
776.11/232.37	compatible with the following automaton.
776.11/232.37	{ active_0(3) -> 1
776.11/232.37	, active_0(4) -> 1
776.11/232.37	, active_0(7) -> 1
776.11/232.37	, active_1(3) -> 12
776.11/232.37	, active_1(4) -> 12
776.11/232.37	, active_1(7) -> 12
776.11/232.37	, active_2(11) -> 13
776.11/232.37	, f_0(3) -> 2
776.11/232.37	, f_0(4) -> 2
776.11/232.37	, f_0(7) -> 2
776.11/232.37	, f_1(3) -> 9
776.11/232.37	, f_1(4) -> 9
776.11/232.37	, f_1(7) -> 9
776.11/232.37	, a_0() -> 3
776.11/232.37	, a_1() -> 11
776.11/232.37	, mark_0(3) -> 4
776.11/232.37	, mark_0(4) -> 4
776.11/232.37	, mark_0(7) -> 4
776.11/232.37	, mark_1(10) -> 5
776.11/232.37	, mark_1(10) -> 10
776.11/232.37	, g_0(3) -> 5
776.11/232.37	, g_0(4) -> 5
776.11/232.37	, g_0(7) -> 5
776.11/232.37	, g_1(3) -> 10
776.11/232.37	, g_1(4) -> 10
776.11/232.37	, g_1(7) -> 10
776.11/232.37	, proper_0(3) -> 6
776.11/232.37	, proper_0(4) -> 6
776.11/232.37	, proper_0(7) -> 6
776.11/232.37	, proper_1(3) -> 12
776.11/232.37	, proper_1(4) -> 12
776.11/232.37	, proper_1(7) -> 12
776.11/232.37	, ok_0(3) -> 7
776.11/232.37	, ok_0(4) -> 7
776.11/232.37	, ok_0(7) -> 7
776.11/232.37	, ok_1(9) -> 2
776.11/232.37	, ok_1(9) -> 9
776.11/232.37	, ok_1(10) -> 5
776.11/232.37	, ok_1(10) -> 10
776.11/232.37	, ok_1(11) -> 6
776.11/232.37	, ok_1(11) -> 12
776.11/232.37	, top_0(3) -> 8
776.11/232.37	, top_0(4) -> 8
776.11/232.37	, top_0(7) -> 8
776.11/232.37	, top_1(12) -> 8
776.11/232.37	, top_2(13) -> 8 }
776.11/232.37	
776.11/232.37	Hurray, we answered YES(?,O(n^1))
776.11/232.37	EOF