/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)
            length() -> 0()
            length() -> s(length1())
            length1() -> length()
        - Signature:
            {from/1,length/0,length1/0} / {0/0,cons/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X)
            length() -> 0()
            length() -> s(length1())
            length1() -> length()
        - Signature:
            {from/1,length/0,length1/0} / {0/0,cons/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            from(X) -> cons(X)
            length() -> 0()
            length() -> s(length1())
            length1() -> length()
        - Signature:
            {from/1,length/0,length1/0} / {0/0,cons/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {from,length,length1} 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"(0, 0, 0)
          F (TrsFun "cons") :: ["A"(1, 2, 1)] -(0)-> "A"(0, 1, 1)
          F (TrsFun "from") :: ["A"(0, 0, 1)] -(1)-> "A"(0, 1, 1)
          F (TrsFun "length") :: [] -(1)-> "A"(0, 0, 0)
          F (TrsFun "length1") :: [] -(1)-> "A"(0, 0, 0)
          F (TrsFun "main") :: [] -(1)-> "A"(0, 0, 0)
          F (TrsFun "s") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        
        
        Following Still Strict Rules were Typed as:
        -------------------------------------------
        1. Strict:
          from(X) -> cons(X)
          length() -> 0()
          length() -> s(length1())
          length1() -> length()
          main() -> length1()
        2. Weak:
          
        

MAYBE