/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:
            e(g(X)) -> e(X)
            f(a()) -> f(c(a()))
            f(a()) -> f(d(a()))
            f(c(X)) -> X
            f(c(a())) -> f(d(b()))
            f(c(b())) -> f(d(a()))
            f(d(X)) -> X
        - Signature:
            {e/1,f/1} / {a/0,b/0,c/1,d/1,g/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,c,d,e,f,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() -> 1
          a_1() -> 1
          a_1() -> 3
          a_2() -> 1
          a_2() -> 5
          b_0() -> 1
          b_1() -> 1
          b_1() -> 3
          b_2() -> 1
          b_2() -> 5
          c_0(1) -> 1
          c_1(3) -> 2
          d_0(1) -> 1
          d_1(3) -> 2
          d_2(5) -> 4
          e_0(1) -> 1
          e_1(1) -> 1
          f_0(1) -> 1
          f_1(2) -> 1
          f_2(4) -> 1
          g_0(1) -> 1
          3 -> 1
          5 -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            e(g(X)) -> e(X)
            f(a()) -> f(c(a()))
            f(a()) -> f(d(a()))
            f(c(X)) -> X
            f(c(a())) -> f(d(b()))
            f(c(b())) -> f(d(a()))
            f(d(X)) -> X
        - Signature:
            {e/1,f/1} / {a/0,b/0,c/1,d/1,g/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,c,d,e,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))