/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(s(X)) -> f(X)
            g(cons(0(),Y)) -> g(Y)
            g(cons(s(X),Y)) -> s(X)
            h(cons(X,Y)) -> h(g(cons(X,Y)))
        - Signature:
            {f/1,g/1,h/1} / {0/0,cons/2,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,cons,f,g,h,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
          cons_0(1,1) -> 1
          cons_1(1,1) -> 3
          f_0(1) -> 1
          f_1(1) -> 1
          f_2(1) -> 1
          g_0(1) -> 1
          g_1(1) -> 1
          g_1(1) -> 2
          g_1(3) -> 2
          h_0(1) -> 1
          h_1(2) -> 1
          s_0(1) -> 1
          s_1(1) -> 1
          s_1(1) -> 2
          s_2(1) -> 2
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(s(X)) -> f(X)
            g(cons(0(),Y)) -> g(Y)
            g(cons(s(X),Y)) -> s(X)
            h(cons(X,Y)) -> h(g(cons(X,Y)))
        - Signature:
            {f/1,g/1,h/1} / {0/0,cons/2,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,cons,f,g,h,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))