YES(?,O(n^1))
364.82/105.94	YES(?,O(n^1))
364.82/105.94	
364.82/105.94	We are left with following problem, upon which TcT provides the
364.82/105.94	certificate YES(?,O(n^1)).
364.82/105.94	
364.82/105.94	Strict Trs:
364.82/105.94	  { active(f(X)) -> f(active(X))
364.82/105.94	  , active(f(f(X))) -> mark(c(f(g(f(X)))))
364.82/105.94	  , active(c(X)) -> mark(d(X))
364.82/105.94	  , active(h(X)) -> mark(c(d(X)))
364.82/105.94	  , active(h(X)) -> h(active(X))
364.82/105.94	  , f(mark(X)) -> mark(f(X))
364.82/105.94	  , f(ok(X)) -> ok(f(X))
364.82/105.94	  , c(ok(X)) -> ok(c(X))
364.82/105.94	  , g(ok(X)) -> ok(g(X))
364.82/105.94	  , d(ok(X)) -> ok(d(X))
364.82/105.94	  , h(mark(X)) -> mark(h(X))
364.82/105.94	  , h(ok(X)) -> ok(h(X))
364.82/105.94	  , proper(f(X)) -> f(proper(X))
364.82/105.94	  , proper(c(X)) -> c(proper(X))
364.82/105.94	  , proper(g(X)) -> g(proper(X))
364.82/105.94	  , proper(d(X)) -> d(proper(X))
364.82/105.94	  , proper(h(X)) -> h(proper(X))
364.82/105.94	  , top(mark(X)) -> top(proper(X))
364.82/105.94	  , top(ok(X)) -> top(active(X)) }
364.82/105.94	Obligation:
364.82/105.94	  innermost runtime complexity
364.82/105.94	Answer:
364.82/105.94	  YES(?,O(n^1))
364.82/105.94	
364.82/105.94	The problem is match-bounded by 1. The enriched problem is
364.82/105.94	compatible with the following automaton.
364.82/105.94	{ active_0(3) -> 1
364.82/105.94	, active_0(9) -> 1
364.82/105.94	, active_1(3) -> 16
364.82/105.94	, active_1(9) -> 16
364.82/105.94	, f_0(3) -> 2
364.82/105.94	, f_0(9) -> 2
364.82/105.94	, f_1(3) -> 11
364.82/105.94	, f_1(9) -> 11
364.82/105.94	, mark_0(3) -> 3
364.82/105.94	, mark_0(9) -> 3
364.82/105.94	, mark_1(11) -> 2
364.82/105.94	, mark_1(11) -> 11
364.82/105.94	, mark_1(15) -> 7
364.82/105.94	, mark_1(15) -> 15
364.82/105.94	, c_0(3) -> 4
364.82/105.94	, c_0(9) -> 4
364.82/105.94	, c_1(3) -> 12
364.82/105.94	, c_1(9) -> 12
364.82/105.94	, g_0(3) -> 5
364.82/105.94	, g_0(9) -> 5
364.82/105.94	, g_1(3) -> 13
364.82/105.94	, g_1(9) -> 13
364.82/105.94	, d_0(3) -> 6
364.82/105.94	, d_0(9) -> 6
364.82/105.94	, d_1(3) -> 14
364.82/105.94	, d_1(9) -> 14
364.82/105.94	, h_0(3) -> 7
364.82/105.94	, h_0(9) -> 7
364.82/105.94	, h_1(3) -> 15
364.82/105.94	, h_1(9) -> 15
364.82/105.94	, proper_0(3) -> 8
364.82/105.94	, proper_0(9) -> 8
364.82/105.94	, proper_1(3) -> 16
364.82/105.94	, proper_1(9) -> 16
364.82/105.94	, ok_0(3) -> 9
364.82/105.94	, ok_0(9) -> 9
364.82/105.94	, ok_1(11) -> 2
364.82/105.94	, ok_1(11) -> 11
364.82/105.94	, ok_1(12) -> 4
364.82/105.94	, ok_1(12) -> 12
364.82/105.94	, ok_1(13) -> 5
364.82/105.94	, ok_1(13) -> 13
364.82/105.94	, ok_1(14) -> 6
364.82/105.94	, ok_1(14) -> 14
364.82/105.94	, ok_1(15) -> 7
364.82/105.94	, ok_1(15) -> 15
364.82/105.94	, top_0(3) -> 10
364.82/105.94	, top_0(9) -> 10
364.82/105.94	, top_1(16) -> 10 }
364.82/105.94	
364.82/105.94	Hurray, we answered YES(?,O(n^1))
364.82/105.97	EOF