/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__zeros()) -> zeros()
            tail(cons(X,XS)) -> activate(XS)
            zeros() -> cons(0(),n__zeros())
            zeros() -> n__zeros()
        - Signature:
            {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0}
        - Obligation:
             derivational complexity wrt. signature {0,activate,cons,n__zeros,tail,zeros}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 3.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 2
          0_2() -> 4
          0_3() -> 6
          activate_0(1) -> 1
          activate_1(1) -> 1
          activate_1(3) -> 1
          activate_1(5) -> 1
          activate_1(7) -> 1
          cons_0(1,1) -> 1
          cons_1(2,3) -> 1
          cons_2(4,5) -> 1
          cons_3(6,7) -> 1
          n__zeros_0() -> 1
          n__zeros_1() -> 1
          n__zeros_1() -> 3
          n__zeros_2() -> 1
          n__zeros_2() -> 5
          n__zeros_3() -> 1
          n__zeros_3() -> 7
          tail_0(1) -> 1
          zeros_0() -> 1
          zeros_1() -> 1
          zeros_2() -> 1
          3 -> 1
          5 -> 1
          7 -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            activate(X) -> X
            activate(n__zeros()) -> zeros()
            tail(cons(X,XS)) -> activate(XS)
            zeros() -> cons(0(),n__zeros())
            zeros() -> n__zeros()
        - Signature:
            {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0}
        - Obligation:
             derivational complexity wrt. signature {0,activate,cons,n__zeros,tail,zeros}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))