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