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


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


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

** Step 2.b:1: DecreasingLoops.  WORST_CASE(NON_POLY,?)
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> f(a(g(g(f(x))),g(f(x))))
        - Signature:
            {f/1} / {a/2,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){x -> g(x)} =
            f(g(x)) ->^+ f(a(g(g(f(x))),g(f(x))))
              = C[f(x) = f(x){}]
          f(x){x -> g(x)} =
            f(g(x)) ->^+ f(a(g(g(f(x))),g(f(x))))
              = C[f(x) = f(x){}]

WORST_CASE(NON_POLY,?)