MAYBE 773.87/297.03 MAYBE 773.87/297.03 773.87/297.03 We are left with following problem, upon which TcT provides the 773.87/297.03 certificate MAYBE. 773.87/297.03 773.87/297.03 Strict Trs: 773.87/297.03 { dbl(X) -> n__dbl(X) 773.87/297.03 , dbl(0()) -> 0() 773.87/297.03 , dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) 773.87/297.03 , s(X) -> n__s(X) 773.87/297.03 , activate(X) -> X 773.87/297.03 , activate(n__s(X)) -> s(X) 773.87/297.03 , activate(n__dbl(X)) -> dbl(X) 773.87/297.03 , activate(n__dbls(X)) -> dbls(X) 773.87/297.03 , activate(n__sel(X1, X2)) -> sel(X1, X2) 773.87/297.03 , activate(n__indx(X1, X2)) -> indx(X1, X2) 773.87/297.03 , activate(n__from(X)) -> from(X) 773.87/297.03 , dbls(X) -> n__dbls(X) 773.87/297.03 , dbls(nil()) -> nil() 773.87/297.03 , dbls(cons(X, Y)) -> 773.87/297.03 cons(n__dbl(activate(X)), n__dbls(activate(Y))) 773.87/297.03 , sel(X1, X2) -> n__sel(X1, X2) 773.87/297.03 , sel(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) 773.87/297.03 , indx(X1, X2) -> n__indx(X1, X2) 773.87/297.03 , indx(nil(), X) -> nil() 773.87/297.03 , indx(cons(X, Y), Z) -> 773.87/297.03 cons(n__sel(activate(X), activate(Z)), 773.87/297.03 n__indx(activate(Y), activate(Z))) 773.87/297.03 , from(X) -> cons(activate(X), n__from(n__s(activate(X)))) 773.87/297.03 , from(X) -> n__from(X) 773.87/297.03 , dbl1(0()) -> 01() 773.87/297.03 , dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) 773.87/297.03 , sel1(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) 773.87/297.03 , quote(dbl(X)) -> dbl1(X) 773.87/297.03 , quote(0()) -> 01() 773.87/297.03 , quote(s(X)) -> s1(quote(activate(X))) 773.87/297.03 , quote(sel(X, Y)) -> sel1(X, Y) } 773.87/297.03 Obligation: 773.87/297.03 runtime complexity 773.87/297.03 Answer: 773.87/297.03 MAYBE 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 773.87/297.03 following reason: 773.87/297.03 773.87/297.03 Computation stopped due to timeout after 297.0 seconds. 773.87/297.03 773.87/297.03 2) 'Best' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 773.87/297.03 seconds)' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'Fastest' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'empty' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 2) 'With Problem ...' failed due to the following reason: 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 2) 'Best' failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 773.87/297.03 to the following reason: 773.87/297.03 773.87/297.03 The processor is inapplicable, reason: 773.87/297.03 Processor only applicable for innermost runtime complexity analysis 773.87/297.03 773.87/297.03 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 773.87/297.03 following reason: 773.87/297.03 773.87/297.03 The processor is inapplicable, reason: 773.87/297.03 Processor only applicable for innermost runtime complexity analysis 773.87/297.03 773.87/297.03 773.87/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 773.87/297.03 failed due to the following reason: 773.87/297.03 773.87/297.03 None of the processors succeeded. 773.87/297.03 773.87/297.03 Details of failed attempt(s): 773.87/297.03 ----------------------------- 773.87/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 773.87/297.03 failed due to the following reason: 773.87/297.03 773.87/297.03 match-boundness of the problem could not be verified. 773.87/297.03 773.87/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 773.87/297.03 failed due to the following reason: 773.87/297.03 773.87/297.03 match-boundness of the problem could not be verified. 773.87/297.03 773.87/297.03 773.87/297.03 773.87/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 773.87/297.03 the following reason: 773.87/297.03 773.87/297.03 We add the following weak dependency pairs: 773.87/297.03 773.87/297.03 Strict DPs: 773.87/297.03 { dbl^#(X) -> c_1(X) 773.87/297.03 , dbl^#(0()) -> c_2() 773.87/297.03 , dbl^#(s(X)) -> c_3(s^#(n__s(n__dbl(activate(X))))) 773.87/297.03 , s^#(X) -> c_4(X) 773.87/297.03 , activate^#(X) -> c_5(X) 773.87/297.03 , activate^#(n__s(X)) -> c_6(s^#(X)) 773.87/297.03 , activate^#(n__dbl(X)) -> c_7(dbl^#(X)) 773.87/297.03 , activate^#(n__dbls(X)) -> c_8(dbls^#(X)) 773.87/297.03 , activate^#(n__sel(X1, X2)) -> c_9(sel^#(X1, X2)) 773.87/297.03 , activate^#(n__indx(X1, X2)) -> c_10(indx^#(X1, X2)) 773.87/297.03 , activate^#(n__from(X)) -> c_11(from^#(X)) 773.87/297.03 , dbls^#(X) -> c_12(X) 773.87/297.03 , dbls^#(nil()) -> c_13() 773.87/297.03 , dbls^#(cons(X, Y)) -> c_14(activate^#(X), activate^#(Y)) 773.87/297.03 , sel^#(X1, X2) -> c_15(X1, X2) 773.87/297.03 , sel^#(0(), cons(X, Y)) -> c_16(activate^#(X)) 773.87/297.03 , sel^#(s(X), cons(Y, Z)) -> c_17(sel^#(activate(X), activate(Z))) 773.87/297.03 , indx^#(X1, X2) -> c_18(X1, X2) 773.87/297.03 , indx^#(nil(), X) -> c_19() 773.87/297.03 , indx^#(cons(X, Y), Z) -> 773.87/297.03 c_20(activate^#(X), activate^#(Z), activate^#(Y), activate^#(Z)) 773.87/297.03 , from^#(X) -> c_21(activate^#(X), activate^#(X)) 773.87/297.03 , from^#(X) -> c_22(X) 773.87/297.03 , dbl1^#(0()) -> c_23() 773.87/297.03 , dbl1^#(s(X)) -> c_24(dbl1^#(activate(X))) 773.87/297.03 , sel1^#(0(), cons(X, Y)) -> c_25(activate^#(X)) 773.87/297.03 , sel1^#(s(X), cons(Y, Z)) -> 773.87/297.03 c_26(sel1^#(activate(X), activate(Z))) 773.87/297.03 , quote^#(dbl(X)) -> c_27(dbl1^#(X)) 773.87/297.03 , quote^#(0()) -> c_28() 773.87/297.03 , quote^#(s(X)) -> c_29(quote^#(activate(X))) 773.87/297.03 , quote^#(sel(X, Y)) -> c_30(sel1^#(X, Y)) } 773.87/297.03 773.87/297.03 and mark the set of starting terms. 773.87/297.03 773.87/297.03 We are left with following problem, upon which TcT provides the 773.87/297.03 certificate MAYBE. 773.87/297.03 773.87/297.03 Strict DPs: 773.87/297.03 { dbl^#(X) -> c_1(X) 773.87/297.03 , dbl^#(0()) -> c_2() 773.87/297.03 , dbl^#(s(X)) -> c_3(s^#(n__s(n__dbl(activate(X))))) 773.87/297.03 , s^#(X) -> c_4(X) 773.87/297.03 , activate^#(X) -> c_5(X) 773.87/297.03 , activate^#(n__s(X)) -> c_6(s^#(X)) 773.87/297.03 , activate^#(n__dbl(X)) -> c_7(dbl^#(X)) 773.87/297.03 , activate^#(n__dbls(X)) -> c_8(dbls^#(X)) 773.87/297.03 , activate^#(n__sel(X1, X2)) -> c_9(sel^#(X1, X2)) 773.87/297.03 , activate^#(n__indx(X1, X2)) -> c_10(indx^#(X1, X2)) 773.87/297.03 , activate^#(n__from(X)) -> c_11(from^#(X)) 773.87/297.03 , dbls^#(X) -> c_12(X) 773.87/297.03 , dbls^#(nil()) -> c_13() 773.87/297.03 , dbls^#(cons(X, Y)) -> c_14(activate^#(X), activate^#(Y)) 773.87/297.03 , sel^#(X1, X2) -> c_15(X1, X2) 773.87/297.03 , sel^#(0(), cons(X, Y)) -> c_16(activate^#(X)) 773.87/297.03 , sel^#(s(X), cons(Y, Z)) -> c_17(sel^#(activate(X), activate(Z))) 773.87/297.03 , indx^#(X1, X2) -> c_18(X1, X2) 773.87/297.03 , indx^#(nil(), X) -> c_19() 773.87/297.03 , indx^#(cons(X, Y), Z) -> 773.87/297.03 c_20(activate^#(X), activate^#(Z), activate^#(Y), activate^#(Z)) 773.87/297.03 , from^#(X) -> c_21(activate^#(X), activate^#(X)) 773.87/297.03 , from^#(X) -> c_22(X) 773.87/297.03 , dbl1^#(0()) -> c_23() 773.87/297.03 , dbl1^#(s(X)) -> c_24(dbl1^#(activate(X))) 773.87/297.03 , sel1^#(0(), cons(X, Y)) -> c_25(activate^#(X)) 773.87/297.03 , sel1^#(s(X), cons(Y, Z)) -> 773.87/297.03 c_26(sel1^#(activate(X), activate(Z))) 773.87/297.03 , quote^#(dbl(X)) -> c_27(dbl1^#(X)) 773.87/297.03 , quote^#(0()) -> c_28() 773.87/297.03 , quote^#(s(X)) -> c_29(quote^#(activate(X))) 773.87/297.03 , quote^#(sel(X, Y)) -> c_30(sel1^#(X, Y)) } 773.87/297.03 Strict Trs: 773.87/297.03 { dbl(X) -> n__dbl(X) 773.87/297.03 , dbl(0()) -> 0() 773.87/297.03 , dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) 773.87/297.03 , s(X) -> n__s(X) 773.87/297.03 , activate(X) -> X 773.87/297.03 , activate(n__s(X)) -> s(X) 773.87/297.03 , activate(n__dbl(X)) -> dbl(X) 773.87/297.03 , activate(n__dbls(X)) -> dbls(X) 773.87/297.03 , activate(n__sel(X1, X2)) -> sel(X1, X2) 773.87/297.03 , activate(n__indx(X1, X2)) -> indx(X1, X2) 773.87/297.03 , activate(n__from(X)) -> from(X) 773.87/297.03 , dbls(X) -> n__dbls(X) 773.87/297.03 , dbls(nil()) -> nil() 773.87/297.03 , dbls(cons(X, Y)) -> 773.87/297.03 cons(n__dbl(activate(X)), n__dbls(activate(Y))) 773.87/297.03 , sel(X1, X2) -> n__sel(X1, X2) 773.87/297.03 , sel(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) 773.87/297.03 , indx(X1, X2) -> n__indx(X1, X2) 773.87/297.03 , indx(nil(), X) -> nil() 773.87/297.03 , indx(cons(X, Y), Z) -> 773.87/297.03 cons(n__sel(activate(X), activate(Z)), 773.87/297.03 n__indx(activate(Y), activate(Z))) 773.87/297.03 , from(X) -> cons(activate(X), n__from(n__s(activate(X)))) 773.87/297.03 , from(X) -> n__from(X) 773.87/297.03 , dbl1(0()) -> 01() 773.87/297.03 , dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) 773.87/297.03 , sel1(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) 773.87/297.03 , quote(dbl(X)) -> dbl1(X) 773.87/297.03 , quote(0()) -> 01() 773.87/297.03 , quote(s(X)) -> s1(quote(activate(X))) 773.87/297.03 , quote(sel(X, Y)) -> sel1(X, Y) } 773.87/297.03 Obligation: 773.87/297.03 runtime complexity 773.87/297.03 Answer: 773.87/297.03 MAYBE 773.87/297.03 773.87/297.03 We estimate the number of application of {2,13,19,23,28} by 773.87/297.03 applications of Pre({2,13,19,23,28}) = 773.87/297.03 {1,4,5,7,8,10,12,15,18,22,24,27,29}. Here rules are labeled as 773.87/297.03 follows: 773.87/297.03 773.87/297.03 DPs: 773.87/297.03 { 1: dbl^#(X) -> c_1(X) 773.87/297.03 , 2: dbl^#(0()) -> c_2() 773.87/297.03 , 3: dbl^#(s(X)) -> c_3(s^#(n__s(n__dbl(activate(X))))) 773.87/297.03 , 4: s^#(X) -> c_4(X) 773.87/297.03 , 5: activate^#(X) -> c_5(X) 773.87/297.03 , 6: activate^#(n__s(X)) -> c_6(s^#(X)) 773.87/297.03 , 7: activate^#(n__dbl(X)) -> c_7(dbl^#(X)) 773.87/297.03 , 8: activate^#(n__dbls(X)) -> c_8(dbls^#(X)) 773.87/297.03 , 9: activate^#(n__sel(X1, X2)) -> c_9(sel^#(X1, X2)) 773.87/297.03 , 10: activate^#(n__indx(X1, X2)) -> c_10(indx^#(X1, X2)) 773.87/297.03 , 11: activate^#(n__from(X)) -> c_11(from^#(X)) 773.87/297.03 , 12: dbls^#(X) -> c_12(X) 773.87/297.03 , 13: dbls^#(nil()) -> c_13() 773.87/297.03 , 14: dbls^#(cons(X, Y)) -> c_14(activate^#(X), activate^#(Y)) 773.87/297.03 , 15: sel^#(X1, X2) -> c_15(X1, X2) 773.87/297.03 , 16: sel^#(0(), cons(X, Y)) -> c_16(activate^#(X)) 773.87/297.03 , 17: sel^#(s(X), cons(Y, Z)) -> 773.87/297.03 c_17(sel^#(activate(X), activate(Z))) 773.87/297.03 , 18: indx^#(X1, X2) -> c_18(X1, X2) 773.87/297.03 , 19: indx^#(nil(), X) -> c_19() 773.87/297.03 , 20: indx^#(cons(X, Y), Z) -> 773.87/297.03 c_20(activate^#(X), activate^#(Z), activate^#(Y), activate^#(Z)) 773.87/297.03 , 21: from^#(X) -> c_21(activate^#(X), activate^#(X)) 773.87/297.03 , 22: from^#(X) -> c_22(X) 773.87/297.03 , 23: dbl1^#(0()) -> c_23() 773.87/297.03 , 24: dbl1^#(s(X)) -> c_24(dbl1^#(activate(X))) 773.87/297.03 , 25: sel1^#(0(), cons(X, Y)) -> c_25(activate^#(X)) 773.87/297.03 , 26: sel1^#(s(X), cons(Y, Z)) -> 773.87/297.03 c_26(sel1^#(activate(X), activate(Z))) 773.87/297.03 , 27: quote^#(dbl(X)) -> c_27(dbl1^#(X)) 773.87/297.03 , 28: quote^#(0()) -> c_28() 773.87/297.03 , 29: quote^#(s(X)) -> c_29(quote^#(activate(X))) 773.87/297.03 , 30: quote^#(sel(X, Y)) -> c_30(sel1^#(X, Y)) } 773.87/297.03 773.87/297.03 We are left with following problem, upon which TcT provides the 773.87/297.03 certificate MAYBE. 773.87/297.03 773.87/297.03 Strict DPs: 773.87/297.03 { dbl^#(X) -> c_1(X) 773.87/297.03 , dbl^#(s(X)) -> c_3(s^#(n__s(n__dbl(activate(X))))) 773.87/297.03 , s^#(X) -> c_4(X) 773.87/297.03 , activate^#(X) -> c_5(X) 773.87/297.03 , activate^#(n__s(X)) -> c_6(s^#(X)) 773.87/297.03 , activate^#(n__dbl(X)) -> c_7(dbl^#(X)) 773.87/297.03 , activate^#(n__dbls(X)) -> c_8(dbls^#(X)) 773.87/297.03 , activate^#(n__sel(X1, X2)) -> c_9(sel^#(X1, X2)) 773.87/297.03 , activate^#(n__indx(X1, X2)) -> c_10(indx^#(X1, X2)) 773.87/297.03 , activate^#(n__from(X)) -> c_11(from^#(X)) 773.87/297.03 , dbls^#(X) -> c_12(X) 773.87/297.03 , dbls^#(cons(X, Y)) -> c_14(activate^#(X), activate^#(Y)) 773.87/297.03 , sel^#(X1, X2) -> c_15(X1, X2) 773.87/297.03 , sel^#(0(), cons(X, Y)) -> c_16(activate^#(X)) 773.87/297.03 , sel^#(s(X), cons(Y, Z)) -> c_17(sel^#(activate(X), activate(Z))) 773.87/297.03 , indx^#(X1, X2) -> c_18(X1, X2) 773.87/297.03 , indx^#(cons(X, Y), Z) -> 773.87/297.03 c_20(activate^#(X), activate^#(Z), activate^#(Y), activate^#(Z)) 773.87/297.03 , from^#(X) -> c_21(activate^#(X), activate^#(X)) 773.87/297.03 , from^#(X) -> c_22(X) 773.87/297.03 , dbl1^#(s(X)) -> c_24(dbl1^#(activate(X))) 773.87/297.03 , sel1^#(0(), cons(X, Y)) -> c_25(activate^#(X)) 773.87/297.03 , sel1^#(s(X), cons(Y, Z)) -> 773.87/297.03 c_26(sel1^#(activate(X), activate(Z))) 773.87/297.03 , quote^#(dbl(X)) -> c_27(dbl1^#(X)) 773.87/297.03 , quote^#(s(X)) -> c_29(quote^#(activate(X))) 773.87/297.03 , quote^#(sel(X, Y)) -> c_30(sel1^#(X, Y)) } 773.87/297.03 Strict Trs: 773.87/297.03 { dbl(X) -> n__dbl(X) 773.87/297.03 , dbl(0()) -> 0() 773.87/297.03 , dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) 773.87/297.03 , s(X) -> n__s(X) 773.87/297.03 , activate(X) -> X 773.87/297.03 , activate(n__s(X)) -> s(X) 773.87/297.03 , activate(n__dbl(X)) -> dbl(X) 773.87/297.03 , activate(n__dbls(X)) -> dbls(X) 773.87/297.03 , activate(n__sel(X1, X2)) -> sel(X1, X2) 773.87/297.03 , activate(n__indx(X1, X2)) -> indx(X1, X2) 773.87/297.03 , activate(n__from(X)) -> from(X) 773.87/297.03 , dbls(X) -> n__dbls(X) 773.87/297.03 , dbls(nil()) -> nil() 773.87/297.03 , dbls(cons(X, Y)) -> 773.87/297.03 cons(n__dbl(activate(X)), n__dbls(activate(Y))) 773.87/297.03 , sel(X1, X2) -> n__sel(X1, X2) 773.87/297.03 , sel(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) 773.87/297.03 , indx(X1, X2) -> n__indx(X1, X2) 773.87/297.03 , indx(nil(), X) -> nil() 773.87/297.03 , indx(cons(X, Y), Z) -> 773.87/297.03 cons(n__sel(activate(X), activate(Z)), 773.87/297.03 n__indx(activate(Y), activate(Z))) 773.87/297.03 , from(X) -> cons(activate(X), n__from(n__s(activate(X)))) 773.87/297.03 , from(X) -> n__from(X) 773.87/297.03 , dbl1(0()) -> 01() 773.87/297.03 , dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) 773.87/297.03 , sel1(0(), cons(X, Y)) -> activate(X) 773.87/297.03 , sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) 773.87/297.03 , quote(dbl(X)) -> dbl1(X) 773.87/297.03 , quote(0()) -> 01() 773.87/297.03 , quote(s(X)) -> s1(quote(activate(X))) 773.87/297.03 , quote(sel(X, Y)) -> sel1(X, Y) } 773.87/297.03 Weak DPs: 773.87/297.03 { dbl^#(0()) -> c_2() 773.87/297.03 , dbls^#(nil()) -> c_13() 773.87/297.03 , indx^#(nil(), X) -> c_19() 773.87/297.03 , dbl1^#(0()) -> c_23() 773.87/297.03 , quote^#(0()) -> c_28() } 773.87/297.03 Obligation: 773.87/297.03 runtime complexity 773.87/297.03 Answer: 773.87/297.03 MAYBE 773.87/297.03 773.87/297.03 Empty strict component of the problem is NOT empty. 773.87/297.03 773.87/297.03 773.87/297.03 Arrrr.. 773.99/297.12 EOF