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