MAYBE

Problem:
 from(X) -> cons(X,n__from(s(X)))
 first(0(),Z) -> nil()
 first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
 sel(0(),cons(X,Z)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
 from(X) -> n__from(X)
 first(X1,X2) -> n__first(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__first(X1,X2)) -> first(X1,X2)
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   first#(s(X),cons(Y,Z)) -> activate#(Z)
   sel#(s(X),cons(Y,Z)) -> activate#(Z)
   sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
   activate#(n__from(X)) -> from#(X)
   activate#(n__first(X1,X2)) -> first#(X1,X2)
  TRS:
   from(X) -> cons(X,n__from(s(X)))
   first(0(),Z) -> nil()
   first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
   sel(0(),cons(X,Z)) -> X
   sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
   from(X) -> n__from(X)
   first(X1,X2) -> n__first(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(n__first(X1,X2)) -> first(X1,X2)
   activate(X) -> X
  Usable Rule Processor:
   DPs:
    first#(s(X),cons(Y,Z)) -> activate#(Z)
    sel#(s(X),cons(Y,Z)) -> activate#(Z)
    sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
    activate#(n__from(X)) -> from#(X)
    activate#(n__first(X1,X2)) -> first#(X1,X2)
   TRS:
    f14(x,y) -> x
    f14(x,y) -> y
    activate(n__from(X)) -> from(X)
    activate(n__first(X1,X2)) -> first(X1,X2)
    activate(X) -> X
    from(X) -> cons(X,n__from(s(X)))
    from(X) -> n__from(X)
    first(0(),Z) -> nil()
    first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
    first(X1,X2) -> n__first(X1,X2)
   ADG Processor:
    DPs:
     first#(s(X),cons(Y,Z)) -> activate#(Z)
     sel#(s(X),cons(Y,Z)) -> activate#(Z)
     sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
     activate#(n__from(X)) -> from#(X)
     activate#(n__first(X1,X2)) -> first#(X1,X2)
    TRS:
     f14(x,y) -> x
     f14(x,y) -> y
     activate(n__from(X)) -> from(X)
     activate(n__first(X1,X2)) -> first(X1,X2)
     activate(X) -> X
     from(X) -> cons(X,n__from(s(X)))
     from(X) -> n__from(X)
     first(0(),Z) -> nil()
     first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
     first(X1,X2) -> n__first(X1,X2)
    graph:
     sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) ->
     sel#(s(X),cons(Y,Z)) -> activate#(Z)
     sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) ->
     sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
     sel#(s(X),cons(Y,Z)) -> activate#(Z) ->
     activate#(n__from(X)) -> from#(X)
     sel#(s(X),cons(Y,Z)) -> activate#(Z) ->
     activate#(n__first(X1,X2)) -> first#(X1,X2)
     activate#(n__first(X1,X2)) -> first#(X1,X2) ->
     first#(s(X),cons(Y,Z)) -> activate#(Z)
     first#(s(X),cons(Y,Z)) -> activate#(Z) ->
     activate#(n__from(X)) -> from#(X)
     first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__first(X1,X2)) -> first#(X1,X2)
    Restore Modifier:
     DPs:
      first#(s(X),cons(Y,Z)) -> activate#(Z)
      sel#(s(X),cons(Y,Z)) -> activate#(Z)
      sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
      activate#(n__from(X)) -> from#(X)
      activate#(n__first(X1,X2)) -> first#(X1,X2)
     TRS:
      from(X) -> cons(X,n__from(s(X)))
      first(0(),Z) -> nil()
      first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
      sel(0(),cons(X,Z)) -> X
      sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
      from(X) -> n__from(X)
      first(X1,X2) -> n__first(X1,X2)
      activate(n__from(X)) -> from(X)
      activate(n__first(X1,X2)) -> first(X1,X2)
      activate(X) -> X
     SCC Processor:
      #sccs: 2
      #rules: 3
      #arcs: 7/25
      DPs:
       sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z))
      TRS:
       from(X) -> cons(X,n__from(s(X)))
       first(0(),Z) -> nil()
       first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
       sel(0(),cons(X,Z)) -> X
       sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
       from(X) -> n__from(X)
       first(X1,X2) -> n__first(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__first(X1,X2)) -> first(X1,X2)
       activate(X) -> X
      Open
      
      DPs:
       activate#(n__first(X1,X2)) -> first#(X1,X2)
       first#(s(X),cons(Y,Z)) -> activate#(Z)
      TRS:
       from(X) -> cons(X,n__from(s(X)))
       first(0(),Z) -> nil()
       first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
       sel(0(),cons(X,Z)) -> X
       sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
       from(X) -> n__from(X)
       first(X1,X2) -> n__first(X1,X2)
       activate(n__from(X)) -> from(X)
       activate(n__first(X1,X2)) -> first(X1,X2)
       activate(X) -> X
      Open