/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /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:
            c(a(b(a(x1)))) -> a(b(a(a(c(a(b(c(a(b(x1))))))))))
        - Signature:
            {c/1} / {a/1,b/1}
        - Obligation:
            innermost 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(2) -> 1
          a_1(2) -> 8
          a_1(4) -> 3
          a_1(5) -> 4
          a_1(7) -> 6
          a_1(10) -> 9
          a_2(11) -> 5
          a_2(11) -> 8
          a_2(13) -> 12
          a_2(14) -> 13
          a_2(16) -> 15
          a_2(19) -> 18
          a_3(20) -> 17
          a_3(22) -> 21
          a_3(23) -> 22
          a_3(25) -> 24
          a_3(28) -> 27
          a_3(29) -> 14
          a_3(31) -> 30
          a_3(32) -> 31
          a_3(34) -> 33
          a_3(37) -> 36
          b_0(1) -> 1
          b_1(1) -> 10
          b_1(2) -> 10
          b_1(3) -> 2
          b_1(4) -> 10
          b_1(8) -> 7
          b_2(2) -> 19
          b_2(5) -> 19
          b_2(11) -> 19
          b_2(12) -> 11
          b_2(17) -> 16
          b_3(11) -> 28
          b_3(20) -> 37
          b_3(21) -> 20
          b_3(26) -> 25
          b_3(30) -> 29
          b_3(35) -> 34
          c_0(1) -> 1
          c_1(6) -> 5
          c_1(9) -> 8
          c_2(15) -> 14
          c_2(18) -> 17
          c_3(24) -> 23
          c_3(27) -> 26
          c_3(33) -> 32
          c_3(36) -> 35
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            c(a(b(a(x1)))) -> a(b(a(a(c(a(b(c(a(b(x1))))))))))
        - Signature:
            {c/1} / {a/1,b/1}
        - Obligation:
            innermost 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))