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