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


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


WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum.  WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:2: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          plus(x,y){y -> s(y)} =
            plus(x,s(y)) ->^+ s(plus(x,y))
              = C[plus(x,y) = plus(x,y){}]

** Step 1.b:1: ToInnermost.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
** Step 1.b:2: Bounds.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 2
          0_0() -> 3
          activate_0(2) -> 1
          activate_1(2) -> 1
          and_0(2,2) -> 1
          plus_0(2,2) -> 1
          plus_1(2,2) -> 3
          s_0(2) -> 1
          s_0(2) -> 2
          s_0(2) -> 3
          s_1(3) -> 1
          s_1(3) -> 3
          tt_0() -> 1
          tt_0() -> 2
          tt_0() -> 3
          2 -> 1
          2 -> 3
** Step 1.b:3: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
        - Signature:
            {activate/1,and/2,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,and,plus} and constructors {0,s,tt}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(Omega(n^1),O(n^1))