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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            b(X) -> a(X)
            f(a(g(X))) -> b(X)
            f(f(X)) -> f(a(b(f(X))))
        - Signature:
            {b/1,f/1} / {a/1,g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {b,f} and constructors {a,g}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Bounds.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            b(X) -> a(X)
            f(a(g(X))) -> b(X)
            f(f(X)) -> f(a(b(f(X))))
        - Signature:
            {b/1,f/1} / {a/1,g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {b,f} and constructors {a,g}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          a_0(2) -> 2
          a_1(2) -> 1
          a_2(2) -> 1
          b_0(2) -> 1
          b_1(2) -> 1
          f_0(2) -> 1
          g_0(2) -> 2
* Step 3: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            b(X) -> a(X)
            f(a(g(X))) -> b(X)
            f(f(X)) -> f(a(b(f(X))))
        - Signature:
            {b/1,f/1} / {a/1,g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {b,f} and constructors {a,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))