/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(f(X)) -> f(g(f(g(f(X)))))
            f(g(f(X))) -> f(g(X))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             derivational complexity wrt. signature {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.
          f_0(1) -> 1
          f_1(1) -> 5
          f_1(2) -> 1
          f_1(2) -> 3
          f_1(2) -> 5
          f_1(2) -> 13
          f_1(4) -> 3
          f_1(7) -> 1
          f_2(2) -> 13
          f_2(6) -> 3
          f_2(7) -> 1
          f_2(7) -> 3
          f_2(7) -> 5
          f_2(7) -> 11
          f_2(7) -> 13
          f_2(10) -> 5
          f_2(12) -> 11
          f_3(14) -> 11
          f_3(15) -> 5
          f_3(16) -> 3
          f_3(16) -> 5
          f_3(16) -> 11
          g_0(1) -> 1
          g_1(1) -> 2
          g_1(2) -> 2
          g_1(3) -> 2
          g_1(5) -> 4
          g_1(7) -> 2
          g_2(1) -> 6
          g_2(2) -> 7
          g_2(3) -> 10
          g_2(4) -> 7
          g_2(6) -> 7
          g_2(7) -> 7
          g_2(10) -> 6
          g_2(11) -> 10
          g_2(13) -> 12
          g_2(15) -> 6
          g_2(16) -> 7
          g_3(2) -> 14
          g_3(6) -> 15
          g_3(7) -> 16
          g_3(12) -> 15
          g_3(14) -> 15
          g_3(16) -> 15
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(f(X)) -> f(g(f(g(f(X)))))
            f(g(f(X))) -> f(g(X))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             derivational complexity wrt. signature {f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))