/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__first(X1,X2)) -> first(X1,X2)
            activate(n__from(X)) -> from(X)
            first(X1,X2) -> n__first(X1,X2)
            first(0(),Z) -> nil()
            first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Z)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,first/2,from/1,sel/2} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,first,from,sel} and constructors {0,cons
            ,n__first,n__from,nil,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__first(X1,X2)) -> first(X1,X2)
            activate(n__from(X)) -> from(X)
            first(X1,X2) -> n__first(X1,X2)
            first(0(),Z) -> nil()
            first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Z)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,first/2,from/1,sel/2} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,first,from,sel} and constructors {0,cons
            ,n__first,n__from,nil,s}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing, isBestCase = False, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(13)
          F (TrsFun "0") :: [] -(0)-> "A"(12)
          F (TrsFun "activate") :: ["A"(13)] -(15)-> "A"(13)
          F (TrsFun "cons") :: ["A"(0) x "A"(13)] -(13)-> "A"(13)
          F (TrsFun "first") :: ["A"(13) x "A"(13)] -(14)-> "A"(13)
          F (TrsFun "from") :: ["A"(0)] -(14)-> "A"(13)
          F (TrsFun "n__first") :: ["A"(13) x "A"(13)] -(0)-> "A"(13)
          F (TrsFun "n__from") :: ["A"(0)] -(0)-> "A"(13)
          F (TrsFun "n__from") :: ["A"(0)] -(0)-> "A"(14)
          F (TrsFun "nil") :: [] -(0)-> "A"(14)
          F (TrsFun "s") :: ["A"(13)] -(13)-> "A"(13)
          F (TrsFun "s") :: ["A"(12)] -(12)-> "A"(12)
          F (TrsFun "s") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "sel") :: ["A"(12) x "A"(13)] -(12)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"0\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"n__first\")_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
          "F (TrsFun \"n__from\")_A" :: ["A"(0)] -(0)-> "A"(1)
          "F (TrsFun \"nil\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"s\")_A" :: ["A"(1)] -(1)-> "A"(1)
        
        

WORST_CASE(?,O(n^1))