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

WORST_CASE(?,O(n^1))