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


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


WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a____(X,nil()) -> mark(X)
            a____(X1,X2) -> __(X1,X2)
            a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z)))
            a____(nil(),X) -> mark(X)
            a__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__isNePal(X) -> isNePal(X)
            a__isNePal(__(I,__(P,I))) -> tt()
            mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(isNePal(X)) -> a__isNePal(mark(X))
            mark(nil()) -> nil()
            mark(tt()) -> tt()
        - Signature:
            {a____/2,a__and/2,a__isNePal/1,mark/1} / {__/2,and/2,isNePal/1,nil/0,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a____,a__and,a__isNePal,mark} and constructors {__,and,isNePal,nil
            ,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a____(X,nil()) -> mark(X)
            a____(X1,X2) -> __(X1,X2)
            a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z)))
            a____(nil(),X) -> mark(X)
            a__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__isNePal(X) -> isNePal(X)
            a__isNePal(__(I,__(P,I))) -> tt()
            mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(isNePal(X)) -> a__isNePal(mark(X))
            mark(nil()) -> nil()
            mark(tt()) -> tt()
        - Signature:
            {a____/2,a__and/2,a__isNePal/1,mark/1} / {__/2,and/2,isNePal/1,nil/0,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a____,a__and,a__isNePal,mark} and constructors {__,and,isNePal,nil
            ,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a____(X,nil()) -> mark(X)
            a____(X1,X2) -> __(X1,X2)
            a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z)))
            a____(nil(),X) -> mark(X)
            a__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__isNePal(X) -> isNePal(X)
            a__isNePal(__(I,__(P,I))) -> tt()
            mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(isNePal(X)) -> a__isNePal(mark(X))
            mark(nil()) -> nil()
            mark(tt()) -> tt()
        - Signature:
            {a____/2,a__and/2,a__isNePal/1,mark/1} / {__/2,and/2,isNePal/1,nil/0,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a____,a__and,a__isNePal,mark} and constructors {__,and,isNePal,nil
            ,tt}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          mark(x){x -> __(x,y)} =
            mark(__(x,y)) ->^+ a____(mark(x),mark(y))
              = C[mark(x) = mark(x){}]

WORST_CASE(Omega(n^1),?)