/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:
            activate(X) -> X
            activate(n__d(X)) -> d(X)
            activate(n__f(X)) -> f(X)
            c(X) -> d(activate(X))
            d(X) -> n__d(X)
            f(X) -> n__f(X)
            f(f(X)) -> c(n__f(g(n__f(X))))
            h(X) -> c(n__d(X))
        - Signature:
            {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1}
        - Obligation:
             derivational complexity wrt. signature {activate,c,d,f,g,h,n__d,n__f}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 6.
        The enriched problem is compatible with follwoing automaton.
          activate_0(1) -> 1
          activate_1(1) -> 1
          activate_2(1) -> 1
          activate_2(2) -> 1
          activate_3(4) -> 6
          activate_4(7) -> 9
          activate_5(10) -> 12
          c_0(1) -> 1
          c_1(1) -> 1
          c_1(2) -> 1
          c_2(4) -> 1
          c_3(7) -> 1
          c_4(10) -> 1
          d_0(1) -> 1
          d_1(1) -> 1
          d_1(6) -> 1
          d_1(9) -> 1
          d_1(12) -> 1
          d_2(1) -> 1
          d_2(6) -> 1
          d_2(9) -> 1
          d_2(12) -> 1
          d_3(1) -> 1
          d_3(6) -> 1
          d_3(9) -> 1
          d_3(12) -> 1
          d_4(9) -> 1
          d_5(12) -> 1
          f_0(1) -> 1
          f_1(1) -> 1
          f_1(3) -> 1
          f_2(1) -> 1
          f_2(3) -> 1
          f_3(1) -> 1
          f_3(3) -> 1
          f_3(5) -> 6
          f_4(8) -> 9
          f_5(11) -> 12
          g_0(1) -> 1
          g_1(1) -> 3
          g_2(1) -> 5
          g_3(1) -> 8
          g_4(1) -> 11
          h_0(1) -> 1
          n__d_0(1) -> 1
          n__d_1(1) -> 1
          n__d_2(1) -> 1
          n__d_2(6) -> 1
          n__d_2(9) -> 1
          n__d_2(12) -> 1
          n__d_3(1) -> 1
          n__d_3(6) -> 1
          n__d_3(9) -> 1
          n__d_3(12) -> 1
          n__d_4(1) -> 1
          n__d_4(6) -> 1
          n__d_4(9) -> 1
          n__d_4(12) -> 1
          n__d_5(9) -> 1
          n__d_6(12) -> 1
          n__f_0(1) -> 1
          n__f_1(1) -> 1
          n__f_1(3) -> 1
          n__f_1(3) -> 2
          n__f_2(1) -> 1
          n__f_2(3) -> 1
          n__f_2(5) -> 4
          n__f_2(5) -> 6
          n__f_3(1) -> 1
          n__f_3(3) -> 1
          n__f_3(8) -> 7
          n__f_3(8) -> 9
          n__f_4(1) -> 1
          n__f_4(3) -> 1
          n__f_4(5) -> 6
          n__f_4(11) -> 10
          n__f_4(11) -> 12
          n__f_5(8) -> 9
          n__f_6(11) -> 12
          2 -> 1
          4 -> 6
          7 -> 9
          10 -> 12
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            activate(X) -> X
            activate(n__d(X)) -> d(X)
            activate(n__f(X)) -> f(X)
            c(X) -> d(activate(X))
            d(X) -> n__d(X)
            f(X) -> n__f(X)
            f(f(X)) -> c(n__f(g(n__f(X))))
            h(X) -> c(n__d(X))
        - Signature:
            {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1}
        - Obligation:
             derivational complexity wrt. signature {activate,c,d,f,g,h,n__d,n__f}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))