/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:
            f(g(f(a()),h(a(),f(a())))) -> f(h(g(f(a()),a()),g(f(a()),f(a()))))
        - Signature:
            {f/1} / {a/0,g/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {a,f,g,h}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_1() -> 6
          a_1() -> 7
          a_1() -> 10
          a_1() -> 11
          f_0(1) -> 1
          f_1(2) -> 1
          f_1(7) -> 5
          f_1(10) -> 8
          f_1(11) -> 9
          g_0(1,1) -> 1
          g_1(5,6) -> 3
          g_1(8,9) -> 4
          h_0(1,1) -> 1
          h_1(3,4) -> 2
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(g(f(a()),h(a(),f(a())))) -> f(h(g(f(a()),a()),g(f(a()),f(a()))))
        - Signature:
            {f/1} / {a/0,g/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {a,f,g,h}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))