/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__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__plus(N,0()) -> mark(N)
            a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M)))
            a__plus(X1,X2) -> plus(X1,X2)
            mark(0()) -> 0()
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2))
            mark(s(X)) -> s(mark(X))
            mark(tt()) -> tt()
        - Signature:
            {a__and/2,a__plus/2,mark/1} / {0/0,and/2,plus/2,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a__and,a__plus,mark} and constructors {0,and,plus,s,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__plus(N,0()) -> mark(N)
            a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M)))
            a__plus(X1,X2) -> plus(X1,X2)
            mark(0()) -> 0()
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2))
            mark(s(X)) -> s(mark(X))
            mark(tt()) -> tt()
        - Signature:
            {a__and/2,a__plus/2,mark/1} / {0/0,and/2,plus/2,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a__and,a__plus,mark} and constructors {0,and,plus,s,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a__and(X1,X2) -> and(X1,X2)
            a__and(tt(),X) -> mark(X)
            a__plus(N,0()) -> mark(N)
            a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M)))
            a__plus(X1,X2) -> plus(X1,X2)
            mark(0()) -> 0()
            mark(and(X1,X2)) -> a__and(mark(X1),X2)
            mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2))
            mark(s(X)) -> s(mark(X))
            mark(tt()) -> tt()
        - Signature:
            {a__and/2,a__plus/2,mark/1} / {0/0,and/2,plus/2,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a__and,a__plus,mark} and constructors {0,and,plus,s,tt}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          mark(x){x -> and(x,y)} =
            mark(and(x,y)) ->^+ a__and(mark(x),y)
              = C[mark(x) = mark(x){}]

WORST_CASE(Omega(n^1),?)