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