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


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


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

MAYBE