/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:
            a(x,y) -> b(x,b(0(),c(y)))
            b(y,0()) -> y
            c(b(y,c(x))) -> c(c(b(a(0(),0()),y)))
        - Signature:
            {a/2,b/2,c/1} / {0/0}
        - Obligation:
             derivational complexity wrt. signature {0,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.
          0_0() -> 1
          0_1() -> 3
          0_2() -> 9
          0_3() -> 16
          a_0(1,1) -> 1
          a_1(3,3) -> 6
          a_1(3,3) -> 7
          a_2(9,9) -> 14
          b_0(1,1) -> 1
          b_1(1,2) -> 1
          b_1(3,4) -> 2
          b_1(7,1) -> 6
          b_1(7,7) -> 11
          b_2(3,8) -> 6
          b_2(3,8) -> 7
          b_2(9,10) -> 8
          b_2(14,7) -> 13
          b_3(9,15) -> 14
          b_3(16,17) -> 15
          c_0(1) -> 1
          c_1(1) -> 4
          c_1(5) -> 1
          c_1(5) -> 4
          c_1(6) -> 5
          c_1(11) -> 6
          c_2(3) -> 10
          c_2(12) -> 5
          c_2(13) -> 12
          c_3(9) -> 17
          7 -> 6
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(x,y) -> b(x,b(0(),c(y)))
            b(y,0()) -> y
            c(b(y,c(x))) -> c(c(b(a(0(),0()),y)))
        - Signature:
            {a/2,b/2,c/1} / {0/0}
        - Obligation:
             derivational complexity wrt. signature {0,a,b,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))