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

WORST_CASE(?,O(n^1))