/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:
            a() -> n__a()
            activate(X) -> X
            activate(n__a()) -> a()
            activate(n__f(X)) -> f(X)
            activate(n__g(X)) -> g(X)
            f(X) -> n__f(X)
            f(n__f(n__a())) -> f(n__g(f(n__a())))
            g(X) -> n__g(X)
        - Signature:
            {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1}
        - Obligation:
             derivational complexity wrt. signature {a,activate,f,g,n__a,n__f,n__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() -> 1
          activate_0(1) -> 1
          f_0(1) -> 1
          f_1(1) -> 1
          f_1(2) -> 1
          f_2(2) -> 1
          f_2(4) -> 3
          g_0(1) -> 1
          g_1(1) -> 1
          n__a_0() -> 1
          n__a_1() -> 1
          n__a_2() -> 1
          n__a_2() -> 4
          n__f_0(1) -> 1
          n__f_1(1) -> 1
          n__f_2(1) -> 1
          n__f_2(2) -> 1
          n__f_3(2) -> 1
          n__f_3(4) -> 3
          n__g_0(1) -> 1
          n__g_1(1) -> 1
          n__g_2(1) -> 1
          n__g_2(3) -> 2
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a() -> n__a()
            activate(X) -> X
            activate(n__a()) -> a()
            activate(n__f(X)) -> f(X)
            activate(n__g(X)) -> g(X)
            f(X) -> n__f(X)
            f(n__f(n__a())) -> f(n__g(f(n__a())))
            g(X) -> n__g(X)
        - Signature:
            {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1}
        - Obligation:
             derivational complexity wrt. signature {a,activate,f,g,n__a,n__f,n__g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))