MAYBE 1074.15/297.04 MAYBE 1074.15/297.04 1074.15/297.04 We are left with following problem, upon which TcT provides the 1074.15/297.04 certificate MAYBE. 1074.15/297.04 1074.15/297.04 Strict Trs: 1074.15/297.04 { active(from(X)) -> from(active(X)) 1074.15/297.04 , active(from(X)) -> mark(cons(X, from(s(X)))) 1074.15/297.04 , active(cons(X1, X2)) -> cons(active(X1), X2) 1074.15/297.04 , active(s(X)) -> s(active(X)) 1074.15/297.04 , active(length(cons(X, Y))) -> mark(s(length1(Y))) 1074.15/297.04 , active(length(nil())) -> mark(0()) 1074.15/297.04 , active(length1(X)) -> mark(length(X)) 1074.15/297.04 , from(mark(X)) -> mark(from(X)) 1074.15/297.04 , from(ok(X)) -> ok(from(X)) 1074.15/297.04 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 1074.15/297.04 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1074.15/297.04 , s(mark(X)) -> mark(s(X)) 1074.15/297.04 , s(ok(X)) -> ok(s(X)) 1074.15/297.04 , length(ok(X)) -> ok(length(X)) 1074.15/297.04 , length1(ok(X)) -> ok(length1(X)) 1074.15/297.04 , proper(from(X)) -> from(proper(X)) 1074.15/297.04 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1074.15/297.04 , proper(s(X)) -> s(proper(X)) 1074.15/297.04 , proper(length(X)) -> length(proper(X)) 1074.15/297.04 , proper(nil()) -> ok(nil()) 1074.15/297.04 , proper(0()) -> ok(0()) 1074.15/297.04 , proper(length1(X)) -> length1(proper(X)) 1074.15/297.04 , top(mark(X)) -> top(proper(X)) 1074.15/297.04 , top(ok(X)) -> top(active(X)) } 1074.15/297.04 Obligation: 1074.15/297.04 runtime complexity 1074.15/297.04 Answer: 1074.15/297.04 MAYBE 1074.15/297.04 1074.15/297.04 None of the processors succeeded. 1074.15/297.04 1074.15/297.04 Details of failed attempt(s): 1074.15/297.04 ----------------------------- 1074.15/297.04 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1074.15/297.04 following reason: 1074.15/297.04 1074.15/297.04 Computation stopped due to timeout after 297.0 seconds. 1074.15/297.04 1074.15/297.04 2) 'Best' failed due to the following reason: 1074.15/297.04 1074.15/297.04 None of the processors succeeded. 1074.15/297.04 1074.15/297.04 Details of failed attempt(s): 1074.15/297.04 ----------------------------- 1074.15/297.04 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1074.15/297.04 seconds)' failed due to the following reason: 1074.15/297.04 1074.15/297.04 Computation stopped due to timeout after 148.0 seconds. 1074.15/297.04 1074.15/297.04 2) 'Best' failed due to the following reason: 1074.15/297.04 1074.15/297.04 None of the processors succeeded. 1074.15/297.04 1074.15/297.04 Details of failed attempt(s): 1074.15/297.04 ----------------------------- 1074.15/297.04 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1074.15/297.04 following reason: 1074.15/297.04 1074.15/297.04 The processor is inapplicable, reason: 1074.15/297.04 Processor only applicable for innermost runtime complexity analysis 1074.15/297.04 1074.15/297.04 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1074.15/297.04 to the following reason: 1074.15/297.04 1074.15/297.04 The processor is inapplicable, reason: 1074.15/297.04 Processor only applicable for innermost runtime complexity analysis 1074.15/297.04 1074.15/297.04 1074.15/297.04 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1074.15/297.04 failed due to the following reason: 1074.15/297.04 1074.15/297.04 None of the processors succeeded. 1074.15/297.04 1074.15/297.04 Details of failed attempt(s): 1074.15/297.04 ----------------------------- 1074.15/297.04 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1074.15/297.04 failed due to the following reason: 1074.15/297.04 1074.15/297.04 match-boundness of the problem could not be verified. 1074.15/297.04 1074.15/297.04 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1074.15/297.04 failed due to the following reason: 1074.15/297.04 1074.15/297.04 match-boundness of the problem could not be verified. 1074.15/297.04 1074.15/297.04 1074.15/297.04 1074.15/297.04 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 1074.15/297.04 the following reason: 1074.15/297.04 1074.15/297.04 We add the following weak dependency pairs: 1074.15/297.04 1074.15/297.04 Strict DPs: 1074.15/297.04 { active^#(from(X)) -> c_1(from^#(active(X))) 1074.15/297.04 , active^#(from(X)) -> c_2(cons^#(X, from(s(X)))) 1074.15/297.04 , active^#(cons(X1, X2)) -> c_3(cons^#(active(X1), X2)) 1074.15/297.04 , active^#(s(X)) -> c_4(s^#(active(X))) 1074.15/297.04 , active^#(length(cons(X, Y))) -> c_5(s^#(length1(Y))) 1074.15/297.04 , active^#(length(nil())) -> c_6() 1074.15/297.04 , active^#(length1(X)) -> c_7(length^#(X)) 1074.15/297.04 , from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.04 , from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.04 , cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.04 , cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.04 , s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.04 , s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.04 , length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.04 , length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.04 , proper^#(from(X)) -> c_16(from^#(proper(X))) 1074.15/297.04 , proper^#(cons(X1, X2)) -> c_17(cons^#(proper(X1), proper(X2))) 1074.15/297.04 , proper^#(s(X)) -> c_18(s^#(proper(X))) 1074.15/297.04 , proper^#(length(X)) -> c_19(length^#(proper(X))) 1074.15/297.04 , proper^#(nil()) -> c_20() 1074.15/297.04 , proper^#(0()) -> c_21() 1074.15/297.04 , proper^#(length1(X)) -> c_22(length1^#(proper(X))) 1074.15/297.04 , top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.04 , top^#(ok(X)) -> c_24(top^#(active(X))) } 1074.15/297.04 1074.15/297.04 and mark the set of starting terms. 1074.15/297.04 1074.15/297.04 We are left with following problem, upon which TcT provides the 1074.15/297.04 certificate MAYBE. 1074.15/297.04 1074.15/297.04 Strict DPs: 1074.15/297.04 { active^#(from(X)) -> c_1(from^#(active(X))) 1074.15/297.04 , active^#(from(X)) -> c_2(cons^#(X, from(s(X)))) 1074.15/297.04 , active^#(cons(X1, X2)) -> c_3(cons^#(active(X1), X2)) 1074.15/297.04 , active^#(s(X)) -> c_4(s^#(active(X))) 1074.15/297.04 , active^#(length(cons(X, Y))) -> c_5(s^#(length1(Y))) 1074.15/297.04 , active^#(length(nil())) -> c_6() 1074.15/297.04 , active^#(length1(X)) -> c_7(length^#(X)) 1074.15/297.04 , from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.04 , from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.04 , cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.04 , cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.04 , s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.04 , s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.04 , length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.04 , length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.04 , proper^#(from(X)) -> c_16(from^#(proper(X))) 1074.15/297.04 , proper^#(cons(X1, X2)) -> c_17(cons^#(proper(X1), proper(X2))) 1074.15/297.04 , proper^#(s(X)) -> c_18(s^#(proper(X))) 1074.15/297.04 , proper^#(length(X)) -> c_19(length^#(proper(X))) 1074.15/297.04 , proper^#(nil()) -> c_20() 1074.15/297.04 , proper^#(0()) -> c_21() 1074.15/297.04 , proper^#(length1(X)) -> c_22(length1^#(proper(X))) 1074.15/297.04 , top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.04 , top^#(ok(X)) -> c_24(top^#(active(X))) } 1074.15/297.04 Strict Trs: 1074.15/297.04 { active(from(X)) -> from(active(X)) 1074.15/297.04 , active(from(X)) -> mark(cons(X, from(s(X)))) 1074.15/297.04 , active(cons(X1, X2)) -> cons(active(X1), X2) 1074.15/297.04 , active(s(X)) -> s(active(X)) 1074.15/297.04 , active(length(cons(X, Y))) -> mark(s(length1(Y))) 1074.15/297.04 , active(length(nil())) -> mark(0()) 1074.15/297.04 , active(length1(X)) -> mark(length(X)) 1074.15/297.04 , from(mark(X)) -> mark(from(X)) 1074.15/297.04 , from(ok(X)) -> ok(from(X)) 1074.15/297.04 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 1074.15/297.04 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1074.15/297.04 , s(mark(X)) -> mark(s(X)) 1074.15/297.04 , s(ok(X)) -> ok(s(X)) 1074.15/297.04 , length(ok(X)) -> ok(length(X)) 1074.15/297.04 , length1(ok(X)) -> ok(length1(X)) 1074.15/297.04 , proper(from(X)) -> from(proper(X)) 1074.15/297.04 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1074.15/297.04 , proper(s(X)) -> s(proper(X)) 1074.15/297.04 , proper(length(X)) -> length(proper(X)) 1074.15/297.04 , proper(nil()) -> ok(nil()) 1074.15/297.04 , proper(0()) -> ok(0()) 1074.15/297.04 , proper(length1(X)) -> length1(proper(X)) 1074.15/297.04 , top(mark(X)) -> top(proper(X)) 1074.15/297.04 , top(ok(X)) -> top(active(X)) } 1074.15/297.04 Obligation: 1074.15/297.04 runtime complexity 1074.15/297.04 Answer: 1074.15/297.04 MAYBE 1074.15/297.04 1074.15/297.04 Consider the dependency graph: 1074.15/297.04 1074.15/297.04 1: active^#(from(X)) -> c_1(from^#(active(X))) 1074.15/297.04 -->_1 from^#(ok(X)) -> c_9(from^#(X)) :9 1074.15/297.04 -->_1 from^#(mark(X)) -> c_8(from^#(X)) :8 1074.15/297.04 1074.15/297.04 2: active^#(from(X)) -> c_2(cons^#(X, from(s(X)))) 1074.15/297.04 -->_1 cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) :11 1074.15/297.04 -->_1 cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) :10 1074.15/297.04 1074.15/297.04 3: active^#(cons(X1, X2)) -> c_3(cons^#(active(X1), X2)) 1074.15/297.04 -->_1 cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) :11 1074.15/297.04 -->_1 cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) :10 1074.15/297.04 1074.15/297.04 4: active^#(s(X)) -> c_4(s^#(active(X))) 1074.15/297.04 -->_1 s^#(ok(X)) -> c_13(s^#(X)) :13 1074.15/297.04 -->_1 s^#(mark(X)) -> c_12(s^#(X)) :12 1074.15/297.04 1074.15/297.04 5: active^#(length(cons(X, Y))) -> c_5(s^#(length1(Y))) 1074.15/297.04 -->_1 s^#(ok(X)) -> c_13(s^#(X)) :13 1074.15/297.04 -->_1 s^#(mark(X)) -> c_12(s^#(X)) :12 1074.15/297.04 1074.15/297.04 6: active^#(length(nil())) -> c_6() 1074.15/297.04 1074.15/297.04 7: active^#(length1(X)) -> c_7(length^#(X)) 1074.15/297.04 -->_1 length^#(ok(X)) -> c_14(length^#(X)) :14 1074.15/297.04 1074.15/297.04 8: from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.04 -->_1 from^#(ok(X)) -> c_9(from^#(X)) :9 1074.15/297.04 -->_1 from^#(mark(X)) -> c_8(from^#(X)) :8 1074.15/297.04 1074.15/297.04 9: from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.04 -->_1 from^#(ok(X)) -> c_9(from^#(X)) :9 1074.15/297.04 -->_1 from^#(mark(X)) -> c_8(from^#(X)) :8 1074.15/297.04 1074.15/297.04 10: cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.04 -->_1 cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) :11 1074.15/297.04 -->_1 cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) :10 1074.15/297.04 1074.15/297.04 11: cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.04 -->_1 cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) :11 1074.15/297.04 -->_1 cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) :10 1074.15/297.04 1074.15/297.04 12: s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.04 -->_1 s^#(ok(X)) -> c_13(s^#(X)) :13 1074.15/297.04 -->_1 s^#(mark(X)) -> c_12(s^#(X)) :12 1074.15/297.04 1074.15/297.04 13: s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.04 -->_1 s^#(ok(X)) -> c_13(s^#(X)) :13 1074.15/297.04 -->_1 s^#(mark(X)) -> c_12(s^#(X)) :12 1074.15/297.04 1074.15/297.04 14: length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.04 -->_1 length^#(ok(X)) -> c_14(length^#(X)) :14 1074.15/297.04 1074.15/297.04 15: length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.04 -->_1 length1^#(ok(X)) -> c_15(length1^#(X)) :15 1074.15/297.04 1074.15/297.04 16: proper^#(from(X)) -> c_16(from^#(proper(X))) 1074.15/297.04 -->_1 from^#(ok(X)) -> c_9(from^#(X)) :9 1074.15/297.04 -->_1 from^#(mark(X)) -> c_8(from^#(X)) :8 1074.15/297.04 1074.15/297.04 17: proper^#(cons(X1, X2)) -> c_17(cons^#(proper(X1), proper(X2))) 1074.15/297.04 -->_1 cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) :11 1074.15/297.04 -->_1 cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) :10 1074.15/297.04 1074.15/297.04 18: proper^#(s(X)) -> c_18(s^#(proper(X))) 1074.15/297.04 -->_1 s^#(ok(X)) -> c_13(s^#(X)) :13 1074.15/297.04 -->_1 s^#(mark(X)) -> c_12(s^#(X)) :12 1074.15/297.04 1074.15/297.04 19: proper^#(length(X)) -> c_19(length^#(proper(X))) 1074.15/297.04 -->_1 length^#(ok(X)) -> c_14(length^#(X)) :14 1074.15/297.04 1074.15/297.04 20: proper^#(nil()) -> c_20() 1074.15/297.04 1074.15/297.04 21: proper^#(0()) -> c_21() 1074.15/297.04 1074.15/297.04 22: proper^#(length1(X)) -> c_22(length1^#(proper(X))) 1074.15/297.04 -->_1 length1^#(ok(X)) -> c_15(length1^#(X)) :15 1074.15/297.04 1074.15/297.04 23: top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.04 -->_1 top^#(ok(X)) -> c_24(top^#(active(X))) :24 1074.15/297.04 -->_1 top^#(mark(X)) -> c_23(top^#(proper(X))) :23 1074.15/297.04 1074.15/297.04 24: top^#(ok(X)) -> c_24(top^#(active(X))) 1074.15/297.04 -->_1 top^#(ok(X)) -> c_24(top^#(active(X))) :24 1074.15/297.04 -->_1 top^#(mark(X)) -> c_23(top^#(proper(X))) :23 1074.15/297.04 1074.15/297.04 1074.15/297.04 Only the nodes {8,9,10,11,12,13,14,15,20,21,23,24} are reachable 1074.15/297.04 from nodes {8,9,10,11,12,13,14,15,20,21,23,24} that start 1074.15/297.05 derivation from marked basic terms. The nodes not reachable are 1074.15/297.05 removed from the problem. 1074.15/297.05 1074.15/297.05 We are left with following problem, upon which TcT provides the 1074.15/297.05 certificate MAYBE. 1074.15/297.05 1074.15/297.05 Strict DPs: 1074.15/297.05 { from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.05 , from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.05 , cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.05 , cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.05 , s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.05 , s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.05 , length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.05 , length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.05 , proper^#(nil()) -> c_20() 1074.15/297.05 , proper^#(0()) -> c_21() 1074.15/297.05 , top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.05 , top^#(ok(X)) -> c_24(top^#(active(X))) } 1074.15/297.05 Strict Trs: 1074.15/297.05 { active(from(X)) -> from(active(X)) 1074.15/297.05 , active(from(X)) -> mark(cons(X, from(s(X)))) 1074.15/297.05 , active(cons(X1, X2)) -> cons(active(X1), X2) 1074.15/297.05 , active(s(X)) -> s(active(X)) 1074.15/297.05 , active(length(cons(X, Y))) -> mark(s(length1(Y))) 1074.15/297.05 , active(length(nil())) -> mark(0()) 1074.15/297.05 , active(length1(X)) -> mark(length(X)) 1074.15/297.05 , from(mark(X)) -> mark(from(X)) 1074.15/297.05 , from(ok(X)) -> ok(from(X)) 1074.15/297.05 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 1074.15/297.05 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1074.15/297.05 , s(mark(X)) -> mark(s(X)) 1074.15/297.05 , s(ok(X)) -> ok(s(X)) 1074.15/297.05 , length(ok(X)) -> ok(length(X)) 1074.15/297.05 , length1(ok(X)) -> ok(length1(X)) 1074.15/297.05 , proper(from(X)) -> from(proper(X)) 1074.15/297.05 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1074.15/297.05 , proper(s(X)) -> s(proper(X)) 1074.15/297.05 , proper(length(X)) -> length(proper(X)) 1074.15/297.05 , proper(nil()) -> ok(nil()) 1074.15/297.05 , proper(0()) -> ok(0()) 1074.15/297.05 , proper(length1(X)) -> length1(proper(X)) 1074.15/297.05 , top(mark(X)) -> top(proper(X)) 1074.15/297.05 , top(ok(X)) -> top(active(X)) } 1074.15/297.05 Obligation: 1074.15/297.05 runtime complexity 1074.15/297.05 Answer: 1074.15/297.05 MAYBE 1074.15/297.05 1074.15/297.05 We estimate the number of application of {9,10} by applications of 1074.15/297.05 Pre({9,10}) = {}. Here rules are labeled as follows: 1074.15/297.05 1074.15/297.05 DPs: 1074.15/297.05 { 1: from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.05 , 2: from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.05 , 3: cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.05 , 4: cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.05 , 5: s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.05 , 6: s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.05 , 7: length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.05 , 8: length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.05 , 9: proper^#(nil()) -> c_20() 1074.15/297.05 , 10: proper^#(0()) -> c_21() 1074.15/297.05 , 11: top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.05 , 12: top^#(ok(X)) -> c_24(top^#(active(X))) } 1074.15/297.05 1074.15/297.05 We are left with following problem, upon which TcT provides the 1074.15/297.05 certificate MAYBE. 1074.15/297.05 1074.15/297.05 Strict DPs: 1074.15/297.05 { from^#(mark(X)) -> c_8(from^#(X)) 1074.15/297.05 , from^#(ok(X)) -> c_9(from^#(X)) 1074.15/297.05 , cons^#(mark(X1), X2) -> c_10(cons^#(X1, X2)) 1074.15/297.05 , cons^#(ok(X1), ok(X2)) -> c_11(cons^#(X1, X2)) 1074.15/297.05 , s^#(mark(X)) -> c_12(s^#(X)) 1074.15/297.05 , s^#(ok(X)) -> c_13(s^#(X)) 1074.15/297.05 , length^#(ok(X)) -> c_14(length^#(X)) 1074.15/297.05 , length1^#(ok(X)) -> c_15(length1^#(X)) 1074.15/297.05 , top^#(mark(X)) -> c_23(top^#(proper(X))) 1074.15/297.05 , top^#(ok(X)) -> c_24(top^#(active(X))) } 1074.15/297.05 Strict Trs: 1074.15/297.05 { active(from(X)) -> from(active(X)) 1074.15/297.05 , active(from(X)) -> mark(cons(X, from(s(X)))) 1074.15/297.05 , active(cons(X1, X2)) -> cons(active(X1), X2) 1074.15/297.05 , active(s(X)) -> s(active(X)) 1074.15/297.05 , active(length(cons(X, Y))) -> mark(s(length1(Y))) 1074.15/297.05 , active(length(nil())) -> mark(0()) 1074.15/297.05 , active(length1(X)) -> mark(length(X)) 1074.15/297.05 , from(mark(X)) -> mark(from(X)) 1074.15/297.05 , from(ok(X)) -> ok(from(X)) 1074.15/297.05 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 1074.15/297.05 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 1074.15/297.05 , s(mark(X)) -> mark(s(X)) 1074.15/297.05 , s(ok(X)) -> ok(s(X)) 1074.15/297.05 , length(ok(X)) -> ok(length(X)) 1074.15/297.05 , length1(ok(X)) -> ok(length1(X)) 1074.15/297.05 , proper(from(X)) -> from(proper(X)) 1074.15/297.05 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 1074.15/297.05 , proper(s(X)) -> s(proper(X)) 1074.15/297.05 , proper(length(X)) -> length(proper(X)) 1074.15/297.05 , proper(nil()) -> ok(nil()) 1074.15/297.05 , proper(0()) -> ok(0()) 1074.15/297.05 , proper(length1(X)) -> length1(proper(X)) 1074.15/297.05 , top(mark(X)) -> top(proper(X)) 1074.15/297.05 , top(ok(X)) -> top(active(X)) } 1074.15/297.05 Weak DPs: 1074.15/297.05 { proper^#(nil()) -> c_20() 1074.15/297.05 , proper^#(0()) -> c_21() } 1074.15/297.05 Obligation: 1074.15/297.05 runtime complexity 1074.15/297.05 Answer: 1074.15/297.05 MAYBE 1074.15/297.05 1074.15/297.05 Empty strict component of the problem is NOT empty. 1074.15/297.05 1074.15/297.05 1074.15/297.05 Arrrr.. 1074.44/297.20 EOF