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