/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /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:
            f(a(),a()) -> f(a(),b())
            f(a(),b()) -> f(s(a()),c())
            f(c(),c()) -> f(a(),a())
            f(s(X),c()) -> f(X,c())
        - Signature:
            {f/2} / {a/0,b/0,c/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,c,f,s}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_1() -> 2
          a_2() -> 6
          a_3() -> 9
          b_0() -> 1
          b_1() -> 3
          b_2() -> 8
          c_0() -> 1
          c_1() -> 3
          c_2() -> 5
          c_3() -> 7
          c_4() -> 10
          f_0(1,1) -> 1
          f_1(1,3) -> 1
          f_1(2,2) -> 1
          f_1(2,3) -> 1
          f_2(2,5) -> 1
          f_2(4,5) -> 1
          f_2(6,8) -> 1
          f_3(6,7) -> 1
          f_4(9,10) -> 1
          s_0(1) -> 1
          s_1(2) -> 2
          s_2(6) -> 4
          s_3(9) -> 6
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(a(),a()) -> f(a(),b())
            f(a(),b()) -> f(s(a()),c())
            f(c(),c()) -> f(a(),a())
            f(s(X),c()) -> f(X,c())
        - Signature:
            {f/2} / {a/0,b/0,c/0,s/1}
        - Obligation:
             derivational complexity wrt. signature {a,b,c,f,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))