/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),O(n^1))
* Step 1: Sum.  WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            conv(0()) -> cons(nil(),0())
            conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
            half(0()) -> 0()
            half(s(0())) -> 0()
            half(s(s(x))) -> s(half(x))
            lastbit(0()) -> 0()
            lastbit(s(0())) -> s(0())
            lastbit(s(s(x))) -> lastbit(x)
        - Signature:
            {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            conv(0()) -> cons(nil(),0())
            conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
            half(0()) -> 0()
            half(s(0())) -> 0()
            half(s(s(x))) -> s(half(x))
            lastbit(0()) -> 0()
            lastbit(s(0())) -> s(0())
            lastbit(s(s(x))) -> lastbit(x)
        - Signature:
            {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:2: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            conv(0()) -> cons(nil(),0())
            conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
            half(0()) -> 0()
            half(s(0())) -> 0()
            half(s(s(x))) -> s(half(x))
            lastbit(0()) -> 0()
            lastbit(s(0())) -> s(0())
            lastbit(s(s(x))) -> lastbit(x)
        - Signature:
            {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          half(x){x -> s(s(x))} =
            half(s(s(x))) ->^+ s(half(x))
              = C[half(x) = half(x){}]

** Step 1.b:1: Ara.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            conv(0()) -> cons(nil(),0())
            conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
            half(0()) -> 0()
            half(s(0())) -> 0()
            half(s(s(x))) -> s(half(x))
            lastbit(0()) -> 0()
            lastbit(s(0())) -> s(0())
            lastbit(s(s(x))) -> lastbit(x)
        - Signature:
            {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 1, araTimeout = 8, araRuleShifting = Just 1, isBestCase = False, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(9)
          F (TrsFun "0") :: [] -(0)-> "A"(5)
          F (TrsFun "0") :: [] -(0)-> "A"(1)
          F (TrsFun "0") :: [] -(0)-> "A"(0)
          F (TrsFun "cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "conv") :: ["A"(9)] -(1)-> "A"(0)
          F (TrsFun "half") :: ["A"(5)] -(1)-> "A"(9)
          F (TrsFun "lastbit") :: ["A"(1)] -(1)-> "A"(0)
          F (TrsFun "nil") :: [] -(0)-> "A"(0)
          F (TrsFun "s") :: ["A"(9)] -(9)-> "A"(9)
          F (TrsFun "s") :: ["A"(5)] -(5)-> "A"(5)
          F (TrsFun "s") :: ["A"(1)] -(1)-> "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:
          conv(0()) -> cons(nil(),0())
          conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x)))
          half(0()) -> 0()
          half(s(0())) -> 0()
          half(s(s(x))) -> s(half(x))
          lastbit(0()) -> 0()
          lastbit(s(0())) -> s(0())
          lastbit(s(s(x))) -> lastbit(x)
        2. Weak:
          
        

WORST_CASE(Omega(n^1),O(n^1))