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


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


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

WORST_CASE(?,O(n^1))