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

** Step 1.b:1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x,a()) -> x
            f(x,g(y)) -> f(g(x),y)
        - Signature:
            {f/2} / {a/0,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {a,g}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          a :: [] -(0)-> "A"(1)
          f :: ["A"(0) x "A"(1)] -(1)-> "A"(0)
          g :: ["A"(1)] -(1)-> "A"(1)
          g :: ["A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "a_A" :: [] -(0)-> "A"(0)
          "g_A" :: ["A"(0)] -(0)-> "A"(0)
        

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