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


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


MAYBE
* Step 1: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            f(0()) -> 0()
            f(S(x)) -> x
            g(x) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,S}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  MAYBE
    + Considered Problem:
        - Strict TRS:
            f(0()) -> 0()
            f(S(x)) -> x
            g(x) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,S}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            f(0()) -> 0()
            f(S(x)) -> x
            g(x) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,S}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 3, araTimeout = 15, araRuleShifting = Just 1, isBestCase = True, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(0, 0, 0)
          F (TrsFun "S") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
          F (TrsFun "f") :: ["A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
          F (TrsFun "g") :: ["A"(0, 0, 1)] -(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(0()) -> 0()
          f(S(x)) -> x
          main(x1) -> g(x1)
        2. Weak:
          g(x) -> g(x)
        
* Step 4: Ara.  MAYBE
    + Considered Problem:
        - Strict TRS:
            g(x) -> g(x)
        - Weak TRS:
            f(0()) -> 0()
            f(S(x)) -> x
        - Signature:
            {f/1,g/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,S}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 3, araTimeout = 15, araRuleShifting = Just 1, isBestCase = True, mkCompletelyDefined = False, verboseOutput = False}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "0") :: [] -(0)-> "A"(0, 0, 0)
          F (TrsFun "S") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
          F (TrsFun "f") :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
          F (TrsFun "g") :: ["A"(0, 0, 1)] -(1)-> "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:
          g(x) -> g(x)
          main(x1) -> g(x1)
        2. Weak:
          
        

MAYBE