MAYBE 879.19/297.03 MAYBE 879.19/297.03 879.19/297.03 We are left with following problem, upon which TcT provides the 879.19/297.03 certificate MAYBE. 879.19/297.03 879.19/297.03 Strict Trs: 879.19/297.03 { app(l, nil()) -> l 879.19/297.03 , app(nil(), k) -> k 879.19/297.03 , app(cons(x, l), k) -> cons(x, app(l, k)) 879.19/297.03 , sum(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 sum(app(l, sum(cons(x, cons(y, k))))) 879.19/297.03 , sum(cons(x, nil())) -> cons(x, nil()) 879.19/297.03 , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) 879.19/297.03 , sum(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 pred(sum(cons(s(x), cons(y, l)))) 879.19/297.03 , plus(s(x), x) -> plus(if(gt(x, x), id(x), id(x)), s(x)) 879.19/297.03 , plus(s(x), s(y)) -> 879.19/297.03 s(s(plus(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y))))) 879.19/297.03 , plus(id(x), s(y)) -> s(plus(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus(zero(), y) -> y 879.19/297.03 , pred(cons(s(x), nil())) -> cons(x, nil()) 879.19/297.03 , if(true(), x, y) -> x 879.19/297.03 , if(false(), x, y) -> y 879.19/297.03 , gt(s(x), s(y)) -> gt(x, y) 879.19/297.03 , gt(s(x), zero()) -> true() 879.19/297.03 , gt(zero(), y) -> false() 879.19/297.03 , not(x) -> if(x, false(), true()) 879.19/297.03 , id(x) -> x } 879.19/297.03 Obligation: 879.19/297.03 runtime complexity 879.19/297.03 Answer: 879.19/297.03 MAYBE 879.19/297.03 879.19/297.03 None of the processors succeeded. 879.19/297.03 879.19/297.03 Details of failed attempt(s): 879.19/297.03 ----------------------------- 879.19/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 879.19/297.03 following reason: 879.19/297.03 879.19/297.03 Computation stopped due to timeout after 297.0 seconds. 879.19/297.03 879.19/297.03 2) 'Best' failed due to the following reason: 879.19/297.03 879.19/297.03 None of the processors succeeded. 879.19/297.03 879.19/297.03 Details of failed attempt(s): 879.19/297.03 ----------------------------- 879.19/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 879.19/297.03 seconds)' failed due to the following reason: 879.19/297.03 879.19/297.03 Computation stopped due to timeout after 148.0 seconds. 879.19/297.03 879.19/297.03 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 879.19/297.03 failed due to the following reason: 879.19/297.03 879.19/297.03 None of the processors succeeded. 879.19/297.03 879.19/297.03 Details of failed attempt(s): 879.19/297.03 ----------------------------- 879.19/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 879.19/297.03 failed due to the following reason: 879.19/297.03 879.19/297.03 match-boundness of the problem could not be verified. 879.19/297.03 879.19/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 879.19/297.03 failed due to the following reason: 879.19/297.03 879.19/297.03 match-boundness of the problem could not be verified. 879.19/297.03 879.19/297.03 879.19/297.03 3) 'Best' failed due to the following reason: 879.19/297.03 879.19/297.03 None of the processors succeeded. 879.19/297.03 879.19/297.03 Details of failed attempt(s): 879.19/297.03 ----------------------------- 879.19/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 879.19/297.03 following reason: 879.19/297.03 879.19/297.03 The processor is inapplicable, reason: 879.19/297.03 Processor only applicable for innermost runtime complexity analysis 879.19/297.03 879.19/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 879.19/297.03 to the following reason: 879.19/297.03 879.19/297.03 The processor is inapplicable, reason: 879.19/297.03 Processor only applicable for innermost runtime complexity analysis 879.19/297.03 879.19/297.03 879.19/297.03 879.19/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 879.19/297.03 the following reason: 879.19/297.03 879.19/297.03 We add the following weak dependency pairs: 879.19/297.03 879.19/297.03 Strict DPs: 879.19/297.03 { app^#(l, nil()) -> c_1(l) 879.19/297.03 , app^#(nil(), k) -> c_2(k) 879.19/297.03 , app^#(cons(x, l), k) -> c_3(x, app^#(l, k)) 879.19/297.03 , sum^#(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 c_4(sum^#(app(l, sum(cons(x, cons(y, k)))))) 879.19/297.03 , sum^#(cons(x, nil())) -> c_5(x) 879.19/297.03 , sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l))) 879.19/297.03 , sum^#(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 c_7(pred^#(sum(cons(s(x), cons(y, l))))) 879.19/297.03 , pred^#(cons(s(x), nil())) -> c_12(x) 879.19/297.03 , plus^#(s(x), x) -> c_8(plus^#(if(gt(x, x), id(x), id(x)), s(x))) 879.19/297.03 , plus^#(s(x), s(y)) -> 879.19/297.03 c_9(plus^#(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y)))) 879.19/297.03 , plus^#(id(x), s(y)) -> c_10(plus^#(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus^#(zero(), y) -> c_11(y) 879.19/297.03 , if^#(true(), x, y) -> c_13(x) 879.19/297.03 , if^#(false(), x, y) -> c_14(y) 879.19/297.03 , gt^#(s(x), s(y)) -> c_15(gt^#(x, y)) 879.19/297.03 , gt^#(s(x), zero()) -> c_16() 879.19/297.03 , gt^#(zero(), y) -> c_17() 879.19/297.03 , not^#(x) -> c_18(if^#(x, false(), true())) 879.19/297.03 , id^#(x) -> c_19(x) } 879.19/297.03 879.19/297.03 and mark the set of starting terms. 879.19/297.03 879.19/297.03 We are left with following problem, upon which TcT provides the 879.19/297.03 certificate MAYBE. 879.19/297.03 879.19/297.03 Strict DPs: 879.19/297.03 { app^#(l, nil()) -> c_1(l) 879.19/297.03 , app^#(nil(), k) -> c_2(k) 879.19/297.03 , app^#(cons(x, l), k) -> c_3(x, app^#(l, k)) 879.19/297.03 , sum^#(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 c_4(sum^#(app(l, sum(cons(x, cons(y, k)))))) 879.19/297.03 , sum^#(cons(x, nil())) -> c_5(x) 879.19/297.03 , sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l))) 879.19/297.03 , sum^#(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 c_7(pred^#(sum(cons(s(x), cons(y, l))))) 879.19/297.03 , pred^#(cons(s(x), nil())) -> c_12(x) 879.19/297.03 , plus^#(s(x), x) -> c_8(plus^#(if(gt(x, x), id(x), id(x)), s(x))) 879.19/297.03 , plus^#(s(x), s(y)) -> 879.19/297.03 c_9(plus^#(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y)))) 879.19/297.03 , plus^#(id(x), s(y)) -> c_10(plus^#(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus^#(zero(), y) -> c_11(y) 879.19/297.03 , if^#(true(), x, y) -> c_13(x) 879.19/297.03 , if^#(false(), x, y) -> c_14(y) 879.19/297.03 , gt^#(s(x), s(y)) -> c_15(gt^#(x, y)) 879.19/297.03 , gt^#(s(x), zero()) -> c_16() 879.19/297.03 , gt^#(zero(), y) -> c_17() 879.19/297.03 , not^#(x) -> c_18(if^#(x, false(), true())) 879.19/297.03 , id^#(x) -> c_19(x) } 879.19/297.03 Strict Trs: 879.19/297.03 { app(l, nil()) -> l 879.19/297.03 , app(nil(), k) -> k 879.19/297.03 , app(cons(x, l), k) -> cons(x, app(l, k)) 879.19/297.03 , sum(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 sum(app(l, sum(cons(x, cons(y, k))))) 879.19/297.03 , sum(cons(x, nil())) -> cons(x, nil()) 879.19/297.03 , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) 879.19/297.03 , sum(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 pred(sum(cons(s(x), cons(y, l)))) 879.19/297.03 , plus(s(x), x) -> plus(if(gt(x, x), id(x), id(x)), s(x)) 879.19/297.03 , plus(s(x), s(y)) -> 879.19/297.03 s(s(plus(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y))))) 879.19/297.03 , plus(id(x), s(y)) -> s(plus(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus(zero(), y) -> y 879.19/297.03 , pred(cons(s(x), nil())) -> cons(x, nil()) 879.19/297.03 , if(true(), x, y) -> x 879.19/297.03 , if(false(), x, y) -> y 879.19/297.03 , gt(s(x), s(y)) -> gt(x, y) 879.19/297.03 , gt(s(x), zero()) -> true() 879.19/297.03 , gt(zero(), y) -> false() 879.19/297.03 , not(x) -> if(x, false(), true()) 879.19/297.03 , id(x) -> x } 879.19/297.03 Obligation: 879.19/297.03 runtime complexity 879.19/297.03 Answer: 879.19/297.03 MAYBE 879.19/297.03 879.19/297.03 We estimate the number of application of {16,17} by applications of 879.19/297.03 Pre({16,17}) = {1,2,3,5,8,12,13,14,15,19}. Here rules are labeled 879.19/297.03 as follows: 879.19/297.03 879.19/297.03 DPs: 879.19/297.03 { 1: app^#(l, nil()) -> c_1(l) 879.19/297.03 , 2: app^#(nil(), k) -> c_2(k) 879.19/297.03 , 3: app^#(cons(x, l), k) -> c_3(x, app^#(l, k)) 879.19/297.03 , 4: sum^#(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 c_4(sum^#(app(l, sum(cons(x, cons(y, k)))))) 879.19/297.03 , 5: sum^#(cons(x, nil())) -> c_5(x) 879.19/297.03 , 6: sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l))) 879.19/297.03 , 7: sum^#(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 c_7(pred^#(sum(cons(s(x), cons(y, l))))) 879.19/297.03 , 8: pred^#(cons(s(x), nil())) -> c_12(x) 879.19/297.03 , 9: plus^#(s(x), x) -> 879.19/297.03 c_8(plus^#(if(gt(x, x), id(x), id(x)), s(x))) 879.19/297.03 , 10: plus^#(s(x), s(y)) -> 879.19/297.03 c_9(plus^#(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y)))) 879.19/297.03 , 11: plus^#(id(x), s(y)) -> 879.19/297.03 c_10(plus^#(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , 12: plus^#(zero(), y) -> c_11(y) 879.19/297.03 , 13: if^#(true(), x, y) -> c_13(x) 879.19/297.03 , 14: if^#(false(), x, y) -> c_14(y) 879.19/297.03 , 15: gt^#(s(x), s(y)) -> c_15(gt^#(x, y)) 879.19/297.03 , 16: gt^#(s(x), zero()) -> c_16() 879.19/297.03 , 17: gt^#(zero(), y) -> c_17() 879.19/297.03 , 18: not^#(x) -> c_18(if^#(x, false(), true())) 879.19/297.03 , 19: id^#(x) -> c_19(x) } 879.19/297.03 879.19/297.03 We are left with following problem, upon which TcT provides the 879.19/297.03 certificate MAYBE. 879.19/297.03 879.19/297.03 Strict DPs: 879.19/297.03 { app^#(l, nil()) -> c_1(l) 879.19/297.03 , app^#(nil(), k) -> c_2(k) 879.19/297.03 , app^#(cons(x, l), k) -> c_3(x, app^#(l, k)) 879.19/297.03 , sum^#(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 c_4(sum^#(app(l, sum(cons(x, cons(y, k)))))) 879.19/297.03 , sum^#(cons(x, nil())) -> c_5(x) 879.19/297.03 , sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l))) 879.19/297.03 , sum^#(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 c_7(pred^#(sum(cons(s(x), cons(y, l))))) 879.19/297.03 , pred^#(cons(s(x), nil())) -> c_12(x) 879.19/297.03 , plus^#(s(x), x) -> c_8(plus^#(if(gt(x, x), id(x), id(x)), s(x))) 879.19/297.03 , plus^#(s(x), s(y)) -> 879.19/297.03 c_9(plus^#(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y)))) 879.19/297.03 , plus^#(id(x), s(y)) -> c_10(plus^#(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus^#(zero(), y) -> c_11(y) 879.19/297.03 , if^#(true(), x, y) -> c_13(x) 879.19/297.03 , if^#(false(), x, y) -> c_14(y) 879.19/297.03 , gt^#(s(x), s(y)) -> c_15(gt^#(x, y)) 879.19/297.03 , not^#(x) -> c_18(if^#(x, false(), true())) 879.19/297.03 , id^#(x) -> c_19(x) } 879.19/297.03 Strict Trs: 879.19/297.03 { app(l, nil()) -> l 879.19/297.03 , app(nil(), k) -> k 879.19/297.03 , app(cons(x, l), k) -> cons(x, app(l, k)) 879.19/297.03 , sum(app(l, cons(x, cons(y, k)))) -> 879.19/297.03 sum(app(l, sum(cons(x, cons(y, k))))) 879.19/297.03 , sum(cons(x, nil())) -> cons(x, nil()) 879.19/297.03 , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) 879.19/297.03 , sum(plus(cons(0(), x), cons(y, l))) -> 879.19/297.03 pred(sum(cons(s(x), cons(y, l)))) 879.19/297.03 , plus(s(x), x) -> plus(if(gt(x, x), id(x), id(x)), s(x)) 879.19/297.03 , plus(s(x), s(y)) -> 879.19/297.03 s(s(plus(if(gt(x, y), x, y), if(not(gt(x, y)), id(x), id(y))))) 879.19/297.03 , plus(id(x), s(y)) -> s(plus(x, if(gt(s(y), y), y, s(y)))) 879.19/297.03 , plus(zero(), y) -> y 879.19/297.03 , pred(cons(s(x), nil())) -> cons(x, nil()) 879.19/297.03 , if(true(), x, y) -> x 879.19/297.03 , if(false(), x, y) -> y 879.19/297.03 , gt(s(x), s(y)) -> gt(x, y) 879.19/297.03 , gt(s(x), zero()) -> true() 879.19/297.03 , gt(zero(), y) -> false() 879.19/297.03 , not(x) -> if(x, false(), true()) 879.19/297.03 , id(x) -> x } 879.19/297.03 Weak DPs: 879.19/297.03 { gt^#(s(x), zero()) -> c_16() 879.19/297.03 , gt^#(zero(), y) -> c_17() } 879.19/297.03 Obligation: 879.19/297.03 runtime complexity 879.19/297.03 Answer: 879.19/297.03 MAYBE 879.19/297.03 879.19/297.03 Empty strict component of the problem is NOT empty. 879.19/297.03 879.19/297.03 879.19/297.03 Arrrr.. 879.31/297.17 EOF