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