/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:
            f(f(x)) -> f(c(f(x)))
            f(f(x)) -> f(d(f(x)))
            g(c(x)) -> x
            g(c(1())) -> g(d(h(0())))
            g(c(h(0()))) -> g(d(1()))
            g(d(x)) -> x
            g(h(x)) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1,h/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,1,c,d,f,g,h}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 6
          0_1() -> 14
          1_0() -> 2
          1_0() -> 6
          1_1() -> 6
          1_1() -> 13
          c_0(1) -> 3
          c_0(1) -> 6
          c_0(2) -> 3
          c_0(2) -> 6
          c_0(3) -> 3
          c_0(3) -> 6
          c_0(4) -> 3
          c_0(4) -> 6
          c_0(5) -> 3
          c_0(5) -> 6
          c_0(6) -> 3
          c_0(6) -> 6
          c_0(7) -> 3
          c_0(7) -> 6
          c_1(9) -> 8
          c_2(11) -> 10
          d_0(1) -> 4
          d_0(1) -> 6
          d_0(2) -> 4
          d_0(2) -> 6
          d_0(3) -> 4
          d_0(3) -> 6
          d_0(4) -> 4
          d_0(4) -> 6
          d_0(5) -> 4
          d_0(5) -> 6
          d_0(6) -> 4
          d_0(6) -> 6
          d_0(7) -> 4
          d_0(7) -> 6
          d_1(9) -> 8
          d_1(13) -> 12
          d_2(11) -> 10
          f_0(1) -> 5
          f_0(1) -> 6
          f_0(2) -> 5
          f_0(2) -> 6
          f_0(3) -> 5
          f_0(3) -> 6
          f_0(4) -> 5
          f_0(4) -> 6
          f_0(5) -> 5
          f_0(5) -> 6
          f_0(6) -> 5
          f_0(6) -> 6
          f_0(7) -> 5
          f_0(7) -> 6
          f_1(1) -> 9
          f_1(2) -> 9
          f_1(3) -> 9
          f_1(4) -> 9
          f_1(5) -> 9
          f_1(6) -> 9
          f_1(7) -> 9
          f_1(8) -> 5
          f_1(8) -> 6
          f_1(8) -> 9
          f_2(8) -> 11
          f_2(10) -> 9
          g_0(1) -> 6
          g_0(2) -> 6
          g_0(3) -> 6
          g_0(4) -> 6
          g_0(5) -> 6
          g_0(6) -> 6
          g_0(7) -> 6
          g_1(1) -> 6
          g_1(2) -> 6
          g_1(3) -> 6
          g_1(4) -> 6
          g_1(5) -> 6
          g_1(6) -> 6
          g_1(7) -> 6
          g_1(12) -> 6
          g_1(14) -> 6
          g_2(14) -> 6
          h_0(1) -> 6
          h_0(1) -> 7
          h_0(2) -> 6
          h_0(2) -> 7
          h_0(3) -> 6
          h_0(3) -> 7
          h_0(4) -> 6
          h_0(4) -> 7
          h_0(5) -> 6
          h_0(5) -> 7
          h_0(6) -> 6
          h_0(6) -> 7
          h_0(7) -> 6
          h_0(7) -> 7
          h_1(14) -> 6
          h_1(14) -> 13
          1 -> 6
          2 -> 6
          3 -> 6
          4 -> 6
          5 -> 6
          7 -> 6
          13 -> 6
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(f(x)) -> f(c(f(x)))
            f(f(x)) -> f(d(f(x)))
            g(c(x)) -> x
            g(c(1())) -> g(d(h(0())))
            g(c(h(0()))) -> g(d(1()))
            g(d(x)) -> x
            g(h(x)) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1,h/1}
        - Obligation:
            innermost derivational complexity wrt. signature {0,1,c,d,f,g,h}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))