/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:
            b(a(b(a(a(x1))))) -> a(a(b(b(a(b(a(b(a(x1)))))))))
        - Signature:
            {b/1} / {a/1}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          a_0(1) -> 1
          a_0(2) -> 1
          a_1(1) -> 10
          a_1(2) -> 10
          a_1(3) -> 2
          a_1(3) -> 7
          a_1(3) -> 9
          a_1(4) -> 3
          a_1(7) -> 6
          a_1(9) -> 8
          a_2(3) -> 18
          a_2(4) -> 18
          a_2(11) -> 5
          a_2(11) -> 7
          a_2(11) -> 15
          a_2(12) -> 11
          a_2(15) -> 14
          a_2(17) -> 16
          a_2(19) -> 9
          a_2(19) -> 17
          a_2(20) -> 19
          a_2(23) -> 22
          a_2(25) -> 24
          a_3(19) -> 33
          a_3(20) -> 41
          a_3(26) -> 13
          a_3(27) -> 26
          a_3(30) -> 29
          a_3(32) -> 31
          a_3(34) -> 15
          a_3(34) -> 30
          a_3(35) -> 34
          a_3(38) -> 37
          a_3(40) -> 39
          a_3(42) -> 25
          a_3(43) -> 42
          a_3(46) -> 45
          a_3(48) -> 47
          a_3(49) -> 21
          a_3(50) -> 49
          a_3(53) -> 52
          a_3(55) -> 54
          a_3(56) -> 17
          a_3(56) -> 40
          a_3(57) -> 56
          a_3(60) -> 59
          a_3(62) -> 61
          a_4(43) -> 70
          a_4(56) -> 78
          a_4(57) -> 86
          a_4(63) -> 53
          a_4(64) -> 63
          a_4(67) -> 66
          a_4(69) -> 68
          a_4(71) -> 36
          a_4(72) -> 71
          a_4(75) -> 74
          a_4(77) -> 76
          a_4(79) -> 30
          a_4(79) -> 75
          a_4(80) -> 79
          a_4(83) -> 82
          a_4(85) -> 84
          b_0(1) -> 2
          b_0(2) -> 2
          b_1(3) -> 9
          b_1(5) -> 4
          b_1(6) -> 5
          b_1(8) -> 7
          b_1(9) -> 9
          b_1(10) -> 9
          b_2(11) -> 25
          b_2(13) -> 12
          b_2(14) -> 13
          b_2(16) -> 15
          b_2(17) -> 17
          b_2(18) -> 17
          b_2(19) -> 17
          b_2(21) -> 20
          b_2(22) -> 21
          b_2(24) -> 23
          b_3(25) -> 55
          b_3(26) -> 48
          b_3(28) -> 27
          b_3(29) -> 28
          b_3(31) -> 30
          b_3(33) -> 32
          b_3(36) -> 35
          b_3(37) -> 36
          b_3(39) -> 38
          b_3(40) -> 32
          b_3(41) -> 40
          b_3(44) -> 43
          b_3(45) -> 44
          b_3(47) -> 46
          b_3(49) -> 62
          b_3(51) -> 50
          b_3(52) -> 51
          b_3(54) -> 53
          b_3(56) -> 40
          b_3(58) -> 57
          b_3(59) -> 58
          b_3(61) -> 60
          b_4(65) -> 64
          b_4(66) -> 65
          b_4(68) -> 67
          b_4(70) -> 69
          b_4(73) -> 72
          b_4(74) -> 73
          b_4(76) -> 75
          b_4(78) -> 77
          b_4(81) -> 80
          b_4(82) -> 81
          b_4(84) -> 83
          b_4(86) -> 85
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            b(a(b(a(a(x1))))) -> a(a(b(b(a(b(a(b(a(x1)))))))))
        - Signature:
            {b/1} / {a/1}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))