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