MAYBE 1069.66/298.31 MAYBE 1069.66/298.31 1069.66/298.31 We are left with following problem, upon which TcT provides the 1069.66/298.31 certificate MAYBE. 1069.66/298.31 1069.66/298.31 Strict Trs: 1069.66/298.31 { filter(X1, X2, X3) -> n__filter(X1, X2, X3) 1069.66/298.31 , filter(cons(X, Y), 0(), M) -> 1069.66/298.31 cons(0(), n__filter(activate(Y), M, M)) 1069.66/298.31 , filter(cons(X, Y), s(N), M) -> 1069.66/298.31 cons(X, n__filter(activate(Y), N, M)) 1069.66/298.31 , activate(X) -> X 1069.66/298.31 , activate(n__filter(X1, X2, X3)) -> filter(X1, X2, X3) 1069.66/298.31 , activate(n__sieve(X)) -> sieve(X) 1069.66/298.31 , activate(n__nats(X)) -> nats(X) 1069.66/298.31 , sieve(X) -> n__sieve(X) 1069.66/298.31 , sieve(cons(0(), Y)) -> cons(0(), n__sieve(activate(Y))) 1069.66/298.31 , sieve(cons(s(N), Y)) -> 1069.66/298.31 cons(s(N), n__sieve(filter(activate(Y), N, N))) 1069.66/298.31 , nats(N) -> cons(N, n__nats(s(N))) 1069.66/298.31 , nats(X) -> n__nats(X) 1069.66/298.31 , zprimes() -> sieve(nats(s(s(0())))) } 1069.66/298.31 Obligation: 1069.66/298.31 runtime complexity 1069.66/298.31 Answer: 1069.66/298.31 MAYBE 1069.66/298.31 1069.66/298.31 None of the processors succeeded. 1069.66/298.31 1069.66/298.31 Details of failed attempt(s): 1069.66/298.31 ----------------------------- 1069.66/298.31 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1069.66/298.31 following reason: 1069.66/298.31 1069.66/298.31 Computation stopped due to timeout after 297.0 seconds. 1069.66/298.31 1069.66/298.31 2) 'Best' failed due to the following reason: 1069.66/298.31 1069.66/298.31 None of the processors succeeded. 1069.66/298.31 1069.66/298.31 Details of failed attempt(s): 1069.66/298.31 ----------------------------- 1069.66/298.31 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1069.66/298.31 seconds)' failed due to the following reason: 1069.66/298.31 1069.66/298.31 Computation stopped due to timeout after 148.0 seconds. 1069.66/298.31 1069.66/298.31 2) 'Best' failed due to the following reason: 1069.66/298.31 1069.66/298.31 None of the processors succeeded. 1069.66/298.31 1069.66/298.31 Details of failed attempt(s): 1069.66/298.31 ----------------------------- 1069.66/298.31 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1069.66/298.31 following reason: 1069.66/298.31 1069.66/298.31 The processor is inapplicable, reason: 1069.66/298.31 Processor only applicable for innermost runtime complexity analysis 1069.66/298.31 1069.66/298.31 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1069.66/298.31 to the following reason: 1069.66/298.31 1069.66/298.31 The processor is inapplicable, reason: 1069.66/298.31 Processor only applicable for innermost runtime complexity analysis 1069.66/298.31 1069.66/298.31 1069.66/298.31 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1069.66/298.31 failed due to the following reason: 1069.66/298.31 1069.66/298.31 None of the processors succeeded. 1069.66/298.31 1069.66/298.31 Details of failed attempt(s): 1069.66/298.31 ----------------------------- 1069.66/298.31 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1069.66/298.31 failed due to the following reason: 1069.66/298.31 1069.66/298.31 match-boundness of the problem could not be verified. 1069.66/298.31 1069.66/298.31 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1069.66/298.31 failed due to the following reason: 1069.66/298.31 1069.66/298.31 match-boundness of the problem could not be verified. 1069.66/298.31 1069.66/298.31 1069.66/298.31 1069.66/298.31 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 1069.66/298.31 the following reason: 1069.66/298.31 1069.66/298.31 We add the following weak dependency pairs: 1069.66/298.31 1069.66/298.31 Strict DPs: 1069.66/298.31 { filter^#(X1, X2, X3) -> c_1(X1, X2, X3) 1069.66/298.31 , filter^#(cons(X, Y), 0(), M) -> c_2(activate^#(Y), M, M) 1069.66/298.31 , filter^#(cons(X, Y), s(N), M) -> c_3(X, activate^#(Y), N, M) 1069.66/298.31 , activate^#(X) -> c_4(X) 1069.66/298.31 , activate^#(n__filter(X1, X2, X3)) -> c_5(filter^#(X1, X2, X3)) 1069.66/298.31 , activate^#(n__sieve(X)) -> c_6(sieve^#(X)) 1069.66/298.31 , activate^#(n__nats(X)) -> c_7(nats^#(X)) 1069.66/298.31 , sieve^#(X) -> c_8(X) 1069.66/298.31 , sieve^#(cons(0(), Y)) -> c_9(activate^#(Y)) 1069.66/298.31 , sieve^#(cons(s(N), Y)) -> c_10(N, filter^#(activate(Y), N, N)) 1069.66/298.31 , nats^#(N) -> c_11(N, N) 1069.66/298.31 , nats^#(X) -> c_12(X) 1069.66/298.31 , zprimes^#() -> c_13(sieve^#(nats(s(s(0()))))) } 1069.66/298.31 1069.66/298.31 and mark the set of starting terms. 1069.66/298.31 1069.66/298.31 We are left with following problem, upon which TcT provides the 1069.66/298.31 certificate MAYBE. 1069.66/298.31 1069.66/298.31 Strict DPs: 1069.66/298.31 { filter^#(X1, X2, X3) -> c_1(X1, X2, X3) 1069.66/298.31 , filter^#(cons(X, Y), 0(), M) -> c_2(activate^#(Y), M, M) 1069.66/298.31 , filter^#(cons(X, Y), s(N), M) -> c_3(X, activate^#(Y), N, M) 1069.66/298.31 , activate^#(X) -> c_4(X) 1069.66/298.31 , activate^#(n__filter(X1, X2, X3)) -> c_5(filter^#(X1, X2, X3)) 1069.66/298.31 , activate^#(n__sieve(X)) -> c_6(sieve^#(X)) 1069.66/298.31 , activate^#(n__nats(X)) -> c_7(nats^#(X)) 1069.66/298.31 , sieve^#(X) -> c_8(X) 1069.66/298.31 , sieve^#(cons(0(), Y)) -> c_9(activate^#(Y)) 1069.66/298.31 , sieve^#(cons(s(N), Y)) -> c_10(N, filter^#(activate(Y), N, N)) 1069.66/298.31 , nats^#(N) -> c_11(N, N) 1069.66/298.31 , nats^#(X) -> c_12(X) 1069.66/298.31 , zprimes^#() -> c_13(sieve^#(nats(s(s(0()))))) } 1069.66/298.31 Strict Trs: 1069.66/298.31 { filter(X1, X2, X3) -> n__filter(X1, X2, X3) 1069.66/298.31 , filter(cons(X, Y), 0(), M) -> 1069.66/298.31 cons(0(), n__filter(activate(Y), M, M)) 1069.66/298.31 , filter(cons(X, Y), s(N), M) -> 1069.66/298.31 cons(X, n__filter(activate(Y), N, M)) 1069.66/298.31 , activate(X) -> X 1069.66/298.31 , activate(n__filter(X1, X2, X3)) -> filter(X1, X2, X3) 1069.66/298.31 , activate(n__sieve(X)) -> sieve(X) 1069.66/298.31 , activate(n__nats(X)) -> nats(X) 1069.66/298.31 , sieve(X) -> n__sieve(X) 1069.66/298.31 , sieve(cons(0(), Y)) -> cons(0(), n__sieve(activate(Y))) 1069.66/298.31 , sieve(cons(s(N), Y)) -> 1069.66/298.31 cons(s(N), n__sieve(filter(activate(Y), N, N))) 1069.66/298.31 , nats(N) -> cons(N, n__nats(s(N))) 1069.66/298.31 , nats(X) -> n__nats(X) 1069.66/298.31 , zprimes() -> sieve(nats(s(s(0())))) } 1069.66/298.31 Obligation: 1069.66/298.31 runtime complexity 1069.66/298.31 Answer: 1069.66/298.31 MAYBE 1069.66/298.31 1069.66/298.31 Empty strict component of the problem is NOT empty. 1069.66/298.31 1069.66/298.31 1069.66/298.31 Arrrr.. 1069.82/298.48 EOF