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

WORST_CASE(Omega(n^1),?)