/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(b(c(a(x1))))
            a(c(b(x1))) -> b(a(b(a(x1))))
            b(x1) -> c(a(c(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 5.
        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(5) -> 4
          a_1(6) -> 5
          a_1(8) -> 7
          a_1(18) -> 4
          a_1(27) -> 4
          a_2(2) -> 17
          a_2(5) -> 20
          a_2(6) -> 17
          a_2(10) -> 9
          a_2(12) -> 11
          a_2(14) -> 13
          a_2(15) -> 4
          a_2(15) -> 20
          a_2(18) -> 20
          a_2(19) -> 18
          a_2(27) -> 20
          a_2(28) -> 17
          a_3(18) -> 29
          a_3(19) -> 36
          a_3(22) -> 21
          a_3(24) -> 23
          a_3(26) -> 25
          a_3(27) -> 29
          a_3(28) -> 27
          a_3(34) -> 20
          a_3(34) -> 29
          a_4(28) -> 41
          a_4(31) -> 30
          a_4(33) -> 32
          a_4(38) -> 37
          a_4(39) -> 29
          a_5(43) -> 42
          b_0(1) -> 1
          b_1(3) -> 2
          b_1(4) -> 6
          b_1(5) -> 1
          b_1(5) -> 4
          b_1(5) -> 7
          b_2(16) -> 15
          b_2(18) -> 4
          b_2(18) -> 5
          b_2(18) -> 7
          b_2(18) -> 11
          b_2(20) -> 19
          b_3(27) -> 11
          b_3(27) -> 13
          b_3(27) -> 17
          b_3(29) -> 28
          b_3(35) -> 34
          b_4(40) -> 39
          c_0(1) -> 1
          c_1(1) -> 8
          c_1(4) -> 3
          c_1(7) -> 1
          c_2(3) -> 10
          c_2(4) -> 12
          c_2(5) -> 14
          c_2(9) -> 2
          c_2(11) -> 6
          c_2(13) -> 1
          c_2(13) -> 4
          c_2(13) -> 7
          c_2(17) -> 16
          c_2(18) -> 16
          c_3(16) -> 22
          c_3(18) -> 24
          c_3(20) -> 26
          c_3(21) -> 15
          c_3(23) -> 4
          c_3(23) -> 5
          c_3(23) -> 7
          c_3(23) -> 11
          c_3(25) -> 19
          c_3(27) -> 35
          c_3(36) -> 35
          c_4(27) -> 31
          c_4(29) -> 33
          c_4(30) -> 11
          c_4(30) -> 13
          c_4(30) -> 17
          c_4(32) -> 28
          c_4(35) -> 38
          c_4(37) -> 34
          c_4(41) -> 40
          c_5(40) -> 43
          c_5(42) -> 39
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(a(x1)) -> a(b(c(a(x1))))
            a(c(b(x1))) -> b(a(b(a(x1))))
            b(x1) -> c(a(c(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))