Input TRS:
    1: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N))))
    2: active(fst(pair(XS,YS))) -> mark(XS)
    3: active(snd(pair(XS,YS))) -> mark(YS)
    4: active(splitAt(0(),XS)) -> mark(pair(nil(),XS))
    5: active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS))
    6: active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS))
    7: active(head(cons(N,XS))) -> mark(N)
    8: active(tail(cons(N,XS))) -> mark(XS)
    9: active(sel(N,XS)) -> mark(head(afterNth(N,XS)))
    10: active(take(N,XS)) -> mark(fst(splitAt(N,XS)))
    11: active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS)))
    12: mark(natsFrom(X)) -> active(natsFrom(mark(X)))
    13: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    14: mark(s(X)) -> active(s(mark(X)))
    15: mark(fst(X)) -> active(fst(mark(X)))
    16: mark(pair(X1,X2)) -> active(pair(mark(X1),mark(X2)))
    17: mark(snd(X)) -> active(snd(mark(X)))
    18: mark(splitAt(X1,X2)) -> active(splitAt(mark(X1),mark(X2)))
    19: mark(0()) -> active(0())
    20: mark(nil()) -> active(nil())
    21: mark(u(X1,X2,X3,X4)) -> active(u(mark(X1),X2,X3,X4))
    22: mark(head(X)) -> active(head(mark(X)))
    23: mark(tail(X)) -> active(tail(mark(X)))
    24: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2)))
    25: mark(afterNth(X1,X2)) -> active(afterNth(mark(X1),mark(X2)))
    26: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2)))
    27: natsFrom(mark(X)) -> natsFrom(X)
    28: natsFrom(active(X)) -> natsFrom(X)
    29: cons(mark(X1),X2) -> cons(X1,X2)
    30: cons(X1,mark(X2)) -> cons(X1,X2)
    31: cons(active(X1),X2) -> cons(X1,X2)
    32: cons(X1,active(X2)) -> cons(X1,X2)
    33: s(mark(X)) -> s(X)
    34: s(active(X)) -> s(X)
    35: fst(mark(X)) -> fst(X)
    36: fst(active(X)) -> fst(X)
    37: pair(mark(X1),X2) -> pair(X1,X2)
    38: pair(X1,mark(X2)) -> pair(X1,X2)
    39: pair(active(X1),X2) -> pair(X1,X2)
    40: pair(X1,active(X2)) -> pair(X1,X2)
    41: snd(mark(X)) -> snd(X)
    42: snd(active(X)) -> snd(X)
    43: splitAt(mark(X1),X2) -> splitAt(X1,X2)
    44: splitAt(X1,mark(X2)) -> splitAt(X1,X2)
    45: splitAt(active(X1),X2) -> splitAt(X1,X2)
    46: splitAt(X1,active(X2)) -> splitAt(X1,X2)
    47: u(mark(X1),X2,X3,X4) -> u(X1,X2,X3,X4)
    48: u(X1,mark(X2),X3,X4) -> u(X1,X2,X3,X4)
    49: u(X1,X2,mark(X3),X4) -> u(X1,X2,X3,X4)
    50: u(X1,X2,X3,mark(X4)) -> u(X1,X2,X3,X4)
    51: u(active(X1),X2,X3,X4) -> u(X1,X2,X3,X4)
    52: u(X1,active(X2),X3,X4) -> u(X1,X2,X3,X4)
    53: u(X1,X2,active(X3),X4) -> u(X1,X2,X3,X4)
    54: u(X1,X2,X3,active(X4)) -> u(X1,X2,X3,X4)
    55: head(mark(X)) -> head(X)
    56: head(active(X)) -> head(X)
    57: tail(mark(X)) -> tail(X)
    58: tail(active(X)) -> tail(X)
    59: sel(mark(X1),X2) -> sel(X1,X2)
    60: sel(X1,mark(X2)) -> sel(X1,X2)
    61: sel(active(X1),X2) -> sel(X1,X2)
    62: sel(X1,active(X2)) -> sel(X1,X2)
    63: afterNth(mark(X1),X2) -> afterNth(X1,X2)
    64: afterNth(X1,mark(X2)) -> afterNth(X1,X2)
    65: afterNth(active(X1),X2) -> afterNth(X1,X2)
    66: afterNth(X1,active(X2)) -> afterNth(X1,X2)
    67: take(mark(X1),X2) -> take(X1,X2)
    68: take(X1,mark(X2)) -> take(X1,X2)
    69: take(active(X1),X2) -> take(X1,X2)
    70: take(X1,active(X2)) -> take(X1,X2)
Number of strict rules: 70
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(fst(pair(XS,YS))) -> #mark(XS)
   #2: #splitAt(mark(X1),X2) -> #splitAt(X1,X2)
   #3: #cons(mark(X1),X2) -> #cons(X1,X2)
   #4: #fst(mark(X)) -> #fst(X)
   #5: #afterNth(X1,active(X2)) -> #afterNth(X1,X2)
   #6: #splitAt(X1,active(X2)) -> #splitAt(X1,X2)
   #7: #snd(active(X)) -> #snd(X)
   #8: #snd(mark(X)) -> #snd(X)
   #9: #pair(mark(X1),X2) -> #pair(X1,X2)
   #10: #u(mark(X1),X2,X3,X4) -> #u(X1,X2,X3,X4)
   #11: #u(X1,X2,active(X3),X4) -> #u(X1,X2,X3,X4)
   #12: #u(X1,mark(X2),X3,X4) -> #u(X1,X2,X3,X4)
   #13: #tail(active(X)) -> #tail(X)
   #14: #sel(active(X1),X2) -> #sel(X1,X2)
   #15: #pair(X1,mark(X2)) -> #pair(X1,X2)
   #16: #active(u(pair(YS,ZS),N,X,XS)) -> #mark(pair(cons(X,YS),ZS))
   #17: #active(u(pair(YS,ZS),N,X,XS)) -> #pair(cons(X,YS),ZS)
   #18: #active(u(pair(YS,ZS),N,X,XS)) -> #cons(X,YS)
   #19: #sel(mark(X1),X2) -> #sel(X1,X2)
   #20: #head(mark(X)) -> #head(X)
   #21: #take(mark(X1),X2) -> #take(X1,X2)
   #22: #pair(X1,active(X2)) -> #pair(X1,X2)
   #23: #u(active(X1),X2,X3,X4) -> #u(X1,X2,X3,X4)
   #24: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2))
   #25: #mark(cons(X1,X2)) -> #cons(mark(X1),X2)
   #26: #mark(cons(X1,X2)) -> #mark(X1)
   #27: #active(sel(N,XS)) -> #mark(head(afterNth(N,XS)))
   #28: #active(sel(N,XS)) -> #head(afterNth(N,XS))
   #29: #active(sel(N,XS)) -> #afterNth(N,XS)
   #30: #active(afterNth(N,XS)) -> #mark(snd(splitAt(N,XS)))
   #31: #active(afterNth(N,XS)) -> #snd(splitAt(N,XS))
   #32: #active(afterNth(N,XS)) -> #splitAt(N,XS)
   #33: #tail(mark(X)) -> #tail(X)
   #34: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2)))
   #35: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2))
   #36: #mark(sel(X1,X2)) -> #mark(X1)
   #37: #mark(sel(X1,X2)) -> #mark(X2)
   #38: #take(X1,active(X2)) -> #take(X1,X2)
   #39: #mark(tail(X)) -> #active(tail(mark(X)))
   #40: #mark(tail(X)) -> #tail(mark(X))
   #41: #mark(tail(X)) -> #mark(X)
   #42: #splitAt(active(X1),X2) -> #splitAt(X1,X2)
   #43: #take(active(X1),X2) -> #take(X1,X2)
   #44: #mark(natsFrom(X)) -> #active(natsFrom(mark(X)))
   #45: #mark(natsFrom(X)) -> #natsFrom(mark(X))
   #46: #mark(natsFrom(X)) -> #mark(X)
   #47: #cons(active(X1),X2) -> #cons(X1,X2)
   #48: #head(active(X)) -> #head(X)
   #49: #mark(s(X)) -> #active(s(mark(X)))
   #50: #mark(s(X)) -> #s(mark(X))
   #51: #mark(s(X)) -> #mark(X)
   #52: #sel(X1,active(X2)) -> #sel(X1,X2)
   #53: #cons(X1,mark(X2)) -> #cons(X1,X2)
   #54: #u(X1,active(X2),X3,X4) -> #u(X1,X2,X3,X4)
   #55: #u(X1,X2,mark(X3),X4) -> #u(X1,X2,X3,X4)
   #56: #mark(afterNth(X1,X2)) -> #active(afterNth(mark(X1),mark(X2)))
   #57: #mark(afterNth(X1,X2)) -> #afterNth(mark(X1),mark(X2))
   #58: #mark(afterNth(X1,X2)) -> #mark(X1)
   #59: #mark(afterNth(X1,X2)) -> #mark(X2)
   #60: #mark(nil()) -> #active(nil())
   #61: #active(head(cons(N,XS))) -> #mark(N)
   #62: #pair(active(X1),X2) -> #pair(X1,X2)
   #63: #active(take(N,XS)) -> #mark(fst(splitAt(N,XS)))
   #64: #active(take(N,XS)) -> #fst(splitAt(N,XS))
   #65: #active(take(N,XS)) -> #splitAt(N,XS)
   #66: #afterNth(X1,mark(X2)) -> #afterNth(X1,X2)
   #67: #s(mark(X)) -> #s(X)
   #68: #active(splitAt(s(N),cons(X,XS))) -> #mark(u(splitAt(N,XS),N,X,XS))
   #69: #active(splitAt(s(N),cons(X,XS))) -> #u(splitAt(N,XS),N,X,XS)
   #70: #active(splitAt(s(N),cons(X,XS))) -> #splitAt(N,XS)
   #71: #splitAt(X1,mark(X2)) -> #splitAt(X1,X2)
   #72: #afterNth(active(X1),X2) -> #afterNth(X1,X2)
   #73: #natsFrom(active(X)) -> #natsFrom(X)
   #74: #mark(head(X)) -> #active(head(mark(X)))
   #75: #mark(head(X)) -> #head(mark(X))
   #76: #mark(head(X)) -> #mark(X)
   #77: #s(active(X)) -> #s(X)
   #78: #natsFrom(mark(X)) -> #natsFrom(X)
   #79: #sel(X1,mark(X2)) -> #sel(X1,X2)
   #80: #mark(snd(X)) -> #active(snd(mark(X)))
   #81: #mark(snd(X)) -> #snd(mark(X))
   #82: #mark(snd(X)) -> #mark(X)
   #83: #cons(X1,active(X2)) -> #cons(X1,X2)
   #84: #mark(0()) -> #active(0())
   #85: #afterNth(mark(X1),X2) -> #afterNth(X1,X2)
   #86: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2)))
   #87: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2))
   #88: #mark(take(X1,X2)) -> #mark(X1)
   #89: #mark(take(X1,X2)) -> #mark(X2)
   #90: #take(X1,mark(X2)) -> #take(X1,X2)
   #91: #fst(active(X)) -> #fst(X)
   #92: #mark(u(X1,X2,X3,X4)) -> #active(u(mark(X1),X2,X3,X4))
   #93: #mark(u(X1,X2,X3,X4)) -> #u(mark(X1),X2,X3,X4)
   #94: #mark(u(X1,X2,X3,X4)) -> #mark(X1)
   #95: #mark(pair(X1,X2)) -> #active(pair(mark(X1),mark(X2)))
   #96: #mark(pair(X1,X2)) -> #pair(mark(X1),mark(X2))
   #97: #mark(pair(X1,X2)) -> #mark(X1)
   #98: #mark(pair(X1,X2)) -> #mark(X2)
   #99: #active(snd(pair(XS,YS))) -> #mark(YS)
   #100: #active(natsFrom(N)) -> #mark(cons(N,natsFrom(s(N))))
   #101: #active(natsFrom(N)) -> #cons(N,natsFrom(s(N)))
   #102: #active(natsFrom(N)) -> #natsFrom(s(N))
   #103: #active(natsFrom(N)) -> #s(N)
   #104: #u(X1,X2,X3,active(X4)) -> #u(X1,X2,X3,X4)
   #105: #active(tail(cons(N,XS))) -> #mark(XS)
   #106: #mark(fst(X)) -> #active(fst(mark(X)))
   #107: #mark(fst(X)) -> #fst(mark(X))
   #108: #mark(fst(X)) -> #mark(X)
   #109: #active(splitAt(0(),XS)) -> #mark(pair(nil(),XS))
   #110: #active(splitAt(0(),XS)) -> #pair(nil(),XS)
   #111: #u(X1,X2,X3,mark(X4)) -> #u(X1,X2,X3,X4)
   #112: #mark(splitAt(X1,X2)) -> #active(splitAt(mark(X1),mark(X2)))
   #113: #mark(splitAt(X1,X2)) -> #splitAt(mark(X1),mark(X2))
   #114: #mark(splitAt(X1,X2)) -> #mark(X1)
   #115: #mark(splitAt(X1,X2)) -> #mark(X2)
Number of SCCs: 14, DPs: 83, edges: 824
	SCC { #20 #48 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: x1
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #20 #48
Number of SCCs: 13, DPs: 81, edges: 820
	SCC { #4 #91 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: x1
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #4 #91
Number of SCCs: 12, DPs: 79, edges: 816
	SCC { #7 #8 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: x1
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #7 #8
Number of SCCs: 11, DPs: 77, edges: 812
	SCC { #67 #77 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: x1
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #67 #77
Number of SCCs: 10, DPs: 75, edges: 808
	SCC { #73 #78 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: x1
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #73 #78
Number of SCCs: 9, DPs: 73, edges: 804
	SCC { #13 #33 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: x1
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #13 #33
Number of SCCs: 8, DPs: 71, edges: 800
	SCC { #2 #6 #42 #71 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: x2
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #6 #71
Number of SCCs: 8, DPs: 69, edges: 788
	SCC { #2 #42 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: x1
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #2 #42
Number of SCCs: 7, DPs: 67, edges: 784
	SCC { #21 #38 #43 #90 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: x2
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #38 #90
Number of SCCs: 8, DPs: 65, edges: 772
	SCC { #21 #43 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: x1
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #21 #43
Number of SCCs: 7, DPs: 63, edges: 768
	SCC { #9 #15 #22 #62 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: x1
    Usable rules: { }
    Removed DPs: #9 #62
Number of SCCs: 8, DPs: 61, edges: 756
	SCC { #15 #22 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: x2
    Usable rules: { }
    Removed DPs: #15 #22
Number of SCCs: 7, DPs: 59, edges: 752
	SCC { #3 #47 #53 #83 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: x1
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #3 #47
Number of SCCs: 8, DPs: 57, edges: 740
	SCC { #53 #83 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: x2
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #53 #83
Number of SCCs: 7, DPs: 55, edges: 736
	SCC { #5 #66 #72 #85 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: x1
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #72 #85
Number of SCCs: 8, DPs: 53, edges: 724
	SCC { #5 #66 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: x2
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #5 #66
Number of SCCs: 7, DPs: 51, edges: 720
	SCC { #14 #19 #52 #79 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: x2
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #52 #79
Number of SCCs: 8, DPs: 49, edges: 708
	SCC { #14 #19 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: x1
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #14 #19
Number of SCCs: 7, DPs: 47, edges: 704
	SCC { #10..12 #23 #54 #55 #104 #111 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: x2 + x3 + x4
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #11 #12 #54 #55 #104 #111
Number of SCCs: 8, DPs: 41, edges: 644
	SCC { #10 #23 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: 0
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: x1
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: 0
#head(x1)	weight: 0
splitAt(x1,x2)	weight: 0
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: 0
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: 0
#natsFrom(x1)	weight: 0
#active(x1)	weight: 0
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #10 #23
Number of SCCs: 7, DPs: 39, edges: 640
	SCC { #1 #16 #26 #27 #30 #34 #36 #37 #39 #41 #44 #46 #51 #56 #58 #59 #61 #63 #68 #74 #76 #80 #82 #86 #88 #89 #92 #94 #97..100 #105 #106 #108 #109 #112 #114 #115 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: x1
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: max{(/ 258283 8) + x4, (/ 129143 4) + x3, (/ 129141 4) + x2, x1}
  take(x1,x2)	weight: max{(/ 258287 8) + x2, 32286 + x1}
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: max{(/ 1 8) + x2, (/ 64571 2) + x1}
   fst(x1)	weight: (/ 1 8) + x1
natsFrom(x1)	weight: (/ 3 8) + x1
#head(x1)	weight: 0
splitAt(x1,x2)	weight: max{(/ 64571 2) + x2, (/ 258285 8) + x1}
 #fst(x1)	weight: 0
  tail(x1)	weight: (/ 1 8) + x1
#mark(x1)	weight: x1
     0()	weight: (/ 1 8)
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: max{(/ 258291 8) + x2, (/ 129145 4) + x1}
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: max{32286 + x2, (/ 258287 8) + x1}
   nil()	weight: (/ 1 8)
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: x1
  head(x1)	weight: (/ 1 8) + x1
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: max{x2, (/ 1 4) + x1}
#natsFrom(x1)	weight: 0
#active(x1)	weight: x1
   snd(x1)	weight: (/ 1 8) + x1
#pair(x1,x2)	weight: 0
    Usable rules: { 1..70 }
    Removed DPs: #1 #26 #27 #30 #36 #37 #41 #46 #58 #59 #61 #63 #76 #82 #88 #89 #97..99 #105 #108 #109 #114 #115
Number of SCCs: 8, DPs: 4, edges: 8
	SCC { #51 #68 #94 #112 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 4) + x1
#take(x1,x2)	weight: 0
     u(x1,x2,x3,x4)	weight: x1
  take(x1,x2)	weight: 0
   #u(x1,x2,x3,x4)	weight: 0
  pair(x1,x2)	weight: 0
   fst(x1)	weight: 0
natsFrom(x1)	weight: (/ 1 4)
#head(x1)	weight: 0
splitAt(x1,x2)	weight: (/ 1 4)
 #fst(x1)	weight: 0
  tail(x1)	weight: 0
#mark(x1)	weight: x1
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: 0
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: (/ 1 4)
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 4) + x1
#afterNth(x1,x2)	weight: 0
active(x1)	weight: (/ 1 4) + x1
  head(x1)	weight: 0
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: (/ 1 4)
#natsFrom(x1)	weight: 0
#active(x1)	weight: (/ 1 4)
   snd(x1)	weight: 0
#pair(x1,x2)	weight: 0
    Usable rules: { 1 12 13 19 20 27..58 67..70 }
    Removed DPs: #51
Number of SCCs: 8, DPs: 3, edges: 4
	SCC { #68 #94 #112 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded.
#cons(x1,x2)	weight: x2	status: []	precedence above:
     s(x1)	weight: x1	status: [x1]	precedence above:
#take(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
     u(x1,x2,x3,x4)	weight: max{0, (/ 3 8) + x3, (/ 1 8) + x2, x1}	status: [x2,x3,x1]	precedence above: pair
  take(x1,x2)	weight: (/ 7 16) + x2 + x1	status: [x2]	precedence above: fst
   #u(x1,x2,x3,x4)	weight: (/ 1 16) + x4 + x3 + x2 + x1	status: [x1,x2,x3,x4]	precedence above:
  pair(x1,x2)	weight: max{(/ 7 16) + x2, (/ 3 16) + x1}	status: [x2,x1]	precedence above:
   fst(x1)	weight: (/ 1 16) + x1	status: []	precedence above: take
natsFrom(x1)	weight: (/ 1 8) + x1	status: []	precedence above: s cons
#head(x1)	weight: x1	status: []	precedence above:
splitAt(x1,x2)	weight: (/ 5 16) + x2 + x1	status: [x1]	precedence above: u pair
 #fst(x1)	weight: x1	status: []	precedence above:
  tail(x1)	weight: (/ 1 16) + x1	status: [x1]	precedence above:
#mark(x1)	weight: (/ 1 2) + x1	status: [x1]	precedence above: take pair fst #active
     0()	weight: (/ 1 2)	status: []	precedence above: pair nil
 #sel(x1,x2)	weight: x2	status: [x2]	precedence above:
   sel(x1,x2)	weight: (/ 7 16) + x2 + x1	status: []	precedence above: u pair splitAt afterNth head snd
   #s(x1)	weight: (/ 1 16)	status: []	precedence above:
afterNth(x1,x2)	weight: (/ 7 16) + x2 + x1	status: [x1,x2]	precedence above: u pair splitAt snd
   nil()	weight: (/ 1 4)	status: []	precedence above:
#tail(x1)	weight: (/ 1 16)	status: []	precedence above:
#splitAt(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
  mark(x1)	weight: x1	status: x1
#afterNth(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
active(x1)	weight: x1	status: x1
  head(x1)	weight: x1	status: []	precedence above: u pair splitAt sel afterNth snd
 #snd(x1)	weight: (/ 1 16)	status: []	precedence above:
  cons(x1,x2)	weight: max{x2, (/ 1 8) + x1}	status: []	precedence above:
#natsFrom(x1)	weight: x1	status: []	precedence above:
#active(x1)	weight: (/ 1 2) + x1	status: [x1]	precedence above: take pair fst #mark
   snd(x1)	weight: (/ 1 16) + x1	status: []	precedence above:
#pair(x1,x2)	weight: (/ 1 16)	status: []	precedence above:
    Usable rules: { 1..70 }
    Removed DPs: #94
Number of SCCs: 7, DPs: 0, edges: 0
YES