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