/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),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,Z)
        - Signature:
            {from/1,sel/2} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,sel} and constructors {0,cons,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,Z)
        - Signature:
            {from/1,sel/2} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,sel} and constructors {0,cons,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 2.a:1: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,Z)
        - Signature:
            {from/1,sel/2} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,sel} and constructors {0,cons,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 "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 "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:
          from(X) -> cons(X,from(s(X)))
          sel(0(),cons(X,Y)) -> X
          sel(s(X),cons(Y,Z)) -> sel(X,Z)
          main(x1,x2) -> sel(x1,x2)
        2. Weak:
          
        

** Step 2.b:1: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,Z)
        - Signature:
            {from/1,sel/2} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,sel} and constructors {0,cons,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          sel(x,z){x -> s(x),z -> cons(y,z)} =
            sel(s(x),cons(y,z)) ->^+ sel(x,z)
              = C[sel(x,z) = sel(x,z){}]

WORST_CASE(Omega(n^1),?)