/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:
    U11(X1,active(X2)) -> U11(X1,X2)
    U11(X1,mark(X2)) -> U11(X1,X2)
    U11(active(X1),X2) -> U11(X1,X2)
    U11(mark(X1),X2) -> U11(X1,X2)
    active(U11(tt(),L)) -> mark(s(length(L)))
    active(and(tt(),X)) -> mark(X)
    active(isNat(0())) -> mark(tt())
    active(isNat(length(V1))) -> mark(isNatList(V1))
    active(isNat(s(V1))) -> mark(isNat(V1))
    active(isNatIList(V)) -> mark(isNatList(V))
    active(isNatIList(cons(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2)))
    active(isNatIList(zeros())) -> mark(tt())
    active(isNatList(cons(V1,V2))) -> mark(and(isNat(V1),isNatList(V2)))
    active(isNatList(nil())) -> mark(tt())
    active(length(cons(N,L))) -> mark(U11(and(isNatList(L),isNat(N)),L))
    active(length(nil())) -> mark(0())
    active(zeros()) -> mark(cons(0(),zeros()))
    and(X1,active(X2)) -> and(X1,X2)
    and(X1,mark(X2)) -> and(X1,X2)
    and(active(X1),X2) -> and(X1,X2)
    and(mark(X1),X2) -> and(X1,X2)
    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)
    isNat(active(X)) -> isNat(X)
    isNat(mark(X)) -> isNat(X)
    isNatIList(active(X)) -> isNatIList(X)
    isNatIList(mark(X)) -> isNatIList(X)
    isNatList(active(X)) -> isNatList(X)
    isNatList(mark(X)) -> isNatList(X)
    length(active(X)) -> length(X)
    length(mark(X)) -> length(X)
    mark(0()) -> active(0())
    mark(U11(X1,X2)) -> active(U11(mark(X1),X2))
    mark(and(X1,X2)) -> active(and(mark(X1),X2))
    mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    mark(isNat(X)) -> active(isNat(X))
    mark(isNatIList(X)) -> active(isNatIList(X))
    mark(isNatList(X)) -> active(isNatList(X))
    mark(length(X)) -> active(length(mark(X)))
    mark(nil()) -> active(nil())
    mark(s(X)) -> active(s(mark(X)))
    mark(tt()) -> active(tt())
    mark(zeros()) -> active(zeros())
    s(active(X)) -> s(X)
    s(mark(X)) -> s(X)
- Signature:
    {U11/2,active/1,and/2,cons/2,isNat/1,isNatIList/1,isNatList/1,length/1,mark/1,s/1} / {0/0,nil/0,tt/0
    ,zeros/0}
- Obligation:
    innermost derivational complexity wrt. signature {0,U11,active,and,cons,isNat,isNatIList,isNatList,length
    ,mark,nil,s,tt,zeros}
The problem is still open.