/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(n^1))
* Step 1: Bounds.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(0()) -> cons(0())
            f(s(0())) -> f(p(s(0())))
            p(s(X)) -> X
        - Signature:
            {f/1,p/1} / {0/0,cons/1,s/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,cons,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() -> 2
          0_1() -> 3
          0_2() -> 5
          cons_0(1) -> 1
          cons_1(2) -> 1
          cons_2(5) -> 1
          f_0(1) -> 1
          f_1(3) -> 1
          p_0(1) -> 1
          p_1(4) -> 3
          s_0(1) -> 1
          s_1(2) -> 4
          2 -> 3
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(0()) -> cons(0())
            f(s(0())) -> f(p(s(0())))
            p(s(X)) -> X
        - Signature:
            {f/1,p/1} / {0/0,cons/1,s/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,cons,f,p,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))