MAYBE

Problem:
 from(X) -> cons(X,from(s(X)))
 head(cons(X,XS)) -> X
 2nd(cons(X,XS)) -> head(XS)
 take(0(),XS) -> nil()
 take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
 sel(0(),cons(X,XS)) -> X
 sel(s(N),cons(X,XS)) -> sel(N,XS)

Proof:
 DP Processor:
  DPs:
   from#(X) -> from#(s(X))
   2nd#(cons(X,XS)) -> head#(XS)
   take#(s(N),cons(X,XS)) -> take#(N,XS)
   sel#(s(N),cons(X,XS)) -> sel#(N,XS)
  TRS:
   from(X) -> cons(X,from(s(X)))
   head(cons(X,XS)) -> X
   2nd(cons(X,XS)) -> head(XS)
   take(0(),XS) -> nil()
   take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
   sel(0(),cons(X,XS)) -> X
   sel(s(N),cons(X,XS)) -> sel(N,XS)
  Usable Rule Processor:
   DPs:
    from#(X) -> from#(s(X))
    2nd#(cons(X,XS)) -> head#(XS)
    take#(s(N),cons(X,XS)) -> take#(N,XS)
    sel#(s(N),cons(X,XS)) -> sel#(N,XS)
   TRS:
    
   CDG Processor:
    DPs:
     from#(X) -> from#(s(X))
     2nd#(cons(X,XS)) -> head#(XS)
     take#(s(N),cons(X,XS)) -> take#(N,XS)
     sel#(s(N),cons(X,XS)) -> sel#(N,XS)
    TRS:
     
    graph:
     from#(X) -> from#(s(X)) -> from#(X) -> from#(s(X))
    Restore Modifier:
     DPs:
      from#(X) -> from#(s(X))
      2nd#(cons(X,XS)) -> head#(XS)
      take#(s(N),cons(X,XS)) -> take#(N,XS)
      sel#(s(N),cons(X,XS)) -> sel#(N,XS)
     TRS:
      from(X) -> cons(X,from(s(X)))
      head(cons(X,XS)) -> X
      2nd(cons(X,XS)) -> head(XS)
      take(0(),XS) -> nil()
      take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
      sel(0(),cons(X,XS)) -> X
      sel(s(N),cons(X,XS)) -> sel(N,XS)
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 1/16
      DPs:
       from#(X) -> from#(s(X))
      TRS:
       from(X) -> cons(X,from(s(X)))
       head(cons(X,XS)) -> X
       2nd(cons(X,XS)) -> head(XS)
       take(0(),XS) -> nil()
       take(s(N),cons(X,XS)) -> cons(X,take(N,XS))
       sel(0(),cons(X,XS)) -> X
       sel(s(N),cons(X,XS)) -> sel(N,XS)
      Open