MAYBE 862.22/297.02 MAYBE 862.22/297.02 862.22/297.02 We are left with following problem, upon which TcT provides the 862.22/297.02 certificate MAYBE. 862.22/297.02 862.22/297.02 Strict Trs: 862.22/297.02 { from(X) -> cons(X, n__from(n__s(X))) 862.22/297.02 , from(X) -> n__from(X) 862.22/297.02 , first(X1, X2) -> n__first(X1, X2) 862.22/297.02 , first(0(), Z) -> nil() 862.22/297.02 , first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) 862.22/297.02 , s(X) -> n__s(X) 862.22/297.02 , activate(X) -> X 862.22/297.02 , activate(n__from(X)) -> from(activate(X)) 862.22/297.02 , activate(n__s(X)) -> s(activate(X)) 862.22/297.02 , activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) 862.22/297.02 , sel(0(), cons(X, Z)) -> X 862.22/297.02 , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) } 862.22/297.02 Obligation: 862.22/297.02 runtime complexity 862.22/297.02 Answer: 862.22/297.02 MAYBE 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 862.22/297.02 following reason: 862.22/297.02 862.22/297.02 Computation stopped due to timeout after 297.0 seconds. 862.22/297.02 862.22/297.02 2) 'Best' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 862.22/297.02 seconds)' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'Fastest' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'empty' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 2) 'With Problem ...' failed due to the following reason: 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 2) 'Best' failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 862.22/297.02 following reason: 862.22/297.02 862.22/297.02 The processor is inapplicable, reason: 862.22/297.02 Processor only applicable for innermost runtime complexity analysis 862.22/297.02 862.22/297.02 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 862.22/297.02 to the following reason: 862.22/297.02 862.22/297.02 The processor is inapplicable, reason: 862.22/297.02 Processor only applicable for innermost runtime complexity analysis 862.22/297.02 862.22/297.02 862.22/297.02 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 862.22/297.02 failed due to the following reason: 862.22/297.02 862.22/297.02 None of the processors succeeded. 862.22/297.02 862.22/297.02 Details of failed attempt(s): 862.22/297.02 ----------------------------- 862.22/297.02 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 862.22/297.02 failed due to the following reason: 862.22/297.02 862.22/297.02 match-boundness of the problem could not be verified. 862.22/297.02 862.22/297.02 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 862.22/297.02 failed due to the following reason: 862.22/297.02 862.22/297.02 match-boundness of the problem could not be verified. 862.22/297.02 862.22/297.02 862.22/297.02 862.22/297.02 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 862.22/297.02 the following reason: 862.22/297.02 862.22/297.02 We add the following weak dependency pairs: 862.22/297.02 862.22/297.02 Strict DPs: 862.22/297.02 { from^#(X) -> c_1(X, X) 862.22/297.02 , from^#(X) -> c_2(X) 862.22/297.02 , first^#(X1, X2) -> c_3(X1, X2) 862.22/297.02 , first^#(0(), Z) -> c_4() 862.22/297.02 , first^#(s(X), cons(Y, Z)) -> c_5(Y, X, activate^#(Z)) 862.22/297.02 , activate^#(X) -> c_7(X) 862.22/297.02 , activate^#(n__from(X)) -> c_8(from^#(activate(X))) 862.22/297.02 , activate^#(n__s(X)) -> c_9(s^#(activate(X))) 862.22/297.02 , activate^#(n__first(X1, X2)) -> 862.22/297.02 c_10(first^#(activate(X1), activate(X2))) 862.22/297.02 , s^#(X) -> c_6(X) 862.22/297.02 , sel^#(0(), cons(X, Z)) -> c_11(X) 862.22/297.02 , sel^#(s(X), cons(Y, Z)) -> c_12(sel^#(X, activate(Z))) } 862.22/297.02 862.22/297.02 and mark the set of starting terms. 862.22/297.02 862.22/297.02 We are left with following problem, upon which TcT provides the 862.22/297.02 certificate MAYBE. 862.22/297.02 862.22/297.02 Strict DPs: 862.22/297.02 { from^#(X) -> c_1(X, X) 862.22/297.02 , from^#(X) -> c_2(X) 862.22/297.02 , first^#(X1, X2) -> c_3(X1, X2) 862.22/297.02 , first^#(0(), Z) -> c_4() 862.22/297.02 , first^#(s(X), cons(Y, Z)) -> c_5(Y, X, activate^#(Z)) 862.22/297.02 , activate^#(X) -> c_7(X) 862.22/297.02 , activate^#(n__from(X)) -> c_8(from^#(activate(X))) 862.22/297.02 , activate^#(n__s(X)) -> c_9(s^#(activate(X))) 862.22/297.02 , activate^#(n__first(X1, X2)) -> 862.22/297.02 c_10(first^#(activate(X1), activate(X2))) 862.22/297.02 , s^#(X) -> c_6(X) 862.22/297.02 , sel^#(0(), cons(X, Z)) -> c_11(X) 862.22/297.02 , sel^#(s(X), cons(Y, Z)) -> c_12(sel^#(X, activate(Z))) } 862.22/297.02 Strict Trs: 862.22/297.02 { from(X) -> cons(X, n__from(n__s(X))) 862.22/297.02 , from(X) -> n__from(X) 862.22/297.02 , first(X1, X2) -> n__first(X1, X2) 862.22/297.02 , first(0(), Z) -> nil() 862.22/297.02 , first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) 862.22/297.02 , s(X) -> n__s(X) 862.22/297.02 , activate(X) -> X 862.22/297.02 , activate(n__from(X)) -> from(activate(X)) 862.22/297.02 , activate(n__s(X)) -> s(activate(X)) 862.22/297.02 , activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) 862.22/297.02 , sel(0(), cons(X, Z)) -> X 862.22/297.02 , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) } 862.22/297.02 Obligation: 862.22/297.02 runtime complexity 862.22/297.02 Answer: 862.22/297.02 MAYBE 862.22/297.02 862.22/297.02 We estimate the number of application of {4} by applications of 862.22/297.02 Pre({4}) = {1,2,3,5,6,9,10,11}. Here rules are labeled as follows: 862.22/297.02 862.22/297.02 DPs: 862.22/297.02 { 1: from^#(X) -> c_1(X, X) 862.22/297.02 , 2: from^#(X) -> c_2(X) 862.22/297.02 , 3: first^#(X1, X2) -> c_3(X1, X2) 862.22/297.02 , 4: first^#(0(), Z) -> c_4() 862.22/297.02 , 5: first^#(s(X), cons(Y, Z)) -> c_5(Y, X, activate^#(Z)) 862.22/297.02 , 6: activate^#(X) -> c_7(X) 862.22/297.02 , 7: activate^#(n__from(X)) -> c_8(from^#(activate(X))) 862.22/297.02 , 8: activate^#(n__s(X)) -> c_9(s^#(activate(X))) 862.22/297.02 , 9: activate^#(n__first(X1, X2)) -> 862.22/297.02 c_10(first^#(activate(X1), activate(X2))) 862.22/297.02 , 10: s^#(X) -> c_6(X) 862.22/297.02 , 11: sel^#(0(), cons(X, Z)) -> c_11(X) 862.22/297.02 , 12: sel^#(s(X), cons(Y, Z)) -> c_12(sel^#(X, activate(Z))) } 862.22/297.02 862.22/297.02 We are left with following problem, upon which TcT provides the 862.22/297.02 certificate MAYBE. 862.22/297.02 862.22/297.02 Strict DPs: 862.22/297.02 { from^#(X) -> c_1(X, X) 862.22/297.02 , from^#(X) -> c_2(X) 862.22/297.02 , first^#(X1, X2) -> c_3(X1, X2) 862.22/297.02 , first^#(s(X), cons(Y, Z)) -> c_5(Y, X, activate^#(Z)) 862.22/297.02 , activate^#(X) -> c_7(X) 862.22/297.02 , activate^#(n__from(X)) -> c_8(from^#(activate(X))) 862.22/297.02 , activate^#(n__s(X)) -> c_9(s^#(activate(X))) 862.22/297.02 , activate^#(n__first(X1, X2)) -> 862.22/297.02 c_10(first^#(activate(X1), activate(X2))) 862.22/297.02 , s^#(X) -> c_6(X) 862.22/297.02 , sel^#(0(), cons(X, Z)) -> c_11(X) 862.22/297.02 , sel^#(s(X), cons(Y, Z)) -> c_12(sel^#(X, activate(Z))) } 862.22/297.02 Strict Trs: 862.22/297.02 { from(X) -> cons(X, n__from(n__s(X))) 862.22/297.02 , from(X) -> n__from(X) 862.22/297.02 , first(X1, X2) -> n__first(X1, X2) 862.22/297.02 , first(0(), Z) -> nil() 862.22/297.02 , first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) 862.22/297.02 , s(X) -> n__s(X) 862.22/297.02 , activate(X) -> X 862.22/297.02 , activate(n__from(X)) -> from(activate(X)) 862.22/297.02 , activate(n__s(X)) -> s(activate(X)) 862.22/297.02 , activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) 862.22/297.02 , sel(0(), cons(X, Z)) -> X 862.22/297.02 , sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) } 862.22/297.02 Weak DPs: { first^#(0(), Z) -> c_4() } 862.22/297.02 Obligation: 862.22/297.02 runtime complexity 862.22/297.02 Answer: 862.22/297.02 MAYBE 862.22/297.02 862.22/297.02 Empty strict component of the problem is NOT empty. 862.22/297.02 862.22/297.02 862.22/297.02 Arrrr.. 862.43/297.27 EOF