MAYBE 1014.93/297.85 MAYBE 1014.93/297.85 1014.93/297.85 We are left with following problem, upon which TcT provides the 1014.93/297.85 certificate MAYBE. 1014.93/297.85 1014.93/297.85 Strict Trs: 1014.93/297.85 { max(nil()) -> 0() 1014.93/297.85 , max(cons(x, nil())) -> x 1014.93/297.85 , max(cons(x, cons(y, xs))) -> if1(ge(x, y), x, y, xs) 1014.93/297.85 , if1(true(), x, y, xs) -> max(cons(x, xs)) 1014.93/297.85 , if1(false(), x, y, xs) -> max(cons(y, xs)) 1014.93/297.85 , ge(x, 0()) -> true() 1014.93/297.85 , ge(0(), s(x)) -> false() 1014.93/297.85 , ge(s(x), s(y)) -> ge(x, y) 1014.93/297.85 , del(x, nil()) -> nil() 1014.93/297.85 , del(x, cons(y, xs)) -> if2(eq(x, y), x, y, xs) 1014.93/297.85 , if2(true(), x, y, xs) -> xs 1014.93/297.85 , if2(false(), x, y, xs) -> cons(y, del(x, xs)) 1014.93/297.85 , eq(0(), 0()) -> true() 1014.93/297.85 , eq(0(), s(y)) -> false() 1014.93/297.85 , eq(s(x), 0()) -> false() 1014.93/297.85 , eq(s(x), s(y)) -> eq(x, y) 1014.93/297.85 , sort(nil()) -> nil() 1014.93/297.85 , sort(cons(x, xs)) -> 1014.93/297.85 cons(max(cons(x, xs)), sort(del(max(cons(x, xs)), cons(x, xs)))) } 1014.93/297.85 Obligation: 1014.93/297.85 innermost runtime complexity 1014.93/297.85 Answer: 1014.93/297.85 MAYBE 1014.93/297.85 1014.93/297.85 None of the processors succeeded. 1014.93/297.85 1014.93/297.85 Details of failed attempt(s): 1014.93/297.85 ----------------------------- 1014.93/297.85 1) 'empty' failed due to the following reason: 1014.93/297.85 1014.93/297.85 Empty strict component of the problem is NOT empty. 1014.93/297.85 1014.93/297.85 2) 'Best' failed due to the following reason: 1014.93/297.85 1014.93/297.85 None of the processors succeeded. 1014.93/297.85 1014.93/297.85 Details of failed attempt(s): 1014.93/297.85 ----------------------------- 1014.93/297.85 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1014.93/297.85 following reason: 1014.93/297.85 1014.93/297.85 Computation stopped due to timeout after 297.0 seconds. 1014.93/297.85 1014.93/297.85 2) 'Best' failed due to the following reason: 1014.93/297.85 1014.93/297.85 None of the processors succeeded. 1014.93/297.85 1014.93/297.85 Details of failed attempt(s): 1014.93/297.85 ----------------------------- 1014.93/297.85 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1014.93/297.85 seconds)' failed due to the following reason: 1014.93/297.85 1014.93/297.85 Computation stopped due to timeout after 148.0 seconds. 1014.93/297.85 1014.93/297.85 2) 'Best' failed due to the following reason: 1014.93/297.85 1014.93/297.85 None of the processors succeeded. 1014.93/297.85 1014.93/297.85 Details of failed attempt(s): 1014.93/297.85 ----------------------------- 1014.93/297.85 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1014.93/297.85 to the following reason: 1014.93/297.85 1014.93/297.85 The input cannot be shown compatible 1014.93/297.85 1014.93/297.85 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1014.93/297.85 following reason: 1014.93/297.85 1014.93/297.85 The input cannot be shown compatible 1014.93/297.85 1014.93/297.85 1014.93/297.85 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1014.93/297.85 failed due to the following reason: 1014.93/297.85 1014.93/297.85 None of the processors succeeded. 1014.93/297.85 1014.93/297.85 Details of failed attempt(s): 1014.93/297.85 ----------------------------- 1014.93/297.85 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1014.93/297.85 failed due to the following reason: 1014.93/297.85 1014.93/297.85 match-boundness of the problem could not be verified. 1014.93/297.85 1014.93/297.85 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1014.93/297.85 failed due to the following reason: 1014.93/297.85 1014.93/297.85 match-boundness of the problem could not be verified. 1014.93/297.85 1014.93/297.85 1014.93/297.85 1014.93/297.85 1014.93/297.85 1014.93/297.85 Arrrr.. 1015.39/298.16 EOF