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


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


WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            badd(x,Nil()) -> x
            badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs))
            goal(x,y) -> badd(x,y)
        - Signature:
            {badd/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            badd(x,Nil()) -> x
            badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs))
            goal(x,y) -> badd(x,y)
        - Signature:
            {badd/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 2.a:1: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            badd(x,Nil()) -> x
            badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs))
            goal(x,y) -> badd(x,y)
        - Signature:
            {badd/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 3, araTimeout = 15, araRuleShifting = Just 1, isBestCase = True, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "Cons") :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          F (TrsFun "Cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "Nil") :: [] -(0)-> "A"(1)
          F (TrsFun "Nil") :: [] -(0)-> "A"(0)
          F (TrsFun "badd") :: ["A"(0) x "A"(1)] -(1)-> "A"(0)
          F (TrsFun "goal") :: ["A"(0) x "A"(1)] -(1)-> "A"(0)
          F (TrsFun "main") :: ["A"(0) x "A"(1)] -(1)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        
        
        Following Still Strict Rules were Typed as:
        -------------------------------------------
        1. Strict:
          badd(x,Nil()) -> x
          badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs))
          goal(x,y) -> badd(x,y)
          main(x1,x2) -> goal(x1,x2)
        2. Weak:
          
        

** Step 2.b:1: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            badd(x,Nil()) -> x
            badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs))
            goal(x,y) -> badd(x,y)
        - Signature:
            {badd/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          badd(x,z){z -> Cons(y,z)} =
            badd(x,Cons(y,z)) ->^+ badd(Cons(Nil(),Nil()),badd(x,z))
              = C[badd(x,z) = badd(x,z){}]

WORST_CASE(Omega(n^1),?)