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


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


WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(a()) -> f(b())
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_1() -> 3
          b_0() -> 1
          b_1() -> 2
          f_0(1) -> 1
          f_1(2) -> 1
          g_0(1) -> 1
          g_1(3) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(a()) -> f(b())
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))