/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /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(c(x1)))))
            c(d(x1)) -> a(b(c(a(x1))))
        - Signature:
            {a/1,b/1,c/1} / {d/1}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        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) -> 5
          a_1(2) -> 8
          a_1(2) -> 17
          a_1(2) -> 18
          a_1(8) -> 7
          a_1(19) -> 4
          a_2(2) -> 11
          a_2(9) -> 4
          a_2(9) -> 7
          a_2(9) -> 16
          a_2(15) -> 2
          a_2(15) -> 8
          a_2(15) -> 17
          a_2(17) -> 16
          a_2(19) -> 1
          a_2(19) -> 4
          a_2(19) -> 5
          a_2(19) -> 7
          a_2(19) -> 8
          a_2(19) -> 17
          a_2(19) -> 18
          a_3(15) -> 23
          a_3(19) -> 17
          a_3(21) -> 11
          a_3(21) -> 16
          a_3(31) -> 17
          a_3(33) -> 32
          b_0(1) -> 1
          b_1(4) -> 3
          b_1(5) -> 8
          b_1(7) -> 2
          b_2(8) -> 20
          b_2(11) -> 10
          b_2(16) -> 15
          b_2(18) -> 17
          b_3(17) -> 22
          b_3(23) -> 22
          b_3(32) -> 31
          b_3(34) -> 33
          c_0(1) -> 1
          c_1(1) -> 5
          c_1(2) -> 5
          c_1(3) -> 2
          c_1(4) -> 7
          c_1(5) -> 1
          c_1(19) -> 5
          c_2(1) -> 18
          c_2(2) -> 18
          c_2(4) -> 6
          c_2(5) -> 12
          c_2(6) -> 3
          c_2(7) -> 13
          c_2(9) -> 18
          c_2(10) -> 9
          c_2(12) -> 8
          c_2(13) -> 2
          c_2(15) -> 18
          c_2(19) -> 18
          c_2(20) -> 19
          c_3(8) -> 24
          c_3(11) -> 14
          c_3(14) -> 10
          c_3(15) -> 34
          c_3(16) -> 25
          c_3(18) -> 26
          c_3(19) -> 34
          c_3(22) -> 21
          c_3(24) -> 20
          c_3(25) -> 15
          c_3(26) -> 17
          c_4(17) -> 27
          c_4(23) -> 27
          c_4(27) -> 22
          c_4(32) -> 35
          c_4(34) -> 36
          c_4(35) -> 31
          c_4(36) -> 33
          d_0(1) -> 1
* 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(c(x1)))))
            c(d(x1)) -> a(b(c(a(x1))))
        - Signature:
            {a/1,b/1,c/1} / {d/1}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))