/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /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()) -> 0()
            g(0()) -> 0()
            g(s(x)) -> f(g(x))
        - Signature:
            {f/1,g/1} / {0/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,f,g,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_2() -> 1
          0_2() -> 2
          f_0(1) -> 1
          f_1(2) -> 1
          f_1(2) -> 2
          g_0(1) -> 1
          g_1(1) -> 2
          s_0(1) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(0()) -> 0()
            g(0()) -> 0()
            g(s(x)) -> f(g(x))
        - Signature:
            {f/1,g/1} / {0/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {0,f,g,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))