MAYBE 813.98/297.03 MAYBE 813.98/297.03 813.98/297.03 We are left with following problem, upon which TcT provides the 813.98/297.03 certificate MAYBE. 813.98/297.03 813.98/297.03 Strict Trs: 813.98/297.03 { min(x, 0()) -> 0() 813.98/297.03 , min(0(), y) -> 0() 813.98/297.03 , min(s(x), s(y)) -> s(min(x, y)) 813.98/297.03 , max(x, 0()) -> x 813.98/297.03 , max(0(), y) -> y 813.98/297.03 , max(s(x), s(y)) -> s(max(x, y)) 813.98/297.03 , +(0(), y) -> y 813.98/297.03 , +(s(x), y) -> s(+(x, y)) 813.98/297.03 , -(x, 0()) -> x 813.98/297.03 , -(s(x), s(y)) -> -(x, y) 813.98/297.03 , *(x, 0()) -> 0() 813.98/297.03 , *(x, s(y)) -> +(x, *(x, y)) 813.98/297.03 , p(s(x)) -> x 813.98/297.03 , f(s(x), s(y)) -> 813.98/297.03 f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) } 813.98/297.03 Obligation: 813.98/297.03 runtime complexity 813.98/297.03 Answer: 813.98/297.03 MAYBE 813.98/297.03 813.98/297.03 None of the processors succeeded. 813.98/297.03 813.98/297.03 Details of failed attempt(s): 813.98/297.03 ----------------------------- 813.98/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 813.98/297.03 following reason: 813.98/297.03 813.98/297.03 Computation stopped due to timeout after 297.0 seconds. 813.98/297.03 813.98/297.03 2) 'Best' failed due to the following reason: 813.98/297.03 813.98/297.03 None of the processors succeeded. 813.98/297.03 813.98/297.03 Details of failed attempt(s): 813.98/297.03 ----------------------------- 813.98/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 813.98/297.03 seconds)' failed due to the following reason: 813.98/297.03 813.98/297.03 Computation stopped due to timeout after 148.0 seconds. 813.98/297.03 813.98/297.03 2) 'Best' failed due to the following reason: 813.98/297.03 813.98/297.03 None of the processors succeeded. 813.98/297.03 813.98/297.03 Details of failed attempt(s): 813.98/297.03 ----------------------------- 813.98/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 813.98/297.03 following reason: 813.98/297.03 813.98/297.03 The processor is inapplicable, reason: 813.98/297.03 Processor only applicable for innermost runtime complexity analysis 813.98/297.03 813.98/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 813.98/297.03 to the following reason: 813.98/297.03 813.98/297.03 The processor is inapplicable, reason: 813.98/297.03 Processor only applicable for innermost runtime complexity analysis 813.98/297.03 813.98/297.03 813.98/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 813.98/297.03 failed due to the following reason: 813.98/297.03 813.98/297.03 None of the processors succeeded. 813.98/297.03 813.98/297.03 Details of failed attempt(s): 813.98/297.03 ----------------------------- 813.98/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 813.98/297.03 failed due to the following reason: 813.98/297.03 813.98/297.03 match-boundness of the problem could not be verified. 813.98/297.03 813.98/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 813.98/297.03 failed due to the following reason: 813.98/297.03 813.98/297.03 match-boundness of the problem could not be verified. 813.98/297.03 813.98/297.03 813.98/297.03 813.98/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 813.98/297.03 the following reason: 813.98/297.03 813.98/297.03 We add the following weak dependency pairs: 813.98/297.03 813.98/297.03 Strict DPs: 813.98/297.03 { min^#(x, 0()) -> c_1() 813.98/297.03 , min^#(0(), y) -> c_2() 813.98/297.03 , min^#(s(x), s(y)) -> c_3(min^#(x, y)) 813.98/297.03 , max^#(x, 0()) -> c_4(x) 813.98/297.03 , max^#(0(), y) -> c_5(y) 813.98/297.03 , max^#(s(x), s(y)) -> c_6(max^#(x, y)) 813.98/297.03 , +^#(0(), y) -> c_7(y) 813.98/297.03 , +^#(s(x), y) -> c_8(+^#(x, y)) 813.98/297.03 , -^#(x, 0()) -> c_9(x) 813.98/297.03 , -^#(s(x), s(y)) -> c_10(-^#(x, y)) 813.98/297.03 , *^#(x, 0()) -> c_11() 813.98/297.03 , *^#(x, s(y)) -> c_12(+^#(x, *(x, y))) 813.98/297.03 , p^#(s(x)) -> c_13(x) 813.98/297.03 , f^#(s(x), s(y)) -> 813.98/297.03 c_14(f^#(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y)))) } 813.98/297.03 813.98/297.03 and mark the set of starting terms. 813.98/297.03 813.98/297.03 We are left with following problem, upon which TcT provides the 813.98/297.03 certificate MAYBE. 813.98/297.03 813.98/297.03 Strict DPs: 813.98/297.03 { min^#(x, 0()) -> c_1() 813.98/297.03 , min^#(0(), y) -> c_2() 813.98/297.03 , min^#(s(x), s(y)) -> c_3(min^#(x, y)) 813.98/297.03 , max^#(x, 0()) -> c_4(x) 813.98/297.03 , max^#(0(), y) -> c_5(y) 813.98/297.03 , max^#(s(x), s(y)) -> c_6(max^#(x, y)) 813.98/297.03 , +^#(0(), y) -> c_7(y) 813.98/297.03 , +^#(s(x), y) -> c_8(+^#(x, y)) 813.98/297.03 , -^#(x, 0()) -> c_9(x) 813.98/297.03 , -^#(s(x), s(y)) -> c_10(-^#(x, y)) 813.98/297.03 , *^#(x, 0()) -> c_11() 813.98/297.03 , *^#(x, s(y)) -> c_12(+^#(x, *(x, y))) 813.98/297.03 , p^#(s(x)) -> c_13(x) 813.98/297.03 , f^#(s(x), s(y)) -> 813.98/297.03 c_14(f^#(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y)))) } 813.98/297.03 Strict Trs: 813.98/297.03 { min(x, 0()) -> 0() 813.98/297.03 , min(0(), y) -> 0() 813.98/297.03 , min(s(x), s(y)) -> s(min(x, y)) 813.98/297.03 , max(x, 0()) -> x 813.98/297.03 , max(0(), y) -> y 813.98/297.03 , max(s(x), s(y)) -> s(max(x, y)) 813.98/297.03 , +(0(), y) -> y 813.98/297.03 , +(s(x), y) -> s(+(x, y)) 813.98/297.03 , -(x, 0()) -> x 813.98/297.03 , -(s(x), s(y)) -> -(x, y) 813.98/297.03 , *(x, 0()) -> 0() 813.98/297.03 , *(x, s(y)) -> +(x, *(x, y)) 813.98/297.03 , p(s(x)) -> x 813.98/297.03 , f(s(x), s(y)) -> 813.98/297.03 f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) } 813.98/297.03 Obligation: 813.98/297.03 runtime complexity 813.98/297.03 Answer: 813.98/297.03 MAYBE 813.98/297.03 813.98/297.03 We estimate the number of application of {1,2,11} by applications 813.98/297.03 of Pre({1,2,11}) = {3,4,5,7,9,13}. Here rules are labeled as 813.98/297.03 follows: 813.98/297.03 813.98/297.03 DPs: 813.98/297.03 { 1: min^#(x, 0()) -> c_1() 813.98/297.03 , 2: min^#(0(), y) -> c_2() 813.98/297.03 , 3: min^#(s(x), s(y)) -> c_3(min^#(x, y)) 813.98/297.03 , 4: max^#(x, 0()) -> c_4(x) 813.98/297.03 , 5: max^#(0(), y) -> c_5(y) 813.98/297.03 , 6: max^#(s(x), s(y)) -> c_6(max^#(x, y)) 813.98/297.03 , 7: +^#(0(), y) -> c_7(y) 813.98/297.03 , 8: +^#(s(x), y) -> c_8(+^#(x, y)) 813.98/297.03 , 9: -^#(x, 0()) -> c_9(x) 813.98/297.03 , 10: -^#(s(x), s(y)) -> c_10(-^#(x, y)) 813.98/297.03 , 11: *^#(x, 0()) -> c_11() 813.98/297.03 , 12: *^#(x, s(y)) -> c_12(+^#(x, *(x, y))) 813.98/297.03 , 13: p^#(s(x)) -> c_13(x) 813.98/297.03 , 14: f^#(s(x), s(y)) -> 813.98/297.03 c_14(f^#(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y)))) } 813.98/297.03 813.98/297.03 We are left with following problem, upon which TcT provides the 813.98/297.03 certificate MAYBE. 813.98/297.03 813.98/297.03 Strict DPs: 813.98/297.03 { min^#(s(x), s(y)) -> c_3(min^#(x, y)) 813.98/297.03 , max^#(x, 0()) -> c_4(x) 813.98/297.03 , max^#(0(), y) -> c_5(y) 813.98/297.03 , max^#(s(x), s(y)) -> c_6(max^#(x, y)) 813.98/297.03 , +^#(0(), y) -> c_7(y) 813.98/297.03 , +^#(s(x), y) -> c_8(+^#(x, y)) 813.98/297.03 , -^#(x, 0()) -> c_9(x) 813.98/297.03 , -^#(s(x), s(y)) -> c_10(-^#(x, y)) 813.98/297.03 , *^#(x, s(y)) -> c_12(+^#(x, *(x, y))) 813.98/297.03 , p^#(s(x)) -> c_13(x) 813.98/297.03 , f^#(s(x), s(y)) -> 813.98/297.03 c_14(f^#(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y)))) } 813.98/297.03 Strict Trs: 813.98/297.03 { min(x, 0()) -> 0() 813.98/297.03 , min(0(), y) -> 0() 813.98/297.03 , min(s(x), s(y)) -> s(min(x, y)) 813.98/297.03 , max(x, 0()) -> x 813.98/297.03 , max(0(), y) -> y 813.98/297.03 , max(s(x), s(y)) -> s(max(x, y)) 813.98/297.03 , +(0(), y) -> y 813.98/297.03 , +(s(x), y) -> s(+(x, y)) 813.98/297.03 , -(x, 0()) -> x 813.98/297.03 , -(s(x), s(y)) -> -(x, y) 813.98/297.03 , *(x, 0()) -> 0() 813.98/297.03 , *(x, s(y)) -> +(x, *(x, y)) 813.98/297.03 , p(s(x)) -> x 813.98/297.03 , f(s(x), s(y)) -> 813.98/297.03 f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) } 813.98/297.03 Weak DPs: 813.98/297.03 { min^#(x, 0()) -> c_1() 813.98/297.03 , min^#(0(), y) -> c_2() 813.98/297.03 , *^#(x, 0()) -> c_11() } 813.98/297.03 Obligation: 813.98/297.03 runtime complexity 813.98/297.03 Answer: 813.98/297.03 MAYBE 813.98/297.03 813.98/297.03 Empty strict component of the problem is NOT empty. 813.98/297.03 813.98/297.03 813.98/297.03 Arrrr.. 814.19/297.28 EOF