/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(x,f(a(),a())) -> f(a(),f(f(f(a(),a()),a()),x))
        - Signature:
            {f/2} / {a/0}
        - Obligation:
             derivational complexity wrt. signature {a,f}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_1() -> 3
          a_1() -> 7
          a_1() -> 8
          a_1() -> 9
          f_0(1,1) -> 2
          f_0(1,2) -> 2
          f_0(2,1) -> 2
          f_0(2,2) -> 2
          f_1(3,4) -> 2
          f_1(5,1) -> 4
          f_1(5,2) -> 4
          f_1(5,5) -> 10
          f_1(6,7) -> 5
          f_1(8,9) -> 6
          f_1(9,10) -> 4
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(x,f(a(),a())) -> f(a(),f(f(f(a(),a()),a()),x))
        - Signature:
            {f/2} / {a/0}
        - Obligation:
             derivational complexity wrt. signature {a,f}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))