/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(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             derivational complexity wrt. signature {f,h,s}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          f_0(1,1) -> 1
          f_1(4,1) -> 3
          h_0(1) -> 1
          h_1(1) -> 4
          h_1(2) -> 1
          s_0(1) -> 1
          s_1(3) -> 2
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             derivational complexity wrt. signature {f,h,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))