/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(a(),f(a(),x)) -> f(a(),f(x,f(f(a(),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 1.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_1() -> 2
          a_1() -> 6
          a_1() -> 7
          a_1() -> 8
          f_0(1,1) -> 1
          f_1(1,4) -> 3
          f_1(2,3) -> 1
          f_1(3,4) -> 3
          f_1(4,4) -> 3
          f_1(5,6) -> 4
          f_1(7,8) -> 5
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(a(),f(a(),x)) -> f(a(),f(x,f(f(a(),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))