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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(0(),x2) -> 0()
            f(S(x),x2) -> f(x2,x)
        - Signature:
            {f/2} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {0,S}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(0(),x2) -> 0()
            f(S(x),x2) -> f(x2,x)
        - Signature:
            {f/2} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {0,S}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(7)
          0 :: [] -(0)-> "A"(14)
          S :: ["A"(7)] -(7)-> "A"(7)
          f :: ["A"(7) x "A"(7)] -(7)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "S_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))