/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(b(x2),a(a(b(x1)))),p(x3,x0))
        - Signature:
            {p/2} / {a/1,b/1}
        - Obligation:
            innermost 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(6) -> 5
          a_1(7) -> 6
          b_0(1) -> 1
          b_1(1) -> 4
          b_1(1) -> 7
          b_1(2) -> 4
          b_1(3) -> 4
          b_1(5) -> 7
          p_0(1,1) -> 1
          p_1(1,1) -> 3
          p_1(2,3) -> 1
          p_1(2,3) -> 3
          p_1(3,1) -> 3
          p_1(4,5) -> 2
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            p(p(b(a(x0)),x1),p(x2,x3)) -> p(p(b(x2),a(a(b(x1)))),p(x3,x0))
        - Signature:
            {p/2} / {a/1,b/1}
        - Obligation:
            innermost 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))