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