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