/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(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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) -> 10
          a_1(3) -> 2
          a_1(5) -> 4
          a_1(6) -> 5
          a_1(10) -> 9
          a_2(11) -> 7
          a_2(12) -> 11
          a_2(14) -> 13
          a_2(15) -> 14
          a_2(19) -> 18
          a_2(20) -> 10
          a_2(21) -> 20
          a_2(23) -> 22
          a_2(24) -> 23
          a_2(28) -> 27
          a_2(29) -> 28
          a_2(30) -> 29
          a_2(32) -> 31
          a_2(33) -> 32
          a_2(37) -> 36
          a_3(38) -> 37
          a_3(39) -> 38
          a_3(41) -> 40
          a_3(42) -> 41
          a_3(46) -> 45
          a_3(47) -> 25
          a_3(48) -> 47
          a_3(50) -> 49
          a_3(51) -> 50
          a_3(55) -> 54
          a_3(56) -> 34
          a_3(57) -> 56
          a_3(59) -> 58
          a_3(60) -> 59
          a_3(64) -> 63
          b_0(1) -> 1
          b_1(4) -> 3
          b_1(7) -> 6
          b_1(9) -> 8
          b_2(13) -> 12
          b_2(16) -> 15
          b_2(18) -> 17
          b_2(22) -> 21
          b_2(25) -> 24
          b_2(27) -> 26
          b_2(31) -> 30
          b_2(34) -> 33
          b_2(36) -> 35
          b_3(40) -> 39
          b_3(43) -> 42
          b_3(45) -> 44
          b_3(49) -> 48
          b_3(52) -> 51
          b_3(54) -> 53
          b_3(58) -> 57
          b_3(61) -> 60
          b_3(63) -> 62
          c_0(1) -> 1
          c_1(1) -> 10
          c_1(2) -> 10
          c_1(3) -> 10
          c_1(8) -> 7
          c_2(2) -> 19
          c_2(6) -> 28
          c_2(12) -> 37
          c_2(17) -> 16
          c_2(20) -> 19
          c_2(26) -> 25
          c_2(35) -> 34
          c_3(15) -> 46
          c_3(29) -> 55
          c_3(38) -> 64
          c_3(44) -> 43
          c_3(53) -> 52
          c_3(62) -> 61
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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))