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

WORST_CASE(Omega(n^1),?)