Input TRS:
    1: fst(0(),Z) -> nil()
    2: fst(s(),cons(Y)) -> cons(Y)
    3: from(X) -> cons(X)
    4: add(0(),X) -> X
    5: add(s(),Y) -> s()
    6: len(nil()) -> 0()
    7: len(cons(X)) -> s()
Number of strict rules: 7
Direct Order(PosReal,>,Poly) ... removes: 4 1 3 5 7 6 2
     s()	weight: 0
   fst(x1,x2)	weight: (/ 1 4) + x1 + 2 * x2
     0()	weight: 0
  from(x1)	weight: (/ 1 2) + x1
   nil()	weight: 0
  cons(x1)	weight: (/ 1 4) + x1
   add(x1,x2)	weight: (/ 1 4) + x1 + x2
   len(x1)	weight: (/ 1 4) + 2 * x1
Number of strict rules: 0
YES