/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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:
            innermost 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: 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:
            innermost 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: Ara 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:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(8)
          activate :: ["A"(14)] -(1)-> "A"(0)
          and :: ["A"(0) x "A"(14)] -(3)-> "A"(0)
          plus :: ["A"(14) x "A"(8)] -(8)-> "A"(2)
          s :: ["A"(8)] -(8)-> "A"(8)
          s :: ["A"(2)] -(2)-> "A"(2)
          tt :: [] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "s_A" :: ["A"(1)] -(1)-> "A"(1)
          "tt_A" :: [] -(0)-> "A"(1)
        

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