YES(?,O(n^1))
251.25/123.97	YES(?,O(n^1))
251.25/123.97	
251.25/123.97	We are left with following problem, upon which TcT provides the
251.25/123.97	certificate YES(?,O(n^1)).
251.25/123.97	
251.25/123.97	Strict Trs:
251.25/123.97	  { active(g(X)) -> mark(h(X))
251.25/123.97	  , active(h(d())) -> mark(g(c()))
251.25/123.97	  , active(c()) -> mark(d())
251.25/123.97	  , g(ok(X)) -> ok(g(X))
251.25/123.97	  , h(ok(X)) -> ok(h(X))
251.25/123.97	  , proper(g(X)) -> g(proper(X))
251.25/123.97	  , proper(h(X)) -> h(proper(X))
251.25/123.97	  , proper(c()) -> ok(c())
251.25/123.97	  , proper(d()) -> ok(d())
251.25/123.97	  , top(mark(X)) -> top(proper(X))
251.25/123.97	  , top(ok(X)) -> top(active(X)) }
251.25/123.97	Obligation:
251.25/123.97	  innermost runtime complexity
251.25/123.97	Answer:
251.25/123.97	  YES(?,O(n^1))
251.25/123.97	
251.25/123.97	The problem is match-bounded by 4. The enriched problem is
251.25/123.97	compatible with the following automaton.
251.25/123.97	{ active_0(3) -> 1
251.25/123.97	, active_0(5) -> 1
251.25/123.97	, active_0(6) -> 1
251.25/123.97	, active_0(8) -> 1
251.25/123.97	, active_1(3) -> 14
251.25/123.97	, active_1(5) -> 14
251.25/123.97	, active_1(6) -> 14
251.25/123.97	, active_1(8) -> 14
251.25/123.97	, active_2(10) -> 15
251.25/123.97	, active_2(13) -> 15
251.25/123.97	, active_3(16) -> 17
251.25/123.97	, active_4(18) -> 19
251.25/123.97	, g_0(3) -> 2
251.25/123.97	, g_0(5) -> 2
251.25/123.97	, g_0(6) -> 2
251.25/123.97	, g_0(8) -> 2
251.25/123.97	, g_1(3) -> 11
251.25/123.97	, g_1(5) -> 11
251.25/123.97	, g_1(6) -> 11
251.25/123.97	, g_1(8) -> 11
251.25/123.97	, mark_0(3) -> 3
251.25/123.97	, mark_0(5) -> 3
251.25/123.97	, mark_0(6) -> 3
251.25/123.97	, mark_0(8) -> 3
251.25/123.97	, mark_1(10) -> 1
251.25/123.97	, mark_1(10) -> 14
251.25/123.97	, mark_2(16) -> 15
251.25/123.97	, h_0(3) -> 4
251.25/123.97	, h_0(5) -> 4
251.25/123.97	, h_0(6) -> 4
251.25/123.97	, h_0(8) -> 4
251.25/123.97	, h_1(3) -> 12
251.25/123.97	, h_1(5) -> 12
251.25/123.97	, h_1(6) -> 12
251.25/123.97	, h_1(8) -> 12
251.25/123.97	, c_0() -> 5
251.25/123.97	, c_1() -> 13
251.25/123.97	, d_0() -> 6
251.25/123.97	, d_1() -> 10
251.25/123.97	, d_2() -> 16
251.25/123.97	, d_3() -> 18
251.25/123.97	, proper_0(3) -> 7
251.25/123.97	, proper_0(5) -> 7
251.25/123.97	, proper_0(6) -> 7
251.25/123.97	, proper_0(8) -> 7
251.25/123.97	, proper_1(3) -> 14
251.25/123.97	, proper_1(5) -> 14
251.25/123.97	, proper_1(6) -> 14
251.25/123.97	, proper_1(8) -> 14
251.25/123.97	, proper_2(10) -> 15
251.25/123.97	, proper_3(16) -> 17
251.25/123.97	, ok_0(3) -> 8
251.25/123.97	, ok_0(5) -> 8
251.25/123.97	, ok_0(6) -> 8
251.25/123.97	, ok_0(8) -> 8
251.25/123.97	, ok_1(10) -> 7
251.25/123.97	, ok_1(10) -> 14
251.25/123.97	, ok_1(11) -> 2
251.25/123.97	, ok_1(11) -> 11
251.25/123.97	, ok_1(12) -> 4
251.25/123.97	, ok_1(12) -> 12
251.25/123.97	, ok_1(13) -> 7
251.25/123.97	, ok_1(13) -> 14
251.25/123.97	, ok_2(16) -> 15
251.25/123.97	, ok_3(18) -> 17
251.25/123.97	, top_0(3) -> 9
251.25/123.97	, top_0(5) -> 9
251.25/123.97	, top_0(6) -> 9
251.25/123.97	, top_0(8) -> 9
251.25/123.97	, top_1(14) -> 9
251.25/123.97	, top_2(15) -> 9
251.25/123.97	, top_3(17) -> 9
251.25/123.97	, top_4(19) -> 9 }
251.25/123.97	
251.25/123.97	Hurray, we answered YES(?,O(n^1))
251.25/123.97	EOF