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

WORST_CASE(Omega(n^1),?)