/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(n^1))
* Step 1: Sum 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:
            innermost runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: 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:
            innermost runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 3.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 9
          0_2() -> 12
          evenodd_0(1,1) -> 2
          evenodd_0(1,3) -> 2
          evenodd_0(1,5) -> 2
          evenodd_0(1,6) -> 2
          evenodd_0(3,1) -> 2
          evenodd_0(3,3) -> 2
          evenodd_0(3,5) -> 2
          evenodd_0(3,6) -> 2
          evenodd_0(5,1) -> 2
          evenodd_0(5,3) -> 2
          evenodd_0(5,5) -> 2
          evenodd_0(5,6) -> 2
          evenodd_0(6,1) -> 2
          evenodd_0(6,3) -> 2
          evenodd_0(6,5) -> 2
          evenodd_0(6,6) -> 2
          evenodd_1(1,8) -> 7
          evenodd_1(1,9) -> 2
          evenodd_1(1,9) -> 7
          evenodd_1(1,9) -> 10
          evenodd_1(3,8) -> 7
          evenodd_1(3,9) -> 2
          evenodd_1(3,9) -> 7
          evenodd_1(3,9) -> 10
          evenodd_1(5,8) -> 7
          evenodd_1(5,9) -> 2
          evenodd_1(5,9) -> 7
          evenodd_1(5,9) -> 10
          evenodd_1(6,8) -> 7
          evenodd_1(6,9) -> 2
          evenodd_1(6,9) -> 7
          evenodd_1(6,9) -> 10
          evenodd_2(1,11) -> 10
          evenodd_2(3,11) -> 10
          evenodd_2(5,11) -> 10
          evenodd_2(6,11) -> 10
          false_0() -> 3
          false_1() -> 2
          false_1() -> 4
          false_1() -> 7
          false_1() -> 10
          false_2() -> 2
          false_3() -> 2
          false_3() -> 7
          false_3() -> 10
          not_0(1) -> 4
          not_0(3) -> 4
          not_0(5) -> 4
          not_0(6) -> 4
          not_1(7) -> 2
          not_2(10) -> 2
          not_2(10) -> 7
          not_2(10) -> 10
          s_0(1) -> 5
          s_0(3) -> 5
          s_0(5) -> 5
          s_0(6) -> 5
          s_1(9) -> 8
          s_2(12) -> 11
          true_0() -> 6
          true_1() -> 4
          true_2() -> 2
          true_2() -> 7
          true_2() -> 10
          true_3() -> 2
          true_3() -> 7
          true_3() -> 10
* Step 3: 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:
            innermost runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))