/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:
            p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
        - Signature:
            {p/2} / {a/1,b/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,p}
    + 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) -> 1
          a_1(1) -> 6
          a_1(1) -> 7
          a_1(2) -> 8
          a_1(4) -> 9
          a_1(7) -> 6
          a_1(9) -> 6
          b_0(1) -> 1
          b_1(1) -> 5
          b_1(6) -> 4
          p_0(1,1) -> 1
          p_1(1,7) -> 2
          p_1(2,3) -> 1
          p_1(3,8) -> 2
          p_1(4,5) -> 3
          p_1(5,9) -> 2
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(x3,a(x2)),p(b(a(x1)),b(x0)))
        - Signature:
            {p/2} / {a/1,b/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,p}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))