/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(f(f(x))) -> q(f(g(x)))
            p(g(g(x))) -> q(g(f(x)))
            q(f(f(x))) -> p(f(g(x)))
            q(g(g(x))) -> p(g(f(x)))
        - Signature:
            {p/1,q/1} / {f/1,g/1}
        - Obligation:
             derivational complexity wrt. signature {f,g,p,q}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          f_0(1) -> 1
          f_1(1) -> 4
          f_1(3) -> 2
          g_0(1) -> 1
          g_1(1) -> 3
          g_1(4) -> 2
          p_0(1) -> 1
          p_1(2) -> 1
          q_0(1) -> 1
          q_1(2) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            p(f(f(x))) -> q(f(g(x)))
            p(g(g(x))) -> q(g(f(x)))
            q(f(f(x))) -> p(f(g(x)))
            q(g(g(x))) -> p(g(f(x)))
        - Signature:
            {p/1,q/1} / {f/1,g/1}
        - Obligation:
             derivational complexity wrt. signature {f,g,p,q}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))