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