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