/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,g()) -> a(f(),a(g(),a(f(),x)))
            a(f(),a(f(),x)) -> a(x,g())
        - Signature:
            {a/2} / {f/0,g/0}
        - Obligation:
             derivational complexity wrt. signature {a,f,g}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          a_0(1,1) -> 1
          a_1(1,4) -> 1
          a_1(1,4) -> 5
          a_1(1,4) -> 11
          a_1(2,3) -> 1
          a_1(3,4) -> 1
          a_1(4,4) -> 1
          a_1(4,4) -> 5
          a_1(4,4) -> 11
          a_1(4,5) -> 3
          a_1(4,8) -> 1
          a_1(4,19) -> 18
          a_1(6,1) -> 5
          a_1(6,6) -> 8
          a_1(6,12) -> 19
          a_1(6,18) -> 11
          a_1(10,4) -> 1
          a_2(3,7) -> 5
          a_2(3,7) -> 11
          a_2(7,11) -> 10
          a_2(9,10) -> 1
          a_2(10,7) -> 5
          a_2(12,1) -> 11
          a_2(12,3) -> 11
          a_2(12,4) -> 11
          a_2(12,10) -> 5
          a_2(12,10) -> 11
          a_2(12,12) -> 11
          a_3(10,15) -> 11
          a_3(13,14) -> 5
          a_3(15,16) -> 14
          a_3(17,3) -> 16
          a_3(17,10) -> 16
          a_3(17,14) -> 11
          a_4(20,21) -> 11
          a_4(22,23) -> 21
          a_4(24,10) -> 23
          f_0() -> 1
          f_1() -> 2
          f_1() -> 6
          f_2() -> 9
          f_2() -> 12
          f_3() -> 13
          f_3() -> 17
          f_4() -> 20
          f_4() -> 24
          g_0() -> 1
          g_1() -> 4
          g_2() -> 7
          g_3() -> 15
          g_4() -> 22
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(x,g()) -> a(f(),a(g(),a(f(),x)))
            a(f(),a(f(),x)) -> a(x,g())
        - Signature:
            {a/2} / {f/0,g/0}
        - Obligation:
             derivational complexity wrt. signature {a,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))