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

WORST_CASE(?,O(n^1))