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