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