/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(0()) -> s(0())
            f(s(0())) -> s(0())
            f(s(s(x))) -> f(f(s(x)))
        - Signature:
            {f/1} / {0/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,f,s}
    + 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() -> 5
          0_3() -> 8
          f_0(1) -> 1
          f_1(1) -> 3
          f_1(3) -> 1
          f_1(3) -> 3
          f_1(4) -> 3
          f_2(3) -> 6
          f_2(6) -> 3
          f_2(7) -> 6
          s_0(1) -> 1
          s_1(1) -> 4
          s_1(2) -> 1
          s_1(2) -> 3
          s_1(5) -> 1
          s_2(2) -> 7
          s_2(5) -> 1
          s_2(5) -> 3
          s_2(5) -> 6
          s_3(8) -> 3
          s_3(8) -> 6
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(0()) -> s(0())
            f(s(0())) -> s(0())
            f(s(s(x))) -> f(f(s(x)))
        - Signature:
            {f/1} / {0/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,f,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))