interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ primes() -> sieve(from(s(s(0()))))
, sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y)))
, from(X) -> cons(X, from(s(X)))
, head(cons(X, Y)) -> X
, tail(cons(X, Y)) -> Y
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, filter(s(s(X)), cons(Y, Z)) ->
if(divides(s(s(X)), Y),
filter(s(s(X)), Z),
cons(Y, filter(X, sieve(Y)))) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ primes() -> sieve(from(s(s(0()))))
, from(X) -> cons(X, from(s(X)))
, head(cons(X, Y)) -> X
, tail(cons(X, Y)) -> Y
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, filter(s(s(X)), cons(Y, Z)) ->
if(divides(s(s(X)), Y),
filter(s(s(X)), Z),
cons(Y, filter(X, sieve(Y))))
, sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ primes() -> sieve(from(s(s(0()))))
, from(X) -> cons(X, from(s(X)))
, head(cons(X, Y)) -> X
, tail(cons(X, Y)) -> Y
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, filter(s(s(X)), cons(Y, Z)) ->
if(divides(s(s(X)), Y),
filter(s(s(X)), Z),
cons(Y, filter(X, sieve(Y))))
, sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ primes() -> sieve(from(s(s(0()))))
, from(X) -> cons(X, from(s(X)))
, head(cons(X, Y)) -> X
, tail(cons(X, Y)) -> Y
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, filter(s(s(X)), cons(Y, Z)) ->
if(divides(s(s(X)), Y),
filter(s(s(X)), Z),
cons(Y, filter(X, sieve(Y))))
, sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ primes() -> sieve(from(s(s(0()))))
, from(X) -> cons(X, from(s(X)))
, head(cons(X, Y)) -> X
, tail(cons(X, Y)) -> Y
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, filter(s(s(X)), cons(Y, Z)) ->
if(divides(s(s(X)), Y),
filter(s(s(X)), Z),
cons(Y, filter(X, sieve(Y))))
, sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..