MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            -(x,0()) -> x
            -(s(x),s(y)) -> -(x,y)
            gcd(0(),s(x)) -> s(x)
            gcd(s(x),0()) -> s(x)
            gcd(s(x),s(y)) -> gcd(-(max(x,y),min(x,y)),s(min(x,y)))
            max(x,0()) -> x
            max(0(),y) -> y
            max(s(x),s(y)) -> s(max(x,y))
            min(x,0()) -> 0()
            min(0(),y) -> 0()
            min(s(x),s(y)) -> s(min(x,y))
        - Signature:
            {-/2,gcd/2,max/2,min/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {-,gcd,max,min} and constructors {0,s}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          -#(x,0()) -> c_1()
          -#(s(x),s(y)) -> c_2(-#(x,y))
          gcd#(0(),s(x)) -> c_3()
          gcd#(s(x),0()) -> c_4()
          gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                ,-#(max(x,y),min(x,y))
                                ,max#(x,y)
                                ,min#(x,y)
                                ,min#(x,y))
          max#(x,0()) -> c_6()
          max#(0(),y) -> c_7()
          max#(s(x),s(y)) -> c_8(max#(x,y))
          min#(x,0()) -> c_9()
          min#(0(),y) -> c_10()
          min#(s(x),s(y)) -> c_11(min#(x,y))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            -#(x,0()) -> c_1()
            -#(s(x),s(y)) -> c_2(-#(x,y))
            gcd#(0(),s(x)) -> c_3()
            gcd#(s(x),0()) -> c_4()
            gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                  ,-#(max(x,y),min(x,y))
                                  ,max#(x,y)
                                  ,min#(x,y)
                                  ,min#(x,y))
            max#(x,0()) -> c_6()
            max#(0(),y) -> c_7()
            max#(s(x),s(y)) -> c_8(max#(x,y))
            min#(x,0()) -> c_9()
            min#(0(),y) -> c_10()
            min#(s(x),s(y)) -> c_11(min#(x,y))
        - Weak TRS:
            -(x,0()) -> x
            -(s(x),s(y)) -> -(x,y)
            gcd(0(),s(x)) -> s(x)
            gcd(s(x),0()) -> s(x)
            gcd(s(x),s(y)) -> gcd(-(max(x,y),min(x,y)),s(min(x,y)))
            max(x,0()) -> x
            max(0(),y) -> y
            max(s(x),s(y)) -> s(max(x,y))
            min(x,0()) -> 0()
            min(0(),y) -> 0()
            min(s(x),s(y)) -> s(min(x,y))
        - Signature:
            {-/2,gcd/2,max/2,min/2,-#/2,gcd#/2,max#/2,min#/2} / {0/0,s/1,c_1/0,c_2/1,c_3/0,c_4/0,c_5/5,c_6/0,c_7/0,c_8/1
            ,c_9/0,c_10/0,c_11/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {-#,gcd#,max#,min#} and constructors {0,s}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          -(x,0()) -> x
          -(s(x),s(y)) -> -(x,y)
          max(x,0()) -> x
          max(0(),y) -> y
          max(s(x),s(y)) -> s(max(x,y))
          min(x,0()) -> 0()
          min(0(),y) -> 0()
          min(s(x),s(y)) -> s(min(x,y))
          -#(x,0()) -> c_1()
          -#(s(x),s(y)) -> c_2(-#(x,y))
          gcd#(0(),s(x)) -> c_3()
          gcd#(s(x),0()) -> c_4()
          gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                ,-#(max(x,y),min(x,y))
                                ,max#(x,y)
                                ,min#(x,y)
                                ,min#(x,y))
          max#(x,0()) -> c_6()
          max#(0(),y) -> c_7()
          max#(s(x),s(y)) -> c_8(max#(x,y))
          min#(x,0()) -> c_9()
          min#(0(),y) -> c_10()
          min#(s(x),s(y)) -> c_11(min#(x,y))
* Step 3: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            -#(x,0()) -> c_1()
            -#(s(x),s(y)) -> c_2(-#(x,y))
            gcd#(0(),s(x)) -> c_3()
            gcd#(s(x),0()) -> c_4()
            gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                  ,-#(max(x,y),min(x,y))
                                  ,max#(x,y)
                                  ,min#(x,y)
                                  ,min#(x,y))
            max#(x,0()) -> c_6()
            max#(0(),y) -> c_7()
            max#(s(x),s(y)) -> c_8(max#(x,y))
            min#(x,0()) -> c_9()
            min#(0(),y) -> c_10()
            min#(s(x),s(y)) -> c_11(min#(x,y))
        - Weak TRS:
            -(x,0()) -> x
            -(s(x),s(y)) -> -(x,y)
            max(x,0()) -> x
            max(0(),y) -> y
            max(s(x),s(y)) -> s(max(x,y))
            min(x,0()) -> 0()
            min(0(),y) -> 0()
            min(s(x),s(y)) -> s(min(x,y))
        - Signature:
            {-/2,gcd/2,max/2,min/2,-#/2,gcd#/2,max#/2,min#/2} / {0/0,s/1,c_1/0,c_2/1,c_3/0,c_4/0,c_5/5,c_6/0,c_7/0,c_8/1
            ,c_9/0,c_10/0,c_11/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {-#,gcd#,max#,min#} and constructors {0,s}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1,3,4,6,7,9,10}
        by application of
          Pre({1,3,4,6,7,9,10}) = {2,5,8,11}.
        Here rules are labelled as follows:
          1: -#(x,0()) -> c_1()
          2: -#(s(x),s(y)) -> c_2(-#(x,y))
          3: gcd#(0(),s(x)) -> c_3()
          4: gcd#(s(x),0()) -> c_4()
          5: gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                   ,-#(max(x,y),min(x,y))
                                   ,max#(x,y)
                                   ,min#(x,y)
                                   ,min#(x,y))
          6: max#(x,0()) -> c_6()
          7: max#(0(),y) -> c_7()
          8: max#(s(x),s(y)) -> c_8(max#(x,y))
          9: min#(x,0()) -> c_9()
          10: min#(0(),y) -> c_10()
          11: min#(s(x),s(y)) -> c_11(min#(x,y))
* Step 4: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            -#(s(x),s(y)) -> c_2(-#(x,y))
            gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                  ,-#(max(x,y),min(x,y))
                                  ,max#(x,y)
                                  ,min#(x,y)
                                  ,min#(x,y))
            max#(s(x),s(y)) -> c_8(max#(x,y))
            min#(s(x),s(y)) -> c_11(min#(x,y))
        - Weak DPs:
            -#(x,0()) -> c_1()
            gcd#(0(),s(x)) -> c_3()
            gcd#(s(x),0()) -> c_4()
            max#(x,0()) -> c_6()
            max#(0(),y) -> c_7()
            min#(x,0()) -> c_9()
            min#(0(),y) -> c_10()
        - Weak TRS:
            -(x,0()) -> x
            -(s(x),s(y)) -> -(x,y)
            max(x,0()) -> x
            max(0(),y) -> y
            max(s(x),s(y)) -> s(max(x,y))
            min(x,0()) -> 0()
            min(0(),y) -> 0()
            min(s(x),s(y)) -> s(min(x,y))
        - Signature:
            {-/2,gcd/2,max/2,min/2,-#/2,gcd#/2,max#/2,min#/2} / {0/0,s/1,c_1/0,c_2/1,c_3/0,c_4/0,c_5/5,c_6/0,c_7/0,c_8/1
            ,c_9/0,c_10/0,c_11/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {-#,gcd#,max#,min#} and constructors {0,s}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:-#(s(x),s(y)) -> c_2(-#(x,y))
             -->_1 -#(x,0()) -> c_1():5
             -->_1 -#(s(x),s(y)) -> c_2(-#(x,y)):1
          
          2:S:gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                    ,-#(max(x,y),min(x,y))
                                    ,max#(x,y)
                                    ,min#(x,y)
                                    ,min#(x,y))
             -->_5 min#(s(x),s(y)) -> c_11(min#(x,y)):4
             -->_4 min#(s(x),s(y)) -> c_11(min#(x,y)):4
             -->_3 max#(s(x),s(y)) -> c_8(max#(x,y)):3
             -->_5 min#(0(),y) -> c_10():11
             -->_4 min#(0(),y) -> c_10():11
             -->_5 min#(x,0()) -> c_9():10
             -->_4 min#(x,0()) -> c_9():10
             -->_3 max#(0(),y) -> c_7():9
             -->_3 max#(x,0()) -> c_6():8
             -->_1 gcd#(0(),s(x)) -> c_3():6
             -->_2 -#(x,0()) -> c_1():5
             -->_1 gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                         ,-#(max(x,y),min(x,y))
                                         ,max#(x,y)
                                         ,min#(x,y)
                                         ,min#(x,y)):2
             -->_2 -#(s(x),s(y)) -> c_2(-#(x,y)):1
          
          3:S:max#(s(x),s(y)) -> c_8(max#(x,y))
             -->_1 max#(0(),y) -> c_7():9
             -->_1 max#(x,0()) -> c_6():8
             -->_1 max#(s(x),s(y)) -> c_8(max#(x,y)):3
          
          4:S:min#(s(x),s(y)) -> c_11(min#(x,y))
             -->_1 min#(0(),y) -> c_10():11
             -->_1 min#(x,0()) -> c_9():10
             -->_1 min#(s(x),s(y)) -> c_11(min#(x,y)):4
          
          5:W:-#(x,0()) -> c_1()
             
          
          6:W:gcd#(0(),s(x)) -> c_3()
             
          
          7:W:gcd#(s(x),0()) -> c_4()
             
          
          8:W:max#(x,0()) -> c_6()
             
          
          9:W:max#(0(),y) -> c_7()
             
          
          10:W:min#(x,0()) -> c_9()
             
          
          11:W:min#(0(),y) -> c_10()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          7: gcd#(s(x),0()) -> c_4()
          6: gcd#(0(),s(x)) -> c_3()
          8: max#(x,0()) -> c_6()
          9: max#(0(),y) -> c_7()
          10: min#(x,0()) -> c_9()
          11: min#(0(),y) -> c_10()
          5: -#(x,0()) -> c_1()
* Step 5: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          -#(s(x),s(y)) -> c_2(-#(x,y))
          gcd#(s(x),s(y)) -> c_5(gcd#(-(max(x,y),min(x,y)),s(min(x,y)))
                                ,-#(max(x,y),min(x,y))
                                ,max#(x,y)
                                ,min#(x,y)
                                ,min#(x,y))
          max#(s(x),s(y)) -> c_8(max#(x,y))
          min#(s(x),s(y)) -> c_11(min#(x,y))
      - Weak TRS:
          -(x,0()) -> x
          -(s(x),s(y)) -> -(x,y)
          max(x,0()) -> x
          max(0(),y) -> y
          max(s(x),s(y)) -> s(max(x,y))
          min(x,0()) -> 0()
          min(0(),y) -> 0()
          min(s(x),s(y)) -> s(min(x,y))
      - Signature:
          {-/2,gcd/2,max/2,min/2,-#/2,gcd#/2,max#/2,min#/2} / {0/0,s/1,c_1/0,c_2/1,c_3/0,c_4/0,c_5/5,c_6/0,c_7/0,c_8/1
          ,c_9/0,c_10/0,c_11/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {-#,gcd#,max#,min#} and constructors {0,s}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE