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