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


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


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

MAYBE