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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1} / {a/1,e/1,u/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {b,c,d,v} and constructors {a,e,u}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1} / {a/1,e/1,u/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {b,c,d,v} and constructors {a,e,u}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          a :: ["A"(0)] -(0)-> "A"(6)
          b :: ["A"(4)] -(6)-> "A"(0)
          c :: ["A"(10)] -(7)-> "A"(0)
          d :: ["A"(10)] -(8)-> "A"(0)
          e :: ["A"(0)] -(0)-> "A"(14)
          e :: ["A"(0)] -(0)-> "A"(10)
          u :: ["A"(4)] -(0)-> "A"(4)
          u :: ["A"(10)] -(0)-> "A"(10)
          v :: ["A"(14)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "a_A" :: ["A"(0)] -(0)-> "A"(1)
          "e_A" :: ["A"(0)] -(0)-> "A"(1)
          "u_A" :: ["A"(1)] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))