Input TRS:
    1: a__zeros() -> cons(0(),zeros())
    2: a__tail(cons(X,XS)) -> mark(XS)
    3: mark(zeros()) -> a__zeros()
    4: mark(tail(X)) -> a__tail(mark(X))
    5: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    6: mark(0()) -> 0()
    7: a__zeros() -> zeros()
    8: a__tail(X) -> tail(X)
Number of strict rules: 8
Direct Order(PosReal,>,Poly) ... removes: 3 6 2
 zeros()	weight: 0
  tail(x1)	weight: (/ 1 4) + x1
     0()	weight: 0
  mark(x1)	weight: (/ 1 8) + x1
  cons(x1,x2)	weight: x1 + x2
a__tail(x1)	weight: (/ 1 4) + x1
a__zeros()	weight: 0
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... removes: 4 8
 zeros()	weight: 0
  tail(x1)	weight: (/ 1 4) + x1
     0()	weight: 0
  mark(x1)	weight: (/ 1 8) + 2 * x1
  cons(x1,x2)	weight: x1 + x2
a__tail(x1)	weight: (/ 3 8) + x1
a__zeros()	weight: 0
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #mark(cons(X1,X2)) -> #mark(X1)
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
 zeros()	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: x1
     0()	weight: 0
#a__zeros()	weight: 0
  mark(x1)	weight: 0
  cons(x1,x2)	weight: (/ 1 2) + x1
a__tail(x1)	weight: 0
a__zeros()	weight: 0
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0, edges: 0
YES