MAYBE 728.84/297.12 MAYBE 728.84/297.12 728.84/297.12 We are left with following problem, upon which TcT provides the 728.84/297.12 certificate MAYBE. 728.84/297.12 728.84/297.12 Strict Trs: 728.84/297.12 { minus(x, 0()) -> x 728.84/297.12 , minus(s(x), s(y)) -> minus(x, y) 728.84/297.12 , quot(0(), s(y)) -> 0() 728.84/297.12 , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) 728.84/297.12 , le(0(), y) -> true() 728.84/297.12 , le(s(x), 0()) -> false() 728.84/297.12 , le(s(x), s(y)) -> le(x, y) 728.84/297.12 , app(nil(), y) -> y 728.84/297.12 , app(add(n, x), y) -> add(n, app(x, y)) 728.84/297.12 , low(n, nil()) -> nil() 728.84/297.12 , low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x)) 728.84/297.12 , if_low(true(), n, add(m, x)) -> add(m, low(n, x)) 728.84/297.12 , if_low(false(), n, add(m, x)) -> low(n, x) 728.84/297.12 , high(n, nil()) -> nil() 728.84/297.12 , high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x)) 728.84/297.12 , if_high(true(), n, add(m, x)) -> high(n, x) 728.84/297.12 , if_high(false(), n, add(m, x)) -> add(m, high(n, x)) 728.84/297.12 , quicksort(nil()) -> nil() 728.84/297.12 , quicksort(add(n, x)) -> 728.84/297.12 app(quicksort(low(n, x)), add(n, quicksort(high(n, x)))) } 728.84/297.12 Obligation: 728.84/297.12 innermost runtime complexity 728.84/297.12 Answer: 728.84/297.12 MAYBE 728.84/297.12 728.84/297.12 None of the processors succeeded. 728.84/297.12 728.84/297.12 Details of failed attempt(s): 728.84/297.12 ----------------------------- 728.84/297.12 1) 'empty' failed due to the following reason: 728.84/297.12 728.84/297.12 Empty strict component of the problem is NOT empty. 728.84/297.12 728.84/297.12 2) 'Best' failed due to the following reason: 728.84/297.12 728.84/297.12 None of the processors succeeded. 728.84/297.12 728.84/297.12 Details of failed attempt(s): 728.84/297.12 ----------------------------- 728.84/297.12 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 728.84/297.12 following reason: 728.84/297.12 728.84/297.12 Computation stopped due to timeout after 297.0 seconds. 728.84/297.12 728.84/297.12 2) 'Best' failed due to the following reason: 728.84/297.12 728.84/297.12 None of the processors succeeded. 728.84/297.12 728.84/297.12 Details of failed attempt(s): 728.84/297.12 ----------------------------- 728.84/297.12 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 728.84/297.12 seconds)' failed due to the following reason: 728.84/297.12 728.84/297.12 Computation stopped due to timeout after 148.0 seconds. 728.84/297.12 728.84/297.12 2) 'Best' failed due to the following reason: 728.84/297.12 728.84/297.12 None of the processors succeeded. 728.84/297.12 728.84/297.12 Details of failed attempt(s): 728.84/297.12 ----------------------------- 728.84/297.12 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 728.84/297.12 to the following reason: 728.84/297.12 728.84/297.12 The input cannot be shown compatible 728.84/297.12 728.84/297.12 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 728.84/297.12 following reason: 728.84/297.12 728.84/297.12 The input cannot be shown compatible 728.84/297.12 728.84/297.12 728.84/297.12 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 728.84/297.12 failed due to the following reason: 728.84/297.12 728.84/297.12 None of the processors succeeded. 728.84/297.12 728.84/297.12 Details of failed attempt(s): 728.84/297.12 ----------------------------- 728.84/297.12 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 728.84/297.12 failed due to the following reason: 728.84/297.12 728.84/297.12 match-boundness of the problem could not be verified. 728.84/297.12 728.84/297.12 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 728.84/297.12 failed due to the following reason: 728.84/297.12 728.84/297.12 match-boundness of the problem could not be verified. 728.84/297.12 728.84/297.12 728.84/297.12 728.84/297.12 728.84/297.12 728.84/297.12 Arrrr.. 728.84/297.15 EOF