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(n__s(X)))
    4: first(X1,X2) -> n__first(X1,X2)
    5: from(X) -> n__from(X)
    6: s(X) -> n__s(X)
    7: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
    8: activate(n__from(X)) -> from(activate(X))
    9: activate(n__s(X)) -> s(activate(X))
    10: activate(X) -> X
Number of strict rules: 10
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #first(s(X),cons(Y,Z)) -> #activate(Z)
   #2: #activate(n__s(X)) -> #s(activate(X))
   #3: #activate(n__s(X)) -> #activate(X)
   #4: #activate(n__first(X1,X2)) -> #first(activate(X1),activate(X2))
   #5: #activate(n__first(X1,X2)) -> #activate(X1)
   #6: #activate(n__first(X1,X2)) -> #activate(X2)
   #7: #activate(n__from(X)) -> #from(activate(X))
   #8: #activate(n__from(X)) -> #activate(X)
Number of SCCs: 1, DPs: 6, edges: 26
	SCC { #1 #3..6 #8 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: x1
n__first(x1,x2)	weight: (/ 1 2) + x1 + x2
activate(x1)	weight: x1
n__from(x1)	weight: (/ 1 4) + x1
#activate(x1)	weight: x1
  n__s(x1)	weight: x1
     0()	weight: 0
  from(x1)	weight: (/ 1 4) + x1
   #s(x1)	weight: 0
#first(x1,x2)	weight: (/ 1 4) + x2
   nil()	weight: 0
 first(x1,x2)	weight: (/ 1 2) + x1 + x2
#from(x1)	weight: 0
  cons(x1,x2)	weight: x2
    Usable rules: { 1..10 }
    Removed DPs: #1 #4..6 #8
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #3 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 4) + x1
n__first(x1,x2)	weight: (/ 1 2) + x2
activate(x1)	weight: (/ 1 4) + x1
n__from(x1)	weight: (/ 1 4)
#activate(x1)	weight: x1
  n__s(x1)	weight: (/ 1 4) + x1
     0()	weight: 0
  from(x1)	weight: (/ 1 4)
   #s(x1)	weight: 0
#first(x1,x2)	weight: (/ 1 4) + x2
   nil()	weight: 0
 first(x1,x2)	weight: (/ 1 2) + x2
#from(x1)	weight: 0
  cons(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0, edges: 0
YES