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

MAYBE