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