YES

TRS:

  active(from(X)) -> mark(cons(X,from(s(X))))
  active(length(nil())) -> mark(0())
  active(length(cons(X,Y))) -> mark(s(length1(Y)))
  active(length1(X)) -> mark(length(X))
  mark(from(X)) -> active(from(mark(X)))
  mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
  mark(s(X)) -> active(s(mark(X)))
  mark(length(X)) -> active(length(X))
  mark(nil()) -> active(nil())
  mark(0()) -> active(0())
  mark(length1(X)) -> active(length1(X))
  from(mark(X)) -> from(X)
  from(active(X)) -> from(X)
  cons(mark(X1),X2) -> cons(X1,X2)
  cons(X1,mark(X2)) -> cons(X1,X2)
  cons(active(X1),X2) -> cons(X1,X2)
  cons(X1,active(X2)) -> cons(X1,X2)
  s(mark(X)) -> s(X)
  s(active(X)) -> s(X)
  length(mark(X)) -> length(X)
  length(active(X)) -> length(X)
  length1(mark(X)) -> length1(X)
  length1(active(X)) -> length1(X)

linear polynomial interpretations on N:

  active_A(x1) = x1
  active#_A(x1) = x1
  from_A(x1) = x1 + 11
  from#_A(x1) = 4
  mark_A(x1) = x1
  mark#_A(x1) = x1 + 3
  cons_A(x1,x2) = x1 + 7
  cons#_A(x1,x2) = 9
  s_A(x1) = x1
  s#_A(x1) = 2
  length_A(x1) = 1
  length#_A(x1) = 7
  nil_A = 3
  nil#_A = 5
  0_A = 1
  0#_A = 6
  length1_A(x1) = 1
  length1#_A(x1) = 8

precedence:

  cons > length1 > length > active > from > mark > s = 0 > nil