/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:
            evenodd(x,0()) -> not(evenodd(x,s(0())))
            evenodd(0(),s(0())) -> false()
            evenodd(s(x),s(0())) -> evenodd(x,0())
            not(false()) -> true()
            not(true()) -> false()
        - Signature:
            {evenodd/2,not/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             derivational complexity wrt. signature {0,evenodd,false,not,s,true}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 3.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 4
          0_2() -> 7
          evenodd_0(1,1) -> 1
          evenodd_1(1,3) -> 2
          evenodd_1(1,4) -> 1
          evenodd_1(1,4) -> 2
          evenodd_1(1,4) -> 5
          evenodd_2(1,6) -> 5
          false_0() -> 1
          false_1() -> 1
          false_1() -> 2
          false_1() -> 5
          false_2() -> 1
          false_3() -> 1
          false_3() -> 2
          false_3() -> 5
          not_0(1) -> 1
          not_1(2) -> 1
          not_2(5) -> 1
          not_2(5) -> 2
          not_2(5) -> 5
          s_0(1) -> 1
          s_1(4) -> 3
          s_2(7) -> 6
          true_0() -> 1
          true_1() -> 1
          true_2() -> 1
          true_2() -> 2
          true_2() -> 5
          true_3() -> 1
          true_3() -> 2
          true_3() -> 5
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            evenodd(x,0()) -> not(evenodd(x,s(0())))
            evenodd(0(),s(0())) -> false()
            evenodd(s(x),s(0())) -> evenodd(x,0())
            not(false()) -> true()
            not(true()) -> false()
        - Signature:
            {evenodd/2,not/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             derivational complexity wrt. signature {0,evenodd,false,not,s,true}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))