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

** Step 1.b:1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(x,0()) -> x
            +(x,s(y)) -> s(+(x,y))
            +(s(x),y) -> s(+(x,y))
            double(x) -> +(x,x)
            double(0()) -> 0()
            double(s(x)) -> s(s(double(x)))
        - Signature:
            {+/2,double/1} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+,double} and constructors {0,s}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          + :: ["A"(3) x "A"(8)] -(4)-> "A"(0)
          0 :: [] -(0)-> "A"(8)
          0 :: [] -(0)-> "A"(11)
          0 :: [] -(0)-> "A"(14)
          double :: ["A"(11)] -(8)-> "A"(0)
          s :: ["A"(8)] -(8)-> "A"(8)
          s :: ["A"(3)] -(3)-> "A"(3)
          s :: ["A"(11)] -(11)-> "A"(11)
          s :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "s_A" :: ["A"(1)] -(1)-> "A"(1)
        

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