/bin/sh: line 1: 42164 Quit                    (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41999-63 > /tmp/SMTS41999-65
/bin/sh: line 1: 42190 Quit                    (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41999-37 > /tmp/SMTS41999-39
/bin/sh: line 1: 42166 Quit                    (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41999-54 > /tmp/SMTS41999-55
/bin/sh: line 1: 42198 Quit                    (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41999-32 > /tmp/SMTS41999-33
/bin/sh: line 1: 42206 Quit                    (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41999-60 > /tmp/SMTS41999-61
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)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:2: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 3, araTimeout = 15, araRuleShifting = Just 1, isBestCase = True, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(1)
          F (TrsFun "activate") :: ["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 "main") :: ["A"(1) x "A"(0)] -(1)-> "A"(0)
          F (TrsFun "n__from") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "s") :: ["A"(1)] -(1)-> "A"(1)
          F (TrsFun "s") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "sel") :: ["A"(1) x "A"(0)] -(1)-> "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)
          from(X) -> cons(X,n__from(s(X)))
          from(X) -> n__from(X)
          sel(0(),cons(X,Y)) -> X
          sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
          main(x1,x2) -> sel(x1,x2)
        2. Weak:
          
        

** Step 1.b:1: Ara.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} 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 "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)
          F (TrsFun "sel") :: ["A"(3) x "A"(0)] -(1)-> "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)
          from(X) -> cons(X,n__from(s(X)))
          from(X) -> n__from(X)
          sel(0(),cons(X,Y)) -> X
          sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        2. Weak:
          
        

WORST_CASE(?,O(n^1))