/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /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(y) -> y
            c(a(a(0(),x),y)) -> a(c(c(c(0()))),y)
            c(c(c(y))) -> c(c(a(y,0())))
        - Signature:
            {c/1} / {0/0,a/2}
        - Obligation:
             derivational complexity wrt. signature {0,a,c}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 3.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 2
          0_1() -> 3
          0_1() -> 4
          0_1() -> 5
          0_2() -> 10
          0_2() -> 13
          0_2() -> 14
          0_2() -> 15
          0_3() -> 18
          a_0(1,1) -> 1
          a_1(1,5) -> 1
          a_1(1,5) -> 6
          a_1(1,5) -> 7
          a_1(2,1) -> 1
          a_1(2,5) -> 1
          a_1(2,5) -> 6
          a_1(6,5) -> 1
          a_1(6,5) -> 6
          a_1(6,5) -> 7
          a_1(7,5) -> 1
          a_1(7,5) -> 6
          a_1(7,5) -> 7
          a_2(5,10) -> 2
          a_2(5,10) -> 8
          a_2(5,10) -> 9
          a_2(13,5) -> 1
          a_2(13,5) -> 6
          a_3(10,18) -> 13
          a_3(10,18) -> 16
          a_3(10,18) -> 17
          c_0(1) -> 1
          c_1(3) -> 2
          c_1(4) -> 2
          c_1(4) -> 3
          c_1(5) -> 2
          c_1(5) -> 3
          c_1(5) -> 4
          c_1(6) -> 1
          c_1(7) -> 1
          c_1(7) -> 6
          c_2(8) -> 2
          c_2(9) -> 2
          c_2(9) -> 8
          c_2(10) -> 13
          c_2(10) -> 14
          c_2(10) -> 15
          c_2(14) -> 13
          c_2(15) -> 13
          c_2(15) -> 14
          c_3(16) -> 13
          c_3(17) -> 13
          c_3(17) -> 16
          3 -> 2
          4 -> 2
          4 -> 3
          5 -> 2
          5 -> 3
          5 -> 4
          6 -> 1
          7 -> 1
          7 -> 6
          8 -> 2
          9 -> 2
          9 -> 8
          10 -> 13
          10 -> 14
          10 -> 15
          14 -> 13
          15 -> 13
          15 -> 14
          16 -> 13
          17 -> 13
          17 -> 16
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            c(y) -> y
            c(a(a(0(),x),y)) -> a(c(c(c(0()))),y)
            c(c(c(y))) -> c(c(a(y,0())))
        - Signature:
            {c/1} / {0/0,a/2}
        - Obligation:
             derivational complexity wrt. signature {0,a,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))