YES(?,O(n^1))
682.41/187.47	YES(?,O(n^1))
682.41/187.47	
682.41/187.47	We are left with following problem, upon which TcT provides the
682.41/187.47	certificate YES(?,O(n^1)).
682.41/187.47	
682.41/187.47	Strict Trs:
682.41/187.47	  { active(c()) -> mark(f(g(c())))
682.41/187.47	  , active(f(g(X))) -> mark(g(X))
682.41/187.47	  , f(ok(X)) -> ok(f(X))
682.41/187.47	  , g(ok(X)) -> ok(g(X))
682.41/187.47	  , proper(c()) -> ok(c())
682.41/187.47	  , proper(f(X)) -> f(proper(X))
682.41/187.47	  , proper(g(X)) -> g(proper(X))
682.41/187.47	  , top(mark(X)) -> top(proper(X))
682.41/187.47	  , top(ok(X)) -> top(active(X)) }
682.41/187.47	Obligation:
682.41/187.47	  innermost runtime complexity
682.41/187.47	Answer:
682.41/187.47	  YES(?,O(n^1))
682.41/187.47	
682.41/187.47	The problem is match-bounded by 6. The enriched problem is
682.41/187.47	compatible with the following automaton.
682.41/187.47	{ active_0(2) -> 1
682.41/187.47	, active_1(2) -> 7
682.41/187.47	, active_2(5) -> 8
682.41/187.47	, active_3(19) -> 14
682.41/187.47	, active_4(22) -> 23
682.41/187.47	, active_5(20) -> 26
682.41/187.47	, active_6(29) -> 30
682.41/187.47	, c_0() -> 2
682.41/187.47	, c_1() -> 5
682.41/187.47	, c_2() -> 11
682.41/187.47	, c_3() -> 18
682.41/187.47	, c_4() -> 28
682.41/187.47	, mark_0(2) -> 2
682.41/187.47	, mark_1(3) -> 1
682.41/187.47	, mark_1(3) -> 7
682.41/187.47	, mark_2(9) -> 8
682.41/187.47	, mark_4(21) -> 14
682.41/187.47	, mark_5(24) -> 23
682.41/187.47	, f_0(2) -> 1
682.41/187.47	, f_1(2) -> 6
682.41/187.47	, f_1(4) -> 3
682.41/187.47	, f_2(10) -> 9
682.41/187.47	, f_2(12) -> 8
682.41/187.47	, f_3(15) -> 14
682.41/187.47	, f_3(17) -> 19
682.41/187.47	, f_4(20) -> 22
682.41/187.47	, g_0(2) -> 1
682.41/187.47	, g_1(2) -> 6
682.41/187.47	, g_1(5) -> 4
682.41/187.47	, g_2(11) -> 10
682.41/187.47	, g_2(13) -> 12
682.41/187.47	, g_3(11) -> 17
682.41/187.47	, g_3(16) -> 15
682.41/187.47	, g_4(11) -> 21
682.41/187.47	, g_4(18) -> 20
682.41/187.47	, g_5(18) -> 24
682.41/187.47	, g_5(25) -> 23
682.41/187.47	, g_5(28) -> 29
682.41/187.47	, g_6(27) -> 26
682.41/187.47	, proper_0(2) -> 1
682.41/187.47	, proper_1(2) -> 7
682.41/187.47	, proper_2(3) -> 8
682.41/187.47	, proper_2(4) -> 12
682.41/187.47	, proper_2(5) -> 13
682.41/187.47	, proper_3(9) -> 14
682.41/187.47	, proper_3(10) -> 15
682.41/187.47	, proper_3(11) -> 16
682.41/187.47	, proper_4(21) -> 23
682.41/187.47	, proper_5(11) -> 25
682.41/187.47	, proper_5(24) -> 26
682.41/187.47	, proper_6(18) -> 27
682.41/187.47	, ok_0(2) -> 2
682.41/187.47	, ok_1(5) -> 1
682.41/187.47	, ok_1(5) -> 7
682.41/187.47	, ok_1(6) -> 1
682.41/187.47	, ok_1(6) -> 6
682.41/187.47	, ok_2(11) -> 13
682.41/187.47	, ok_3(17) -> 12
682.41/187.47	, ok_3(18) -> 16
682.41/187.47	, ok_3(18) -> 25
682.41/187.47	, ok_3(19) -> 8
682.41/187.47	, ok_4(20) -> 15
682.41/187.47	, ok_4(20) -> 23
682.41/187.47	, ok_4(22) -> 14
682.41/187.47	, ok_4(28) -> 27
682.41/187.47	, ok_5(29) -> 26
682.41/187.47	, top_0(2) -> 1
682.41/187.47	, top_1(7) -> 1
682.41/187.47	, top_2(8) -> 1
682.41/187.47	, top_3(14) -> 1
682.41/187.47	, top_4(23) -> 1
682.41/187.47	, top_5(26) -> 1
682.41/187.47	, top_6(30) -> 1 }
682.41/187.47	
682.41/187.47	Hurray, we answered YES(?,O(n^1))
682.41/187.48	EOF