/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci_cert /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
EmptyProcessor
- Strict TRS:
    active(filter(s(s(X)),cons(Y,Z))) -> mark(if(divides(s(s(X)),Y)
                                                ,filter(s(s(X)),Z)
                                                ,cons(Y,filter(X,sieve(Y)))))
    active(from(X)) -> mark(cons(X,from(s(X))))
    active(head(cons(X,Y))) -> mark(X)
    active(if(false(),X,Y)) -> mark(Y)
    active(if(true(),X,Y)) -> mark(X)
    active(primes()) -> mark(sieve(from(s(s(0())))))
    active(sieve(cons(X,Y))) -> mark(cons(X,filter(X,sieve(Y))))
    active(tail(cons(X,Y))) -> mark(Y)
    cons(X1,active(X2)) -> cons(X1,X2)
    cons(X1,mark(X2)) -> cons(X1,X2)
    cons(active(X1),X2) -> cons(X1,X2)
    cons(mark(X1),X2) -> cons(X1,X2)
    divides(X1,active(X2)) -> divides(X1,X2)
    divides(X1,mark(X2)) -> divides(X1,X2)
    divides(active(X1),X2) -> divides(X1,X2)
    divides(mark(X1),X2) -> divides(X1,X2)
    filter(X1,active(X2)) -> filter(X1,X2)
    filter(X1,mark(X2)) -> filter(X1,X2)
    filter(active(X1),X2) -> filter(X1,X2)
    filter(mark(X1),X2) -> filter(X1,X2)
    from(active(X)) -> from(X)
    from(mark(X)) -> from(X)
    head(active(X)) -> head(X)
    head(mark(X)) -> head(X)
    if(X1,X2,active(X3)) -> if(X1,X2,X3)
    if(X1,X2,mark(X3)) -> if(X1,X2,X3)
    if(X1,active(X2),X3) -> if(X1,X2,X3)
    if(X1,mark(X2),X3) -> if(X1,X2,X3)
    if(active(X1),X2,X3) -> if(X1,X2,X3)
    if(mark(X1),X2,X3) -> if(X1,X2,X3)
    mark(0()) -> active(0())
    mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    mark(divides(X1,X2)) -> active(divides(mark(X1),mark(X2)))
    mark(false()) -> active(false())
    mark(filter(X1,X2)) -> active(filter(mark(X1),mark(X2)))
    mark(from(X)) -> active(from(mark(X)))
    mark(head(X)) -> active(head(mark(X)))
    mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3))
    mark(primes()) -> active(primes())
    mark(s(X)) -> active(s(mark(X)))
    mark(sieve(X)) -> active(sieve(mark(X)))
    mark(tail(X)) -> active(tail(mark(X)))
    mark(true()) -> active(true())
    s(active(X)) -> s(X)
    s(mark(X)) -> s(X)
    sieve(active(X)) -> sieve(X)
    sieve(mark(X)) -> sieve(X)
    tail(active(X)) -> tail(X)
    tail(mark(X)) -> tail(X)
- Signature:
    {active/1,cons/2,divides/2,filter/2,from/1,head/1,if/3,mark/1,s/1,sieve/1,tail/1} / {0/0,false/0,primes/0
    ,true/0}
- Obligation:
    innermost derivational complexity wrt. signature {0,active,cons,divides,false,filter,from,head,if,mark
    ,primes,s,sieve,tail,true}
The problem is still open.