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

WORST_CASE(?,O(n^1))