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

WORST_CASE(Omega(n^1),?)