MAYBE

Problem:
 active(from(X)) -> mark(cons(X,from(s(X))))
 active(after(0(),XS)) -> mark(XS)
 active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
 active(from(X)) -> from(active(X))
 active(cons(X1,X2)) -> cons(active(X1),X2)
 active(s(X)) -> s(active(X))
 active(after(X1,X2)) -> after(active(X1),X2)
 active(after(X1,X2)) -> after(X1,active(X2))
 from(mark(X)) -> mark(from(X))
 cons(mark(X1),X2) -> mark(cons(X1,X2))
 s(mark(X)) -> mark(s(X))
 after(mark(X1),X2) -> mark(after(X1,X2))
 after(X1,mark(X2)) -> mark(after(X1,X2))
 proper(from(X)) -> from(proper(X))
 proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
 proper(s(X)) -> s(proper(X))
 proper(after(X1,X2)) -> after(proper(X1),proper(X2))
 proper(0()) -> ok(0())
 from(ok(X)) -> ok(from(X))
 cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
 s(ok(X)) -> ok(s(X))
 after(ok(X1),ok(X2)) -> ok(after(X1,X2))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 DP Processor:
  DPs:
   active#(from(X)) -> s#(X)
   active#(from(X)) -> from#(s(X))
   active#(from(X)) -> cons#(X,from(s(X)))
   active#(after(s(N),cons(X,XS))) -> after#(N,XS)
   active#(from(X)) -> active#(X)
   active#(from(X)) -> from#(active(X))
   active#(cons(X1,X2)) -> active#(X1)
   active#(cons(X1,X2)) -> cons#(active(X1),X2)
   active#(s(X)) -> active#(X)
   active#(s(X)) -> s#(active(X))
   active#(after(X1,X2)) -> active#(X1)
   active#(after(X1,X2)) -> after#(active(X1),X2)
   active#(after(X1,X2)) -> active#(X2)
   active#(after(X1,X2)) -> after#(X1,active(X2))
   from#(mark(X)) -> from#(X)
   cons#(mark(X1),X2) -> cons#(X1,X2)
   s#(mark(X)) -> s#(X)
   after#(mark(X1),X2) -> after#(X1,X2)
   after#(X1,mark(X2)) -> after#(X1,X2)
   proper#(from(X)) -> proper#(X)
   proper#(from(X)) -> from#(proper(X))
   proper#(cons(X1,X2)) -> proper#(X2)
   proper#(cons(X1,X2)) -> proper#(X1)
   proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
   proper#(s(X)) -> proper#(X)
   proper#(s(X)) -> s#(proper(X))
   proper#(after(X1,X2)) -> proper#(X2)
   proper#(after(X1,X2)) -> proper#(X1)
   proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
   from#(ok(X)) -> from#(X)
   cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
   s#(ok(X)) -> s#(X)
   after#(ok(X1),ok(X2)) -> after#(X1,X2)
   top#(mark(X)) -> proper#(X)
   top#(mark(X)) -> top#(proper(X))
   top#(ok(X)) -> active#(X)
   top#(ok(X)) -> top#(active(X))
  TRS:
   active(from(X)) -> mark(cons(X,from(s(X))))
   active(after(0(),XS)) -> mark(XS)
   active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
   active(from(X)) -> from(active(X))
   active(cons(X1,X2)) -> cons(active(X1),X2)
   active(s(X)) -> s(active(X))
   active(after(X1,X2)) -> after(active(X1),X2)
   active(after(X1,X2)) -> after(X1,active(X2))
   from(mark(X)) -> mark(from(X))
   cons(mark(X1),X2) -> mark(cons(X1,X2))
   s(mark(X)) -> mark(s(X))
   after(mark(X1),X2) -> mark(after(X1,X2))
   after(X1,mark(X2)) -> mark(after(X1,X2))
   proper(from(X)) -> from(proper(X))
   proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(after(X1,X2)) -> after(proper(X1),proper(X2))
   proper(0()) -> ok(0())
   from(ok(X)) -> ok(from(X))
   cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
   s(ok(X)) -> ok(s(X))
   after(ok(X1),ok(X2)) -> ok(after(X1,X2))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  TDG Processor:
   DPs:
    active#(from(X)) -> s#(X)
    active#(from(X)) -> from#(s(X))
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(from(X)) -> active#(X)
    active#(from(X)) -> from#(active(X))
    active#(cons(X1,X2)) -> active#(X1)
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(s(X)) -> active#(X)
    active#(s(X)) -> s#(active(X))
    active#(after(X1,X2)) -> active#(X1)
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(after(X1,X2)) -> active#(X2)
    active#(after(X1,X2)) -> after#(X1,active(X2))
    from#(mark(X)) -> from#(X)
    cons#(mark(X1),X2) -> cons#(X1,X2)
    s#(mark(X)) -> s#(X)
    after#(mark(X1),X2) -> after#(X1,X2)
    after#(X1,mark(X2)) -> after#(X1,X2)
    proper#(from(X)) -> proper#(X)
    proper#(from(X)) -> from#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(s(X)) -> proper#(X)
    proper#(s(X)) -> s#(proper(X))
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    from#(ok(X)) -> from#(X)
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    s#(ok(X)) -> s#(X)
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    top#(mark(X)) -> proper#(X)
    top#(mark(X)) -> top#(proper(X))
    top#(ok(X)) -> active#(X)
    top#(ok(X)) -> top#(active(X))
   TRS:
    active(from(X)) -> mark(cons(X,from(s(X))))
    active(after(0(),XS)) -> mark(XS)
    active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
    active(from(X)) -> from(active(X))
    active(cons(X1,X2)) -> cons(active(X1),X2)
    active(s(X)) -> s(active(X))
    active(after(X1,X2)) -> after(active(X1),X2)
    active(after(X1,X2)) -> after(X1,active(X2))
    from(mark(X)) -> mark(from(X))
    cons(mark(X1),X2) -> mark(cons(X1,X2))
    s(mark(X)) -> mark(s(X))
    after(mark(X1),X2) -> mark(after(X1,X2))
    after(X1,mark(X2)) -> mark(after(X1,X2))
    proper(from(X)) -> from(proper(X))
    proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
    proper(s(X)) -> s(proper(X))
    proper(after(X1,X2)) -> after(proper(X1),proper(X2))
    proper(0()) -> ok(0())
    from(ok(X)) -> ok(from(X))
    cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
    s(ok(X)) -> ok(s(X))
    after(ok(X1),ok(X2)) -> ok(after(X1,X2))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   graph:
    top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X))
    top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X)
    top#(ok(X)) -> top#(active(X)) ->
    top#(mark(X)) -> top#(proper(X))
    top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X)
    top#(ok(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    top#(ok(X)) -> active#(X) -> active#(after(X1,X2)) -> active#(X2)
    top#(ok(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    top#(ok(X)) -> active#(X) -> active#(after(X1,X2)) -> active#(X1)
    top#(ok(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
    top#(ok(X)) -> active#(X) -> active#(s(X)) -> active#(X)
    top#(ok(X)) -> active#(X) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    top#(ok(X)) -> active#(X) -> active#(cons(X1,X2)) -> active#(X1)
    top#(ok(X)) -> active#(X) -> active#(from(X)) -> from#(active(X))
    top#(ok(X)) -> active#(X) -> active#(from(X)) -> active#(X)
    top#(ok(X)) -> active#(X) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    top#(ok(X)) -> active#(X) -> active#(from(X)) -> cons#(X,from(s(X)))
    top#(ok(X)) -> active#(X) -> active#(from(X)) -> from#(s(X))
    top#(ok(X)) -> active#(X) -> active#(from(X)) -> s#(X)
    top#(mark(X)) -> top#(proper(X)) ->
    top#(ok(X)) -> top#(active(X))
    top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X)
    top#(mark(X)) -> top#(proper(X)) ->
    top#(mark(X)) -> top#(proper(X))
    top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X)
    top#(mark(X)) -> proper#(X) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    top#(mark(X)) -> proper#(X) -> proper#(after(X1,X2)) -> proper#(X1)
    top#(mark(X)) -> proper#(X) -> proper#(after(X1,X2)) -> proper#(X2)
    top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
    top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
    top#(mark(X)) -> proper#(X) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1)
    top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2)
    top#(mark(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X))
    top#(mark(X)) -> proper#(X) ->
    proper#(from(X)) -> proper#(X)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(s(X)) -> s#(proper(X))
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(s(X)) -> proper#(X)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(from(X)) -> from#(proper(X))
    proper#(after(X1,X2)) -> proper#(X2) ->
    proper#(from(X)) -> proper#(X)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(s(X)) -> s#(proper(X))
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(s(X)) -> proper#(X)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(from(X)) -> from#(proper(X))
    proper#(after(X1,X2)) -> proper#(X1) ->
    proper#(from(X)) -> proper#(X)
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2)) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2)) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2)) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(s(X)) -> s#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(s(X)) -> proper#(X)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(from(X)) -> from#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X2) ->
    proper#(from(X)) -> proper#(X)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(s(X)) -> s#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(s(X)) -> proper#(X)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(from(X)) -> from#(proper(X))
    proper#(cons(X1,X2)) -> proper#(X1) ->
    proper#(from(X)) -> proper#(X)
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) ->
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) ->
    cons#(mark(X1),X2) -> cons#(X1,X2)
    proper#(s(X)) -> proper#(X) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(s(X)) -> proper#(X) -> proper#(after(X1,X2)) -> proper#(X1)
    proper#(s(X)) -> proper#(X) -> proper#(after(X1,X2)) -> proper#(X2)
    proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
    proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
    proper#(s(X)) -> proper#(X) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1)
    proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2)
    proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X))
    proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X)
    proper#(s(X)) -> s#(proper(X)) -> s#(ok(X)) -> s#(X)
    proper#(s(X)) -> s#(proper(X)) -> s#(mark(X)) -> s#(X)
    proper#(from(X)) -> proper#(X) ->
    proper#(after(X1,X2)) -> after#(proper(X1),proper(X2))
    proper#(from(X)) -> proper#(X) ->
    proper#(after(X1,X2)) -> proper#(X1)
    proper#(from(X)) -> proper#(X) ->
    proper#(after(X1,X2)) -> proper#(X2)
    proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X))
    proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X)
    proper#(from(X)) -> proper#(X) ->
    proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2))
    proper#(from(X)) -> proper#(X) ->
    proper#(cons(X1,X2)) -> proper#(X1)
    proper#(from(X)) -> proper#(X) ->
    proper#(cons(X1,X2)) -> proper#(X2)
    proper#(from(X)) -> proper#(X) ->
    proper#(from(X)) -> from#(proper(X))
    proper#(from(X)) -> proper#(X) ->
    proper#(from(X)) -> proper#(X)
    proper#(from(X)) -> from#(proper(X)) ->
    from#(ok(X)) -> from#(X)
    proper#(from(X)) -> from#(proper(X)) ->
    from#(mark(X)) -> from#(X)
    after#(ok(X1),ok(X2)) -> after#(X1,X2) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    after#(ok(X1),ok(X2)) -> after#(X1,X2) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    after#(ok(X1),ok(X2)) -> after#(X1,X2) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    after#(mark(X1),X2) -> after#(X1,X2) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    after#(mark(X1),X2) -> after#(X1,X2) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    after#(mark(X1),X2) -> after#(X1,X2) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    after#(X1,mark(X2)) -> after#(X1,X2) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    after#(X1,mark(X2)) -> after#(X1,X2) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    after#(X1,mark(X2)) -> after#(X1,X2) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2) ->
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2) ->
    cons#(mark(X1),X2) -> cons#(X1,X2)
    cons#(mark(X1),X2) -> cons#(X1,X2) ->
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    cons#(mark(X1),X2) -> cons#(X1,X2) ->
    cons#(mark(X1),X2) -> cons#(X1,X2)
    from#(ok(X)) -> from#(X) -> from#(ok(X)) -> from#(X)
    from#(ok(X)) -> from#(X) -> from#(mark(X)) -> from#(X)
    from#(mark(X)) -> from#(X) -> from#(ok(X)) -> from#(X)
    from#(mark(X)) -> from#(X) -> from#(mark(X)) -> from#(X)
    s#(ok(X)) -> s#(X) -> s#(ok(X)) -> s#(X)
    s#(ok(X)) -> s#(X) -> s#(mark(X)) -> s#(X)
    s#(mark(X)) -> s#(X) -> s#(ok(X)) -> s#(X)
    s#(mark(X)) -> s#(X) -> s#(mark(X)) -> s#(X)
    active#(after(s(N),cons(X,XS))) -> after#(N,XS) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    active#(after(s(N),cons(X,XS))) -> after#(N,XS) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    active#(after(s(N),cons(X,XS))) -> after#(N,XS) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(active(X1),X2) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(active(X1),X2) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(active(X1),X2) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(X1,active(X2)) ->
    after#(ok(X1),ok(X2)) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(X1,active(X2)) ->
    after#(X1,mark(X2)) -> after#(X1,X2)
    active#(after(X1,X2)) -> after#(X1,active(X2)) ->
    after#(mark(X1),X2) -> after#(X1,X2)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    active#(after(X1,X2)) -> active#(X2) ->
    active#(after(X1,X2)) -> active#(X2)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(after(X1,X2)) -> active#(X1)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(s(X)) -> s#(active(X))
    active#(after(X1,X2)) -> active#(X2) ->
    active#(s(X)) -> active#(X)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(cons(X1,X2)) -> active#(X1)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(from(X)) -> from#(active(X))
    active#(after(X1,X2)) -> active#(X2) ->
    active#(from(X)) -> active#(X)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(after(X1,X2)) -> active#(X2) ->
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(after(X1,X2)) -> active#(X2) ->
    active#(from(X)) -> from#(s(X))
    active#(after(X1,X2)) -> active#(X2) ->
    active#(from(X)) -> s#(X)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    active#(after(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> active#(X2)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> active#(X1)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(s(X)) -> s#(active(X))
    active#(after(X1,X2)) -> active#(X1) ->
    active#(s(X)) -> active#(X)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(cons(X1,X2)) -> active#(X1)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> from#(active(X))
    active#(after(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> active#(X)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(after(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(after(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> from#(s(X))
    active#(after(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> s#(X)
    active#(cons(X1,X2)) -> cons#(active(X1),X2) ->
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    active#(cons(X1,X2)) -> cons#(active(X1),X2) ->
    cons#(mark(X1),X2) -> cons#(X1,X2)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> active#(X2)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(after(X1,X2)) -> active#(X1)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(s(X)) -> s#(active(X))
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(s(X)) -> active#(X)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(cons(X1,X2)) -> active#(X1)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> from#(active(X))
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> active#(X)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(cons(X1,X2)) -> active#(X1) ->
    active#(from(X)) -> from#(s(X))
    active#(cons(X1,X2)) -> active#(X1) -> active#(from(X)) -> s#(X)
    active#(s(X)) -> s#(active(X)) -> s#(ok(X)) -> s#(X)
    active#(s(X)) -> s#(active(X)) -> s#(mark(X)) -> s#(X)
    active#(s(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    active#(s(X)) -> active#(X) -> active#(after(X1,X2)) -> active#(X2)
    active#(s(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(s(X)) -> active#(X) -> active#(after(X1,X2)) -> active#(X1)
    active#(s(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
    active#(s(X)) -> active#(X) -> active#(s(X)) -> active#(X)
    active#(s(X)) -> active#(X) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(s(X)) -> active#(X) -> active#(cons(X1,X2)) -> active#(X1)
    active#(s(X)) -> active#(X) -> active#(from(X)) -> from#(active(X))
    active#(s(X)) -> active#(X) -> active#(from(X)) -> active#(X)
    active#(s(X)) -> active#(X) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(s(X)) -> active#(X) ->
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(s(X)) -> active#(X) -> active#(from(X)) -> from#(s(X))
    active#(s(X)) -> active#(X) -> active#(from(X)) -> s#(X)
    active#(from(X)) -> cons#(X,from(s(X))) ->
    cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    active#(from(X)) -> cons#(X,from(s(X))) ->
    cons#(mark(X1),X2) -> cons#(X1,X2)
    active#(from(X)) -> from#(s(X)) -> from#(ok(X)) -> from#(X)
    active#(from(X)) -> from#(s(X)) ->
    from#(mark(X)) -> from#(X)
    active#(from(X)) -> from#(active(X)) ->
    from#(ok(X)) -> from#(X)
    active#(from(X)) -> from#(active(X)) -> from#(mark(X)) -> from#(X)
    active#(from(X)) -> s#(X) -> s#(ok(X)) -> s#(X)
    active#(from(X)) -> s#(X) -> s#(mark(X)) -> s#(X)
    active#(from(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(X1,active(X2))
    active#(from(X)) -> active#(X) ->
    active#(after(X1,X2)) -> active#(X2)
    active#(from(X)) -> active#(X) ->
    active#(after(X1,X2)) -> after#(active(X1),X2)
    active#(from(X)) -> active#(X) ->
    active#(after(X1,X2)) -> active#(X1)
    active#(from(X)) -> active#(X) -> active#(s(X)) -> s#(active(X))
    active#(from(X)) -> active#(X) -> active#(s(X)) -> active#(X)
    active#(from(X)) -> active#(X) ->
    active#(cons(X1,X2)) -> cons#(active(X1),X2)
    active#(from(X)) -> active#(X) ->
    active#(cons(X1,X2)) -> active#(X1)
    active#(from(X)) -> active#(X) ->
    active#(from(X)) -> from#(active(X))
    active#(from(X)) -> active#(X) -> active#(from(X)) -> active#(X)
    active#(from(X)) -> active#(X) ->
    active#(after(s(N),cons(X,XS))) -> after#(N,XS)
    active#(from(X)) -> active#(X) ->
    active#(from(X)) -> cons#(X,from(s(X)))
    active#(from(X)) -> active#(X) -> active#(from(X)) -> from#(s(X))
    active#(from(X)) -> active#(X) -> active#(from(X)) -> s#(X)
   SCC Processor:
    #sccs: 7
    #rules: 22
    #arcs: 213/1369
    DPs:
     top#(ok(X)) -> top#(active(X))
     top#(mark(X)) -> top#(proper(X))
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Open
    
    DPs:
     active#(from(X)) -> active#(X)
     active#(cons(X1,X2)) -> active#(X1)
     active#(s(X)) -> active#(X)
     active#(after(X1,X2)) -> active#(X1)
     active#(after(X1,X2)) -> active#(X2)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(active#) = 0
     problem:
      DPs:
       
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed
    
    DPs:
     proper#(from(X)) -> proper#(X)
     proper#(cons(X1,X2)) -> proper#(X2)
     proper#(cons(X1,X2)) -> proper#(X1)
     proper#(s(X)) -> proper#(X)
     proper#(after(X1,X2)) -> proper#(X2)
     proper#(after(X1,X2)) -> proper#(X1)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(proper#) = 0
     problem:
      DPs:
       
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed
    
    DPs:
     after#(mark(X1),X2) -> after#(X1,X2)
     after#(X1,mark(X2)) -> after#(X1,X2)
     after#(ok(X1),ok(X2)) -> after#(X1,X2)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(after#) = 1
     problem:
      DPs:
       after#(mark(X1),X2) -> after#(X1,X2)
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(after#) = 0
      problem:
       DPs:
        
       TRS:
        active(from(X)) -> mark(cons(X,from(s(X))))
        active(after(0(),XS)) -> mark(XS)
        active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
        active(from(X)) -> from(active(X))
        active(cons(X1,X2)) -> cons(active(X1),X2)
        active(s(X)) -> s(active(X))
        active(after(X1,X2)) -> after(active(X1),X2)
        active(after(X1,X2)) -> after(X1,active(X2))
        from(mark(X)) -> mark(from(X))
        cons(mark(X1),X2) -> mark(cons(X1,X2))
        s(mark(X)) -> mark(s(X))
        after(mark(X1),X2) -> mark(after(X1,X2))
        after(X1,mark(X2)) -> mark(after(X1,X2))
        proper(from(X)) -> from(proper(X))
        proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
        proper(s(X)) -> s(proper(X))
        proper(after(X1,X2)) -> after(proper(X1),proper(X2))
        proper(0()) -> ok(0())
        from(ok(X)) -> ok(from(X))
        cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
        s(ok(X)) -> ok(s(X))
        after(ok(X1),ok(X2)) -> ok(after(X1,X2))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
    
    DPs:
     s#(mark(X)) -> s#(X)
     s#(ok(X)) -> s#(X)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(s#) = 0
     problem:
      DPs:
       
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed
    
    DPs:
     cons#(mark(X1),X2) -> cons#(X1,X2)
     cons#(ok(X1),ok(X2)) -> cons#(X1,X2)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(cons#) = 1
     problem:
      DPs:
       cons#(mark(X1),X2) -> cons#(X1,X2)
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(cons#) = 0
      problem:
       DPs:
        
       TRS:
        active(from(X)) -> mark(cons(X,from(s(X))))
        active(after(0(),XS)) -> mark(XS)
        active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
        active(from(X)) -> from(active(X))
        active(cons(X1,X2)) -> cons(active(X1),X2)
        active(s(X)) -> s(active(X))
        active(after(X1,X2)) -> after(active(X1),X2)
        active(after(X1,X2)) -> after(X1,active(X2))
        from(mark(X)) -> mark(from(X))
        cons(mark(X1),X2) -> mark(cons(X1,X2))
        s(mark(X)) -> mark(s(X))
        after(mark(X1),X2) -> mark(after(X1,X2))
        after(X1,mark(X2)) -> mark(after(X1,X2))
        proper(from(X)) -> from(proper(X))
        proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
        proper(s(X)) -> s(proper(X))
        proper(after(X1,X2)) -> after(proper(X1),proper(X2))
        proper(0()) -> ok(0())
        from(ok(X)) -> ok(from(X))
        cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
        s(ok(X)) -> ok(s(X))
        after(ok(X1),ok(X2)) -> ok(after(X1,X2))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
    
    DPs:
     from#(mark(X)) -> from#(X)
     from#(ok(X)) -> from#(X)
    TRS:
     active(from(X)) -> mark(cons(X,from(s(X))))
     active(after(0(),XS)) -> mark(XS)
     active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
     active(from(X)) -> from(active(X))
     active(cons(X1,X2)) -> cons(active(X1),X2)
     active(s(X)) -> s(active(X))
     active(after(X1,X2)) -> after(active(X1),X2)
     active(after(X1,X2)) -> after(X1,active(X2))
     from(mark(X)) -> mark(from(X))
     cons(mark(X1),X2) -> mark(cons(X1,X2))
     s(mark(X)) -> mark(s(X))
     after(mark(X1),X2) -> mark(after(X1,X2))
     after(X1,mark(X2)) -> mark(after(X1,X2))
     proper(from(X)) -> from(proper(X))
     proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
     proper(s(X)) -> s(proper(X))
     proper(after(X1,X2)) -> after(proper(X1),proper(X2))
     proper(0()) -> ok(0())
     from(ok(X)) -> ok(from(X))
     cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
     s(ok(X)) -> ok(s(X))
     after(ok(X1),ok(X2)) -> ok(after(X1,X2))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(from#) = 0
     problem:
      DPs:
       
      TRS:
       active(from(X)) -> mark(cons(X,from(s(X))))
       active(after(0(),XS)) -> mark(XS)
       active(after(s(N),cons(X,XS))) -> mark(after(N,XS))
       active(from(X)) -> from(active(X))
       active(cons(X1,X2)) -> cons(active(X1),X2)
       active(s(X)) -> s(active(X))
       active(after(X1,X2)) -> after(active(X1),X2)
       active(after(X1,X2)) -> after(X1,active(X2))
       from(mark(X)) -> mark(from(X))
       cons(mark(X1),X2) -> mark(cons(X1,X2))
       s(mark(X)) -> mark(s(X))
       after(mark(X1),X2) -> mark(after(X1,X2))
       after(X1,mark(X2)) -> mark(after(X1,X2))
       proper(from(X)) -> from(proper(X))
       proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
       proper(s(X)) -> s(proper(X))
       proper(after(X1,X2)) -> after(proper(X1),proper(X2))
       proper(0()) -> ok(0())
       from(ok(X)) -> ok(from(X))
       cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
       s(ok(X)) -> ok(s(X))
       after(ok(X1),ok(X2)) -> ok(after(X1,X2))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed