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


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


MAYBE
* Step 1: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            length(cons(X,Y)) -> s(length1(Y))
            length(nil()) -> 0()
            length1(X) -> length(X)
        - Signature:
            {from/1,length/1,length1/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            length(cons(X,Y)) -> s(length1(Y))
            length(nil()) -> 0()
            length1(X) -> length(X)
        - Signature:
            {from/1,length/1,length1/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X,from(s(X)))
            length(cons(X,Y)) -> s(length1(Y))
            length(nil()) -> 0()
            length1(X) -> length(X)
        - Signature:
            {from/1,length/1,length1/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,nil,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"(0)
          F (TrsFun "cons") :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          F (TrsFun "cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "from") :: ["A"(0)] -(1)-> "A"(0)
          F (TrsFun "length") :: ["A"(1)] -(1)-> "A"(0)
          F (TrsFun "length1") :: ["A"(1)] -(1)-> "A"(0)
          F (TrsFun "main") :: ["A"(1)] -(1)-> "A"(0)
          F (TrsFun "nil") :: [] -(0)-> "A"(1)
          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:
          from(X) -> cons(X,from(s(X)))
          length(cons(X,Y)) -> s(length1(Y))
          length(nil()) -> 0()
          length1(X) -> length(X)
          main(x1) -> length1(x1)
        2. Weak:
          
        

MAYBE