/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /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__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,activate,cons,f,n__f,p,s}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 1
          0_1() -> 2
          0_1() -> 5
          0_2() -> 1
          activate_0(1) -> 1
          cons_0(1,1) -> 1
          cons_1(2,3) -> 1
          cons_2(1,6) -> 1
          f_0(1) -> 1
          f_1(1) -> 1
          n__f_0(1) -> 1
          n__f_1(1) -> 1
          n__f_1(4) -> 3
          n__f_2(1) -> 1
          n__f_2(7) -> 6
          p_0(1) -> 1
          p_1(4) -> 1
          s_0(1) -> 1
          s_1(5) -> 4
          s_2(1) -> 7
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,activate,cons,f,n__f,p,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))