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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            after(0(),XS) -> XS
            after(s(N),cons(X,XS)) -> after(N,activate(XS))
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
        - Signature:
            {activate/1,after/2,from/1} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,after,from} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Ara.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            after(0(),XS) -> XS
            after(s(N),cons(X,XS)) -> after(N,activate(XS))
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
        - Signature:
            {activate/1,after/2,from/1} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,after,from} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 1, araTimeout = 8, araRuleShifting = Just 1, isBestCase = False, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(3)
          F (TrsFun "activate") :: ["A"(0)] -(2)-> "A"(0)
          F (TrsFun "after") :: ["A"(3) x "A"(0)] -(1)-> "A"(0)
          F (TrsFun "cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "from") :: ["A"(0)] -(1)-> "A"(0)
          F (TrsFun "n__from") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "s") :: ["A"(3)] -(3)-> "A"(3)
          F (TrsFun "s") :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        
        
        Following Still Strict Rules were Typed as:
        -------------------------------------------
        1. Strict:
          activate(X) -> X
          activate(n__from(X)) -> from(X)
          after(0(),XS) -> XS
          after(s(N),cons(X,XS)) -> after(N,activate(XS))
          from(X) -> cons(X,n__from(s(X)))
          from(X) -> n__from(X)
        2. Weak:
          
        

WORST_CASE(?,O(n^1))