YES(?,O(n^1)) 760.43/297.11 YES(?,O(n^1)) 760.43/297.11 760.43/297.11 We are left with following problem, upon which TcT provides the 760.43/297.11 certificate YES(?,O(n^1)). 760.43/297.11 760.43/297.11 Strict Trs: 760.43/297.11 { active(zeros()) -> mark(cons(0(), zeros())) 760.43/297.11 , active(cons(X1, X2)) -> cons(active(X1), X2) 760.43/297.11 , active(tail(X)) -> tail(active(X)) 760.43/297.11 , active(tail(cons(X, XS))) -> mark(XS) 760.43/297.11 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 760.43/297.11 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 760.43/297.11 , tail(mark(X)) -> mark(tail(X)) 760.43/297.11 , tail(ok(X)) -> ok(tail(X)) 760.43/297.11 , proper(zeros()) -> ok(zeros()) 760.43/297.11 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 760.43/297.11 , proper(0()) -> ok(0()) 760.43/297.11 , proper(tail(X)) -> tail(proper(X)) 760.43/297.11 , top(mark(X)) -> top(proper(X)) 760.43/297.11 , top(ok(X)) -> top(active(X)) } 760.43/297.11 Obligation: 760.43/297.11 runtime complexity 760.43/297.11 Answer: 760.43/297.11 YES(?,O(n^1)) 760.43/297.11 760.43/297.11 The problem is match-bounded by 5. The enriched problem is 760.43/297.11 compatible with the following automaton. 760.43/297.11 { active_0(2) -> 1 760.43/297.11 , active_0(3) -> 1 760.43/297.11 , active_0(5) -> 1 760.43/297.11 , active_0(8) -> 1 760.43/297.11 , active_1(2) -> 15 760.43/297.11 , active_1(3) -> 15 760.43/297.11 , active_1(5) -> 15 760.43/297.11 , active_1(8) -> 15 760.43/297.11 , active_2(11) -> 16 760.43/297.11 , active_2(12) -> 16 760.43/297.11 , active_3(26) -> 22 760.43/297.11 , active_4(18) -> 28 760.43/297.11 , active_4(29) -> 30 760.43/297.11 , active_5(25) -> 31 760.43/297.11 , zeros_0() -> 2 760.43/297.11 , zeros_1() -> 12 760.43/297.11 , zeros_2() -> 19 760.43/297.11 , zeros_3() -> 27 760.43/297.11 , mark_0(2) -> 3 760.43/297.11 , mark_0(3) -> 3 760.43/297.11 , mark_0(5) -> 3 760.43/297.11 , mark_0(8) -> 3 760.43/297.11 , mark_1(10) -> 1 760.43/297.11 , mark_1(10) -> 15 760.43/297.11 , mark_1(13) -> 4 760.43/297.11 , mark_1(13) -> 13 760.43/297.11 , mark_1(14) -> 6 760.43/297.11 , mark_1(14) -> 14 760.43/297.11 , mark_2(17) -> 16 760.43/297.11 , cons_0(2, 2) -> 4 760.43/297.11 , cons_0(2, 3) -> 4 760.43/297.11 , cons_0(2, 5) -> 4 760.43/297.11 , cons_0(2, 8) -> 4 760.43/297.11 , cons_0(3, 2) -> 4 760.43/297.11 , cons_0(3, 3) -> 4 760.43/297.11 , cons_0(3, 5) -> 4 760.43/297.11 , cons_0(3, 8) -> 4 760.43/297.11 , cons_0(5, 2) -> 4 760.43/297.11 , cons_0(5, 3) -> 4 760.43/297.11 , cons_0(5, 5) -> 4 760.43/297.11 , cons_0(5, 8) -> 4 760.43/297.11 , cons_0(8, 2) -> 4 760.43/297.11 , cons_0(8, 3) -> 4 760.43/297.11 , cons_0(8, 5) -> 4 760.43/297.11 , cons_0(8, 8) -> 4 760.43/297.11 , cons_1(2, 2) -> 13 760.43/297.11 , cons_1(2, 3) -> 13 760.43/297.11 , cons_1(2, 5) -> 13 760.43/297.11 , cons_1(2, 8) -> 13 760.43/297.11 , cons_1(3, 2) -> 13 760.43/297.11 , cons_1(3, 3) -> 13 760.43/297.11 , cons_1(3, 5) -> 13 760.43/297.11 , cons_1(3, 8) -> 13 760.43/297.11 , cons_1(5, 2) -> 13 760.43/297.11 , cons_1(5, 3) -> 13 760.43/297.11 , cons_1(5, 5) -> 13 760.43/297.11 , cons_1(5, 8) -> 13 760.43/297.11 , cons_1(8, 2) -> 13 760.43/297.11 , cons_1(8, 3) -> 13 760.43/297.11 , cons_1(8, 5) -> 13 760.43/297.11 , cons_1(8, 8) -> 13 760.43/297.11 , cons_1(11, 12) -> 10 760.43/297.11 , cons_2(18, 19) -> 17 760.43/297.11 , cons_2(20, 21) -> 16 760.43/297.11 , cons_3(18, 19) -> 26 760.43/297.11 , cons_3(23, 24) -> 22 760.43/297.11 , cons_4(25, 27) -> 29 760.43/297.11 , cons_4(28, 19) -> 22 760.43/297.11 , cons_5(31, 27) -> 30 760.43/297.11 , 0_0() -> 5 760.43/297.11 , 0_1() -> 11 760.43/297.11 , 0_2() -> 18 760.43/297.11 , 0_3() -> 25 760.43/297.11 , tail_0(2) -> 6 760.43/297.11 , tail_0(3) -> 6 760.43/297.11 , tail_0(5) -> 6 760.43/297.11 , tail_0(8) -> 6 760.43/297.11 , tail_1(2) -> 14 760.43/297.11 , tail_1(3) -> 14 760.43/297.11 , tail_1(5) -> 14 760.43/297.11 , tail_1(8) -> 14 760.43/297.11 , proper_0(2) -> 7 760.43/297.11 , proper_0(3) -> 7 760.43/297.11 , proper_0(5) -> 7 760.43/297.11 , proper_0(8) -> 7 760.43/297.11 , proper_1(2) -> 15 760.43/297.11 , proper_1(3) -> 15 760.43/297.11 , proper_1(5) -> 15 760.43/297.11 , proper_1(8) -> 15 760.43/297.11 , proper_2(10) -> 16 760.43/297.11 , proper_2(11) -> 20 760.43/297.11 , proper_2(12) -> 21 760.43/297.11 , proper_3(17) -> 22 760.43/297.11 , proper_3(18) -> 23 760.43/297.11 , proper_3(19) -> 24 760.43/297.11 , ok_0(2) -> 8 760.43/297.11 , ok_0(3) -> 8 760.43/297.11 , ok_0(5) -> 8 760.43/297.11 , ok_0(8) -> 8 760.43/297.11 , ok_1(11) -> 7 760.43/297.11 , ok_1(11) -> 15 760.43/297.11 , ok_1(12) -> 7 760.43/297.11 , ok_1(12) -> 15 760.43/297.11 , ok_1(13) -> 4 760.43/297.11 , ok_1(13) -> 13 760.43/297.11 , ok_1(14) -> 6 760.43/297.11 , ok_1(14) -> 14 760.43/297.11 , ok_2(18) -> 20 760.43/297.11 , ok_2(19) -> 21 760.43/297.11 , ok_3(25) -> 23 760.43/297.11 , ok_3(26) -> 16 760.43/297.11 , ok_3(27) -> 24 760.43/297.11 , ok_4(29) -> 22 760.43/297.11 , top_0(2) -> 9 760.43/297.11 , top_0(3) -> 9 760.43/297.11 , top_0(5) -> 9 760.43/297.11 , top_0(8) -> 9 760.43/297.11 , top_1(15) -> 9 760.43/297.11 , top_2(16) -> 9 760.43/297.11 , top_3(22) -> 9 760.43/297.11 , top_4(30) -> 9 } 760.43/297.11 760.43/297.11 Hurray, we answered YES(?,O(n^1)) 760.43/297.14 EOF