MAYBE 582.69/154.69 MAYBE 582.69/154.69 582.69/154.69 We are left with following problem, upon which TcT provides the 582.69/154.69 certificate MAYBE. 582.69/154.69 582.69/154.69 Strict Trs: 582.69/154.69 { top(free(x)) -> top(check(new(x))) 582.69/154.69 , check(free(x)) -> free(check(x)) 582.69/154.69 , check(new(x)) -> new(check(x)) 582.69/154.69 , check(old(x)) -> old(x) 582.69/154.69 , check(old(x)) -> old(check(x)) 582.69/154.69 , new(free(x)) -> free(new(x)) 582.69/154.69 , new(serve()) -> free(serve()) 582.69/154.69 , old(free(x)) -> free(old(x)) 582.69/154.69 , old(serve()) -> free(serve()) } 582.69/154.69 Obligation: 582.69/154.69 runtime complexity 582.69/154.69 Answer: 582.69/154.69 MAYBE 582.69/154.69 582.69/154.69 None of the processors succeeded. 582.69/154.69 582.69/154.69 Details of failed attempt(s): 582.69/154.69 ----------------------------- 582.69/154.69 1) 'Best' failed due to the following reason: 582.69/154.69 582.69/154.69 None of the processors succeeded. 582.69/154.69 582.69/154.69 Details of failed attempt(s): 582.69/154.69 ----------------------------- 582.69/154.69 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 582.69/154.69 seconds)' failed due to the following reason: 582.69/154.69 582.69/154.69 Computation stopped due to timeout after 148.0 seconds. 582.69/154.69 582.69/154.69 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 582.69/154.69 failed due to the following reason: 582.69/154.69 582.69/154.69 Computation stopped due to timeout after 24.0 seconds. 582.69/154.69 582.69/154.69 3) 'Best' failed due to the following reason: 582.69/154.69 582.69/154.69 None of the processors succeeded. 582.69/154.69 582.69/154.69 Details of failed attempt(s): 582.69/154.69 ----------------------------- 582.69/154.69 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 582.69/154.69 following reason: 582.69/154.69 582.69/154.69 The processor is inapplicable, reason: 582.69/154.69 Processor only applicable for innermost runtime complexity analysis 582.69/154.69 582.69/154.69 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 582.69/154.69 to the following reason: 582.69/154.69 582.69/154.69 The processor is inapplicable, reason: 582.69/154.69 Processor only applicable for innermost runtime complexity analysis 582.69/154.69 582.69/154.69 582.69/154.69 582.69/154.69 2) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 582.69/154.69 the following reason: 582.69/154.69 582.69/154.69 We add the following weak dependency pairs: 582.69/154.69 582.69/154.69 Strict DPs: 582.69/154.69 { top^#(free(x)) -> c_1(top^#(check(new(x)))) 582.69/154.69 , check^#(free(x)) -> c_2(check^#(x)) 582.69/154.69 , check^#(new(x)) -> c_3(new^#(check(x))) 582.69/154.69 , check^#(old(x)) -> c_4(old^#(x)) 582.69/154.69 , check^#(old(x)) -> c_5(old^#(check(x))) 582.69/154.69 , new^#(free(x)) -> c_6(new^#(x)) 582.69/154.69 , new^#(serve()) -> c_7() 582.69/154.69 , old^#(free(x)) -> c_8(old^#(x)) 582.69/154.69 , old^#(serve()) -> c_9() } 582.69/154.69 582.69/154.69 and mark the set of starting terms. 582.69/154.69 582.69/154.69 We are left with following problem, upon which TcT provides the 582.69/154.69 certificate MAYBE. 582.69/154.69 582.69/154.69 Strict DPs: 582.69/154.69 { top^#(free(x)) -> c_1(top^#(check(new(x)))) 582.69/154.69 , check^#(free(x)) -> c_2(check^#(x)) 582.69/154.69 , check^#(new(x)) -> c_3(new^#(check(x))) 582.69/154.69 , check^#(old(x)) -> c_4(old^#(x)) 582.69/154.69 , check^#(old(x)) -> c_5(old^#(check(x))) 582.69/154.69 , new^#(free(x)) -> c_6(new^#(x)) 582.69/154.69 , new^#(serve()) -> c_7() 582.69/154.69 , old^#(free(x)) -> c_8(old^#(x)) 582.69/154.69 , old^#(serve()) -> c_9() } 582.69/154.69 Strict Trs: 582.69/154.69 { top(free(x)) -> top(check(new(x))) 582.69/154.69 , check(free(x)) -> free(check(x)) 582.69/154.69 , check(new(x)) -> new(check(x)) 582.69/154.69 , check(old(x)) -> old(x) 582.69/154.69 , check(old(x)) -> old(check(x)) 582.69/154.69 , new(free(x)) -> free(new(x)) 582.69/154.69 , new(serve()) -> free(serve()) 582.69/154.69 , old(free(x)) -> free(old(x)) 582.69/154.69 , old(serve()) -> free(serve()) } 582.69/154.69 Obligation: 582.69/154.69 runtime complexity 582.69/154.69 Answer: 582.69/154.69 MAYBE 582.69/154.69 582.69/154.69 We estimate the number of application of {7,9} by applications of 582.69/154.69 Pre({7,9}) = {4,6,8}. Here rules are labeled as follows: 582.69/154.69 582.69/154.69 DPs: 582.69/154.69 { 1: top^#(free(x)) -> c_1(top^#(check(new(x)))) 582.69/154.69 , 2: check^#(free(x)) -> c_2(check^#(x)) 582.69/154.69 , 3: check^#(new(x)) -> c_3(new^#(check(x))) 582.69/154.69 , 4: check^#(old(x)) -> c_4(old^#(x)) 582.69/154.69 , 5: check^#(old(x)) -> c_5(old^#(check(x))) 582.69/154.69 , 6: new^#(free(x)) -> c_6(new^#(x)) 582.69/154.69 , 7: new^#(serve()) -> c_7() 582.69/154.69 , 8: old^#(free(x)) -> c_8(old^#(x)) 582.69/154.69 , 9: old^#(serve()) -> c_9() } 582.69/154.69 582.69/154.69 We are left with following problem, upon which TcT provides the 582.69/154.69 certificate MAYBE. 582.69/154.69 582.69/154.69 Strict DPs: 582.69/154.69 { top^#(free(x)) -> c_1(top^#(check(new(x)))) 582.69/154.69 , check^#(free(x)) -> c_2(check^#(x)) 582.69/154.69 , check^#(new(x)) -> c_3(new^#(check(x))) 582.69/154.69 , check^#(old(x)) -> c_4(old^#(x)) 582.69/154.69 , check^#(old(x)) -> c_5(old^#(check(x))) 582.69/154.69 , new^#(free(x)) -> c_6(new^#(x)) 582.69/154.69 , old^#(free(x)) -> c_8(old^#(x)) } 582.69/154.69 Strict Trs: 582.69/154.69 { top(free(x)) -> top(check(new(x))) 582.69/154.69 , check(free(x)) -> free(check(x)) 582.69/154.69 , check(new(x)) -> new(check(x)) 582.69/154.69 , check(old(x)) -> old(x) 582.69/154.69 , check(old(x)) -> old(check(x)) 582.69/154.69 , new(free(x)) -> free(new(x)) 582.69/154.69 , new(serve()) -> free(serve()) 582.69/154.69 , old(free(x)) -> free(old(x)) 582.69/154.69 , old(serve()) -> free(serve()) } 582.69/154.69 Weak DPs: 582.69/154.69 { new^#(serve()) -> c_7() 582.69/154.69 , old^#(serve()) -> c_9() } 582.69/154.69 Obligation: 582.69/154.69 runtime complexity 582.69/154.69 Answer: 582.69/154.69 MAYBE 582.69/154.69 582.69/154.69 Empty strict component of the problem is NOT empty. 582.69/154.69 582.69/154.69 582.69/154.69 Arrrr.. 583.11/154.99 EOF