Input TRS:
    1: from(X) -> cons(X,n__from(s(X)))
    2: after(0(),XS) -> XS
    3: after(s(N),cons(X,XS)) -> after(N,activate(XS))
    4: from(X) -> n__from(X)
    5: activate(n__from(X)) -> from(X)
    6: activate(X) -> X
Number of strict rules: 6
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #activate(n__from(X)) -> #from(X)
   #2: #after(s(N),cons(X,XS)) -> #after(N,activate(XS))
   #3: #after(s(N),cons(X,XS)) -> #activate(XS)
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 8) + x1
activate(x1)	weight: (/ 1 8)
n__from(x1)	weight: (/ 3 8) + x1
#activate(x1)	weight: 0
 after(x1,x2)	weight: 0
     0()	weight: 0
  from(x1)	weight: (/ 1 4)
#after(x1,x2)	weight: x1
#from(x1)	weight: 0
  cons(x1,x2)	weight: (/ 1 8) + x2
    Usable rules: { }
    Removed DPs: #2
Number of SCCs: 0, DPs: 0, edges: 0
YES