Input TRS:
    1: first(0(),X) -> nil()
    2: first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
    3: from(X) -> cons(X,n__from(s(X)))
    4: first(X1,X2) -> n__first(X1,X2)
    5: from(X) -> n__from(X)
    6: activate(n__first(X1,X2)) -> first(X1,X2)
    7: activate(n__from(X)) -> from(X)
    8: activate(X) -> X
Number of strict rules: 8
Direct Order(PosReal,>,Poly) ... removes: 4 8 1 3 5 7 6 2
     s(x1)	weight: (/ 1 8) + x1
n__first(x1,x2)	weight: x1 + x2
activate(x1)	weight: (/ 37175 2) + 2 * x1
n__from(x1)	weight: x1
     0()	weight: 0
  from(x1)	weight: (/ 148699 8) + 2 * x1
   nil()	weight: 0
 first(x1,x2)	weight: (/ 1 4) + 2 * x1 + 2 * x2
  cons(x1,x2)	weight: (/ 148697 8) + x1 + x2
Number of strict rules: 0
YES