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


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


WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            *(0(),y) -> 0()
            *(s(x),y) -> +(y,*(x,y))
            -(x,0()) -> x
            -(0(),y) -> 0()
            -(s(x),s(y)) -> -(x,y)
            exp(x,0()) -> s(0())
            exp(x,s(y)) -> *(x,exp(x,y))
        - Signature:
            {*/2,-/2,exp/2} / {+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*,-,exp} and constructors {+,0,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            *(0(),y) -> 0()
            *(s(x),y) -> +(y,*(x,y))
            -(x,0()) -> x
            -(0(),y) -> 0()
            -(s(x),s(y)) -> -(x,y)
            exp(x,0()) -> s(0())
            exp(x,s(y)) -> *(x,exp(x,y))
        - Signature:
            {*/2,-/2,exp/2} / {+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*,-,exp} and constructors {+,0,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            *(0(),y) -> 0()
            *(s(x),y) -> +(y,*(x,y))
            -(x,0()) -> x
            -(0(),y) -> 0()
            -(s(x),s(y)) -> -(x,y)
            exp(x,0()) -> s(0())
            exp(x,s(y)) -> *(x,exp(x,y))
        - Signature:
            {*/2,-/2,exp/2} / {+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*,-,exp} and constructors {+,0,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          *(x,y){x -> s(x)} =
            *(s(x),y) ->^+ +(y,*(x,y))
              = C[*(x,y) = *(x,y){}]

WORST_CASE(Omega(n^1),?)