MAYBE

Problem:
 from(X) -> cons(X,from(s(X)))
 after(0(),XS) -> XS
 after(s(N),cons(X,XS)) -> after(N,XS)

Proof:
 DP Processor:
  DPs:
   from#(X) -> from#(s(X))
   after#(s(N),cons(X,XS)) -> after#(N,XS)
  TRS:
   from(X) -> cons(X,from(s(X)))
   after(0(),XS) -> XS
   after(s(N),cons(X,XS)) -> after(N,XS)
  CDG Processor:
   DPs:
    from#(X) -> from#(s(X))
    after#(s(N),cons(X,XS)) -> after#(N,XS)
   TRS:
    from(X) -> cons(X,from(s(X)))
    after(0(),XS) -> XS
    after(s(N),cons(X,XS)) -> after(N,XS)
   graph:
    after#(s(N),cons(X,XS)) -> after#(N,XS) ->
    after#(s(N),cons(X,XS)) -> after#(N,XS)
    from#(X) -> from#(s(X)) -> from#(X) -> from#(s(X))
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 2/4
    DPs:
     from#(X) -> from#(s(X))
    TRS:
     from(X) -> cons(X,from(s(X)))
     after(0(),XS) -> XS
     after(s(N),cons(X,XS)) -> after(N,XS)
    Open
    
    DPs:
     after#(s(N),cons(X,XS)) -> after#(N,XS)
    TRS:
     from(X) -> cons(X,from(s(X)))
     after(0(),XS) -> XS
     after(s(N),cons(X,XS)) -> after(N,XS)
    Open