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