MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { plus(x, 0()) -> x , plus(0(), y) -> y , plus(s(x), y) -> s(plus(x, y)) , times(0(), y) -> 0() , times(s(x), y) -> plus(y, times(x, y)) , times(s(0()), y) -> y , div(x, y) -> quot(x, y, y) , div(0(), y) -> 0() , div(div(x, y), z) -> div(x, times(y, z)) , quot(x, 0(), s(z)) -> s(div(x, s(z))) , quot(0(), s(y), z) -> 0() , quot(s(x), s(y), z) -> quot(x, y, z) , eq(0(), 0()) -> true() , eq(0(), s(y)) -> false() , eq(s(x), 0()) -> false() , eq(s(x), s(y)) -> eq(x, y) , divides(y, x) -> eq(x, times(div(x, y), y)) , prime(s(s(x))) -> pr(s(s(x)), s(x)) , pr(x, s(0())) -> true() , pr(x, s(s(y))) -> if(divides(s(s(y)), x), x, s(y)) , if(true(), x, y) -> false() , if(false(), x, y) -> pr(x, y) } Obligation: runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 60.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 30.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed due to the following reason: We add the following weak dependency pairs: Strict DPs: { plus^#(x, 0()) -> c_1(x) , plus^#(0(), y) -> c_2(y) , plus^#(s(x), y) -> c_3(plus^#(x, y)) , times^#(0(), y) -> c_4() , times^#(s(x), y) -> c_5(plus^#(y, times(x, y))) , times^#(s(0()), y) -> c_6(y) , div^#(x, y) -> c_7(quot^#(x, y, y)) , div^#(0(), y) -> c_8() , div^#(div(x, y), z) -> c_9(div^#(x, times(y, z))) , quot^#(x, 0(), s(z)) -> c_10(div^#(x, s(z))) , quot^#(0(), s(y), z) -> c_11() , quot^#(s(x), s(y), z) -> c_12(quot^#(x, y, z)) , eq^#(0(), 0()) -> c_13() , eq^#(0(), s(y)) -> c_14() , eq^#(s(x), 0()) -> c_15() , eq^#(s(x), s(y)) -> c_16(eq^#(x, y)) , divides^#(y, x) -> c_17(eq^#(x, times(div(x, y), y))) , prime^#(s(s(x))) -> c_18(pr^#(s(s(x)), s(x))) , pr^#(x, s(0())) -> c_19() , pr^#(x, s(s(y))) -> c_20(if^#(divides(s(s(y)), x), x, s(y))) , if^#(true(), x, y) -> c_21() , if^#(false(), x, y) -> c_22(pr^#(x, y)) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { plus^#(x, 0()) -> c_1(x) , plus^#(0(), y) -> c_2(y) , plus^#(s(x), y) -> c_3(plus^#(x, y)) , times^#(0(), y) -> c_4() , times^#(s(x), y) -> c_5(plus^#(y, times(x, y))) , times^#(s(0()), y) -> c_6(y) , div^#(x, y) -> c_7(quot^#(x, y, y)) , div^#(0(), y) -> c_8() , div^#(div(x, y), z) -> c_9(div^#(x, times(y, z))) , quot^#(x, 0(), s(z)) -> c_10(div^#(x, s(z))) , quot^#(0(), s(y), z) -> c_11() , quot^#(s(x), s(y), z) -> c_12(quot^#(x, y, z)) , eq^#(0(), 0()) -> c_13() , eq^#(0(), s(y)) -> c_14() , eq^#(s(x), 0()) -> c_15() , eq^#(s(x), s(y)) -> c_16(eq^#(x, y)) , divides^#(y, x) -> c_17(eq^#(x, times(div(x, y), y))) , prime^#(s(s(x))) -> c_18(pr^#(s(s(x)), s(x))) , pr^#(x, s(0())) -> c_19() , pr^#(x, s(s(y))) -> c_20(if^#(divides(s(s(y)), x), x, s(y))) , if^#(true(), x, y) -> c_21() , if^#(false(), x, y) -> c_22(pr^#(x, y)) } Strict Trs: { plus(x, 0()) -> x , plus(0(), y) -> y , plus(s(x), y) -> s(plus(x, y)) , times(0(), y) -> 0() , times(s(x), y) -> plus(y, times(x, y)) , times(s(0()), y) -> y , div(x, y) -> quot(x, y, y) , div(0(), y) -> 0() , div(div(x, y), z) -> div(x, times(y, z)) , quot(x, 0(), s(z)) -> s(div(x, s(z))) , quot(0(), s(y), z) -> 0() , quot(s(x), s(y), z) -> quot(x, y, z) , eq(0(), 0()) -> true() , eq(0(), s(y)) -> false() , eq(s(x), 0()) -> false() , eq(s(x), s(y)) -> eq(x, y) , divides(y, x) -> eq(x, times(div(x, y), y)) , prime(s(s(x))) -> pr(s(s(x)), s(x)) , pr(x, s(0())) -> true() , pr(x, s(s(y))) -> if(divides(s(s(y)), x), x, s(y)) , if(true(), x, y) -> false() , if(false(), x, y) -> pr(x, y) } Obligation: runtime complexity Answer: MAYBE We estimate the number of application of {4,8,11,13,14,15,19,21} by applications of Pre({4,8,11,13,14,15,19,21}) = {1,2,6,7,9,10,12,16,17,18,20,22}. Here rules are labeled as follows: DPs: { 1: plus^#(x, 0()) -> c_1(x) , 2: plus^#(0(), y) -> c_2(y) , 3: plus^#(s(x), y) -> c_3(plus^#(x, y)) , 4: times^#(0(), y) -> c_4() , 5: times^#(s(x), y) -> c_5(plus^#(y, times(x, y))) , 6: times^#(s(0()), y) -> c_6(y) , 7: div^#(x, y) -> c_7(quot^#(x, y, y)) , 8: div^#(0(), y) -> c_8() , 9: div^#(div(x, y), z) -> c_9(div^#(x, times(y, z))) , 10: quot^#(x, 0(), s(z)) -> c_10(div^#(x, s(z))) , 11: quot^#(0(), s(y), z) -> c_11() , 12: quot^#(s(x), s(y), z) -> c_12(quot^#(x, y, z)) , 13: eq^#(0(), 0()) -> c_13() , 14: eq^#(0(), s(y)) -> c_14() , 15: eq^#(s(x), 0()) -> c_15() , 16: eq^#(s(x), s(y)) -> c_16(eq^#(x, y)) , 17: divides^#(y, x) -> c_17(eq^#(x, times(div(x, y), y))) , 18: prime^#(s(s(x))) -> c_18(pr^#(s(s(x)), s(x))) , 19: pr^#(x, s(0())) -> c_19() , 20: pr^#(x, s(s(y))) -> c_20(if^#(divides(s(s(y)), x), x, s(y))) , 21: if^#(true(), x, y) -> c_21() , 22: if^#(false(), x, y) -> c_22(pr^#(x, y)) } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { plus^#(x, 0()) -> c_1(x) , plus^#(0(), y) -> c_2(y) , plus^#(s(x), y) -> c_3(plus^#(x, y)) , times^#(s(x), y) -> c_5(plus^#(y, times(x, y))) , times^#(s(0()), y) -> c_6(y) , div^#(x, y) -> c_7(quot^#(x, y, y)) , div^#(div(x, y), z) -> c_9(div^#(x, times(y, z))) , quot^#(x, 0(), s(z)) -> c_10(div^#(x, s(z))) , quot^#(s(x), s(y), z) -> c_12(quot^#(x, y, z)) , eq^#(s(x), s(y)) -> c_16(eq^#(x, y)) , divides^#(y, x) -> c_17(eq^#(x, times(div(x, y), y))) , prime^#(s(s(x))) -> c_18(pr^#(s(s(x)), s(x))) , pr^#(x, s(s(y))) -> c_20(if^#(divides(s(s(y)), x), x, s(y))) , if^#(false(), x, y) -> c_22(pr^#(x, y)) } Strict Trs: { plus(x, 0()) -> x , plus(0(), y) -> y , plus(s(x), y) -> s(plus(x, y)) , times(0(), y) -> 0() , times(s(x), y) -> plus(y, times(x, y)) , times(s(0()), y) -> y , div(x, y) -> quot(x, y, y) , div(0(), y) -> 0() , div(div(x, y), z) -> div(x, times(y, z)) , quot(x, 0(), s(z)) -> s(div(x, s(z))) , quot(0(), s(y), z) -> 0() , quot(s(x), s(y), z) -> quot(x, y, z) , eq(0(), 0()) -> true() , eq(0(), s(y)) -> false() , eq(s(x), 0()) -> false() , eq(s(x), s(y)) -> eq(x, y) , divides(y, x) -> eq(x, times(div(x, y), y)) , prime(s(s(x))) -> pr(s(s(x)), s(x)) , pr(x, s(0())) -> true() , pr(x, s(s(y))) -> if(divides(s(s(y)), x), x, s(y)) , if(true(), x, y) -> false() , if(false(), x, y) -> pr(x, y) } Weak DPs: { times^#(0(), y) -> c_4() , div^#(0(), y) -> c_8() , quot^#(0(), s(y), z) -> c_11() , eq^#(0(), 0()) -> c_13() , eq^#(0(), s(y)) -> c_14() , eq^#(s(x), 0()) -> c_15() , pr^#(x, s(0())) -> c_19() , if^#(true(), x, y) -> c_21() } Obligation: runtime complexity Answer: MAYBE Empty strict component of the problem is NOT empty. Arrrr..