Input TRS:
    1: active(U11(tt(),N,X,XS)) -> mark(U12(splitAt(N,XS),X))
    2: active(U12(pair(YS,ZS),X)) -> mark(pair(cons(X,YS),ZS))
    3: active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS)))
    4: active(and(tt(),X)) -> mark(X)
    5: active(fst(pair(X,Y))) -> mark(X)
    6: active(head(cons(N,XS))) -> mark(N)
    7: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N))))
    8: active(sel(N,XS)) -> mark(head(afterNth(N,XS)))
    9: active(snd(pair(X,Y))) -> mark(Y)
    10: active(splitAt(0(),XS)) -> mark(pair(nil(),XS))
    11: active(splitAt(s(N),cons(X,XS))) -> mark(U11(tt(),N,X,XS))
    12: active(tail(cons(N,XS))) -> mark(XS)
    13: active(take(N,XS)) -> mark(fst(splitAt(N,XS)))
    14: mark(U11(X1,X2,X3,X4)) -> active(U11(mark(X1),X2,X3,X4))
    15: mark(tt()) -> active(tt())
    16: mark(U12(X1,X2)) -> active(U12(mark(X1),X2))
    17: mark(splitAt(X1,X2)) -> active(splitAt(mark(X1),mark(X2)))
    18: mark(pair(X1,X2)) -> active(pair(mark(X1),mark(X2)))
    19: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    20: mark(afterNth(X1,X2)) -> active(afterNth(mark(X1),mark(X2)))
    21: mark(snd(X)) -> active(snd(mark(X)))
    22: mark(and(X1,X2)) -> active(and(mark(X1),X2))
    23: mark(fst(X)) -> active(fst(mark(X)))
    24: mark(head(X)) -> active(head(mark(X)))
    25: mark(natsFrom(X)) -> active(natsFrom(mark(X)))
    26: mark(s(X)) -> active(s(mark(X)))
    27: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2)))
    28: mark(0()) -> active(0())
    29: mark(nil()) -> active(nil())
    30: mark(tail(X)) -> active(tail(mark(X)))
    31: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2)))
    32: U11(mark(X1),X2,X3,X4) -> U11(X1,X2,X3,X4)
    33: U11(X1,mark(X2),X3,X4) -> U11(X1,X2,X3,X4)
    34: U11(X1,X2,mark(X3),X4) -> U11(X1,X2,X3,X4)
    35: U11(X1,X2,X3,mark(X4)) -> U11(X1,X2,X3,X4)
    36: U11(active(X1),X2,X3,X4) -> U11(X1,X2,X3,X4)
    37: U11(X1,active(X2),X3,X4) -> U11(X1,X2,X3,X4)
    38: U11(X1,X2,active(X3),X4) -> U11(X1,X2,X3,X4)
    39: U11(X1,X2,X3,active(X4)) -> U11(X1,X2,X3,X4)
    40: U12(mark(X1),X2) -> U12(X1,X2)
    41: U12(X1,mark(X2)) -> U12(X1,X2)
    42: U12(active(X1),X2) -> U12(X1,X2)
    43: U12(X1,active(X2)) -> U12(X1,X2)
    44: splitAt(mark(X1),X2) -> splitAt(X1,X2)
    45: splitAt(X1,mark(X2)) -> splitAt(X1,X2)
    46: splitAt(active(X1),X2) -> splitAt(X1,X2)
    47: splitAt(X1,active(X2)) -> splitAt(X1,X2)
    48: pair(mark(X1),X2) -> pair(X1,X2)
    49: pair(X1,mark(X2)) -> pair(X1,X2)
    50: pair(active(X1),X2) -> pair(X1,X2)
    51: pair(X1,active(X2)) -> pair(X1,X2)
    52: cons(mark(X1),X2) -> cons(X1,X2)
    53: cons(X1,mark(X2)) -> cons(X1,X2)
    54: cons(active(X1),X2) -> cons(X1,X2)
    55: cons(X1,active(X2)) -> cons(X1,X2)
    56: afterNth(mark(X1),X2) -> afterNth(X1,X2)
    57: afterNth(X1,mark(X2)) -> afterNth(X1,X2)
    58: afterNth(active(X1),X2) -> afterNth(X1,X2)
    59: afterNth(X1,active(X2)) -> afterNth(X1,X2)
    60: snd(mark(X)) -> snd(X)
    61: snd(active(X)) -> snd(X)
    62: and(mark(X1),X2) -> and(X1,X2)
    63: and(X1,mark(X2)) -> and(X1,X2)
    64: and(active(X1),X2) -> and(X1,X2)
    65: and(X1,active(X2)) -> and(X1,X2)
    66: fst(mark(X)) -> fst(X)
    67: fst(active(X)) -> fst(X)
    68: head(mark(X)) -> head(X)
    69: head(active(X)) -> head(X)
    70: natsFrom(mark(X)) -> natsFrom(X)
    71: natsFrom(active(X)) -> natsFrom(X)
    72: s(mark(X)) -> s(X)
    73: s(active(X)) -> s(X)
    74: sel(mark(X1),X2) -> sel(X1,X2)
    75: sel(X1,mark(X2)) -> sel(X1,X2)
    76: sel(active(X1),X2) -> sel(X1,X2)
    77: sel(X1,active(X2)) -> sel(X1,X2)
    78: tail(mark(X)) -> tail(X)
    79: tail(active(X)) -> tail(X)
    80: take(mark(X1),X2) -> take(X1,X2)
    81: take(X1,mark(X2)) -> take(X1,X2)
    82: take(active(X1),X2) -> take(X1,X2)
    83: take(X1,active(X2)) -> take(X1,X2)
Number of strict rules: 83
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(U12(pair(YS,ZS),X)) -> #mark(pair(cons(X,YS),ZS))
   #2: #active(U12(pair(YS,ZS),X)) -> #pair(cons(X,YS),ZS)
   #3: #active(U12(pair(YS,ZS),X)) -> #cons(X,YS)
   #4: #U12(X1,active(X2)) -> #U12(X1,X2)
   #5: #mark(nil()) -> #active(nil())
   #6: #U11(X1,X2,X3,mark(X4)) -> #U11(X1,X2,X3,X4)
   #7: #take(X1,active(X2)) -> #take(X1,X2)
   #8: #fst(mark(X)) -> #fst(X)
   #9: #splitAt(active(X1),X2) -> #splitAt(X1,X2)
   #10: #U12(active(X1),X2) -> #U12(X1,X2)
   #11: #U12(X1,mark(X2)) -> #U12(X1,X2)
   #12: #U11(X1,active(X2),X3,X4) -> #U11(X1,X2,X3,X4)
   #13: #s(active(X)) -> #s(X)
   #14: #splitAt(X1,active(X2)) -> #splitAt(X1,X2)
   #15: #cons(X1,mark(X2)) -> #cons(X1,X2)
   #16: #natsFrom(active(X)) -> #natsFrom(X)
   #17: #pair(mark(X1),X2) -> #pair(X1,X2)
   #18: #sel(X1,mark(X2)) -> #sel(X1,X2)
   #19: #sel(mark(X1),X2) -> #sel(X1,X2)
   #20: #afterNth(active(X1),X2) -> #afterNth(X1,X2)
   #21: #snd(active(X)) -> #snd(X)
   #22: #U11(X1,X2,active(X3),X4) -> #U11(X1,X2,X3,X4)
   #23: #active(head(cons(N,XS))) -> #mark(N)
   #24: #afterNth(X1,active(X2)) -> #afterNth(X1,X2)
   #25: #cons(X1,active(X2)) -> #cons(X1,X2)
   #26: #fst(active(X)) -> #fst(X)
   #27: #U12(mark(X1),X2) -> #U12(X1,X2)
   #28: #pair(X1,active(X2)) -> #pair(X1,X2)
   #29: #active(take(N,XS)) -> #mark(fst(splitAt(N,XS)))
   #30: #active(take(N,XS)) -> #fst(splitAt(N,XS))
   #31: #active(take(N,XS)) -> #splitAt(N,XS)
   #32: #active(snd(pair(X,Y))) -> #mark(Y)
   #33: #active(splitAt(s(N),cons(X,XS))) -> #mark(U11(tt(),N,X,XS))
   #34: #active(splitAt(s(N),cons(X,XS))) -> #U11(tt(),N,X,XS)
   #35: #afterNth(X1,mark(X2)) -> #afterNth(X1,X2)
   #36: #sel(active(X1),X2) -> #sel(X1,X2)
   #37: #mark(head(X)) -> #active(head(mark(X)))
   #38: #mark(head(X)) -> #head(mark(X))
   #39: #mark(head(X)) -> #mark(X)
   #40: #natsFrom(mark(X)) -> #natsFrom(X)
   #41: #mark(fst(X)) -> #active(fst(mark(X)))
   #42: #mark(fst(X)) -> #fst(mark(X))
   #43: #mark(fst(X)) -> #mark(X)
   #44: #take(X1,mark(X2)) -> #take(X1,X2)
   #45: #tail(mark(X)) -> #tail(X)
   #46: #splitAt(X1,mark(X2)) -> #splitAt(X1,X2)
   #47: #head(active(X)) -> #head(X)
   #48: #active(tail(cons(N,XS))) -> #mark(XS)
   #49: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2)))
   #50: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2))
   #51: #mark(take(X1,X2)) -> #mark(X1)
   #52: #mark(take(X1,X2)) -> #mark(X2)
   #53: #tail(active(X)) -> #tail(X)
   #54: #afterNth(mark(X1),X2) -> #afterNth(X1,X2)
   #55: #take(active(X1),X2) -> #take(X1,X2)
   #56: #mark(U11(X1,X2,X3,X4)) -> #active(U11(mark(X1),X2,X3,X4))
   #57: #mark(U11(X1,X2,X3,X4)) -> #U11(mark(X1),X2,X3,X4)
   #58: #mark(U11(X1,X2,X3,X4)) -> #mark(X1)
   #59: #and(mark(X1),X2) -> #and(X1,X2)
   #60: #mark(tail(X)) -> #active(tail(mark(X)))
   #61: #mark(tail(X)) -> #tail(mark(X))
   #62: #mark(tail(X)) -> #mark(X)
   #63: #cons(mark(X1),X2) -> #cons(X1,X2)
   #64: #pair(X1,mark(X2)) -> #pair(X1,X2)
   #65: #mark(natsFrom(X)) -> #active(natsFrom(mark(X)))
   #66: #mark(natsFrom(X)) -> #natsFrom(mark(X))
   #67: #mark(natsFrom(X)) -> #mark(X)
   #68: #mark(afterNth(X1,X2)) -> #active(afterNth(mark(X1),mark(X2)))
   #69: #mark(afterNth(X1,X2)) -> #afterNth(mark(X1),mark(X2))
   #70: #mark(afterNth(X1,X2)) -> #mark(X1)
   #71: #mark(afterNth(X1,X2)) -> #mark(X2)
   #72: #active(natsFrom(N)) -> #mark(cons(N,natsFrom(s(N))))
   #73: #active(natsFrom(N)) -> #cons(N,natsFrom(s(N)))
   #74: #active(natsFrom(N)) -> #natsFrom(s(N))
   #75: #active(natsFrom(N)) -> #s(N)
   #76: #U11(X1,X2,X3,active(X4)) -> #U11(X1,X2,X3,X4)
   #77: #active(splitAt(0(),XS)) -> #mark(pair(nil(),XS))
   #78: #active(splitAt(0(),XS)) -> #pair(nil(),XS)
   #79: #and(active(X1),X2) -> #and(X1,X2)
   #80: #U11(X1,mark(X2),X3,X4) -> #U11(X1,X2,X3,X4)
   #81: #s(mark(X)) -> #s(X)
   #82: #active(fst(pair(X,Y))) -> #mark(X)
   #83: #splitAt(mark(X1),X2) -> #splitAt(X1,X2)
   #84: #and(X1,active(X2)) -> #and(X1,X2)
   #85: #mark(0()) -> #active(0())
   #86: #mark(and(X1,X2)) -> #active(and(mark(X1),X2))
   #87: #mark(and(X1,X2)) -> #and(mark(X1),X2)
   #88: #mark(and(X1,X2)) -> #mark(X1)
   #89: #U11(X1,X2,mark(X3),X4) -> #U11(X1,X2,X3,X4)
   #90: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2)))
   #91: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2))
   #92: #mark(sel(X1,X2)) -> #mark(X1)
   #93: #mark(sel(X1,X2)) -> #mark(X2)
   #94: #snd(mark(X)) -> #snd(X)
   #95: #mark(splitAt(X1,X2)) -> #active(splitAt(mark(X1),mark(X2)))
   #96: #mark(splitAt(X1,X2)) -> #splitAt(mark(X1),mark(X2))
   #97: #mark(splitAt(X1,X2)) -> #mark(X1)
   #98: #mark(splitAt(X1,X2)) -> #mark(X2)
   #99: #U11(mark(X1),X2,X3,X4) -> #U11(X1,X2,X3,X4)
   #100: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2))
   #101: #mark(cons(X1,X2)) -> #cons(mark(X1),X2)
   #102: #mark(cons(X1,X2)) -> #mark(X1)
   #103: #and(X1,mark(X2)) -> #and(X1,X2)
   #104: #mark(s(X)) -> #active(s(mark(X)))
   #105: #mark(s(X)) -> #s(mark(X))
   #106: #mark(s(X)) -> #mark(X)
   #107: #head(mark(X)) -> #head(X)
   #108: #U11(active(X1),X2,X3,X4) -> #U11(X1,X2,X3,X4)
   #109: #mark(snd(X)) -> #active(snd(mark(X)))
   #110: #mark(snd(X)) -> #snd(mark(X))
   #111: #mark(snd(X)) -> #mark(X)
   #112: #mark(U12(X1,X2)) -> #active(U12(mark(X1),X2))
   #113: #mark(U12(X1,X2)) -> #U12(mark(X1),X2)
   #114: #mark(U12(X1,X2)) -> #mark(X1)
   #115: #active(afterNth(N,XS)) -> #mark(snd(splitAt(N,XS)))
   #116: #active(afterNth(N,XS)) -> #snd(splitAt(N,XS))
   #117: #active(afterNth(N,XS)) -> #splitAt(N,XS)
   #118: #sel(X1,active(X2)) -> #sel(X1,X2)
   #119: #active(U11(tt(),N,X,XS)) -> #mark(U12(splitAt(N,XS),X))
   #120: #active(U11(tt(),N,X,XS)) -> #U12(splitAt(N,XS),X)
   #121: #active(U11(tt(),N,X,XS)) -> #splitAt(N,XS)
   #122: #cons(active(X1),X2) -> #cons(X1,X2)
   #123: #active(sel(N,XS)) -> #mark(head(afterNth(N,XS)))
   #124: #active(sel(N,XS)) -> #head(afterNth(N,XS))
   #125: #active(sel(N,XS)) -> #afterNth(N,XS)
   #126: #mark(tt()) -> #active(tt())
   #127: #active(and(tt(),X)) -> #mark(X)
   #128: #take(mark(X1),X2) -> #take(X1,X2)
   #129: #pair(active(X1),X2) -> #pair(X1,X2)
   #130: #mark(pair(X1,X2)) -> #active(pair(mark(X1),mark(X2)))
   #131: #mark(pair(X1,X2)) -> #pair(mark(X1),mark(X2))
   #132: #mark(pair(X1,X2)) -> #mark(X1)
   #133: #mark(pair(X1,X2)) -> #mark(X2)
Number of SCCs: 16, DPs: 97, edges: 1044
	SCC { #21 #94 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #21 #94
Number of SCCs: 15, DPs: 95, edges: 1040
	SCC { #13 #81 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #13 #81
Number of SCCs: 14, DPs: 93, edges: 1036
	SCC { #16 #40 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #16 #40
Number of SCCs: 13, DPs: 91, edges: 1032
	SCC { #45 #53 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #45 #53
Number of SCCs: 12, DPs: 89, edges: 1028
	SCC { #8 #26 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #8 #26
Number of SCCs: 11, DPs: 87, edges: 1024
	SCC { #47 #107 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #47 #107
Number of SCCs: 10, DPs: 85, edges: 1020
	SCC { #20 #24 #35 #54 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #24 #35
Number of SCCs: 10, DPs: 83, edges: 1008
	SCC { #20 #54 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #20 #54
Number of SCCs: 9, DPs: 81, edges: 1004
	SCC { #17 #28 #64 #129 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: x1
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #17 #129
Number of SCCs: 10, DPs: 79, edges: 992
	SCC { #28 #64 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: x2
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #28 #64
Number of SCCs: 9, DPs: 77, edges: 988
	SCC { #4 #10 #11 #27 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	weight: x2
  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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #4 #11
Number of SCCs: 10, DPs: 75, edges: 976
	SCC { #10 #27 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #10 #27
Number of SCCs: 9, DPs: 73, edges: 972
	SCC { #15 #25 #63 #122 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: x2
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #15 #25
Number of SCCs: 10, DPs: 71, edges: 960
	SCC { #63 #122 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: x1
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #63 #122
Number of SCCs: 9, DPs: 69, edges: 956
	SCC { #9 #14 #46 #83 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #14 #46
Number of SCCs: 10, DPs: 67, edges: 944
	SCC { #9 #83 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #9 #83
Number of SCCs: 9, DPs: 65, edges: 940
	SCC { #18 #19 #36 #118 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #18 #118
Number of SCCs: 10, DPs: 63, edges: 928
	SCC { #19 #36 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #19 #36
Number of SCCs: 9, DPs: 61, edges: 924
	SCC { #59 #79 #84 #103 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: x1
    Usable rules: { }
    Removed DPs: #59 #79
Number of SCCs: 10, DPs: 59, edges: 912
	SCC { #84 #103 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: x2
    Usable rules: { }
    Removed DPs: #84 #103
Number of SCCs: 9, DPs: 57, edges: 908
	SCC { #7 #44 #55 #128 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: x1
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #55 #128
Number of SCCs: 10, DPs: 55, edges: 896
	SCC { #7 #44 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: x2
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #7 #44
Number of SCCs: 9, DPs: 53, edges: 892
	SCC { #6 #12 #22 #76 #80 #89 #99 #108 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	weight: x2 + x3 + x4
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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #6 #12 #22 #76 #80 #89
Number of SCCs: 10, DPs: 47, edges: 832
	SCC { #99 #108 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	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
   U12(x1,x2)	weight: 0
 #U12(x1,x2)	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
 #U11(x1,x2,x3,x4)	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
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #99 #108
Number of SCCs: 9, DPs: 45, edges: 828
	SCC { #1 #23 #29 #32 #33 #37 #39 #41 #43 #48 #49 #51 #52 #56 #58 #60 #62 #65 #67 #68 #70..72 #77 #82 #86 #88 #90 #92 #93 #95 #97 #98 #102 #106 #109 #111 #112 #114 #115 #119 #123 #127 #132 #133 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
   U11(x1,x2,x3,x4)	weight: max{(/ 207253 8) + x4, (/ 103627 4) + x3, (/ 51813 2) + x2, (/ 207251 8) + x1}
#cons(x1,x2)	weight: 0
     s(x1)	weight: x1
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: max{25907 + x2, (/ 207255 8) + x1}
   and(x1,x2)	weight: max{(/ 1 4) + x2, (/ 1 8) + x1}
  pair(x1,x2)	weight: max{(/ 207251 8) + x2, (/ 1 8) + x1}
   fst(x1)	weight: (/ 1 8) + x1
natsFrom(x1)	weight: (/ 1 4) + x1
#head(x1)	weight: 0
splitAt(x1,x2)	weight: max{(/ 207253 8) + x2, (/ 51813 2) + x1}
 #fst(x1)	weight: 0
   U12(x1,x2)	weight: max{(/ 1 4) + x2, x1}
 #U12(x1,x2)	weight: 0
  tail(x1)	weight: (/ 1 8) + x1
#mark(x1)	weight: x1
     0()	weight: 0
 #sel(x1,x2)	weight: 0
   sel(x1,x2)	weight: max{(/ 207257 8) + x2, 25907 + x1}
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: max{(/ 103627 4) + x2, (/ 207253 8) + x1}
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: x1
#afterNth(x1,x2)	weight: 0
 #U11(x1,x2,x3,x4)	weight: 0
active(x1)	weight: x1
  head(x1)	weight: (/ 1 8) + x1
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: max{x2, (/ 1 8) + x1}
#natsFrom(x1)	weight: 0
#active(x1)	weight: x1
   snd(x1)	weight: (/ 1 8) + x1
    tt()	weight: (/ 3 8)
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { 1..83 }
    Removed DPs: #23 #29 #32 #39 #43 #48 #51 #52 #58 #62 #67 #70 #71 #77 #82 #88 #92 #93 #97 #98 #102 #111 #123 #127 #132 #133
Number of SCCs: 10, DPs: 6, edges: 12
	SCC { #33 #56 #95 #106 #114 #119 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U11(x1,x2,x3,x4)	weight: (/ 1 4)
#cons(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 4) + x1
#take(x1,x2)	weight: 0
  take(x1,x2)	weight: 0
   and(x1,x2)	weight: 0
  pair(x1,x2)	weight: (/ 1 4) + x1
   fst(x1)	weight: (/ 1 4)
natsFrom(x1)	weight: (/ 1 4)
#head(x1)	weight: 0
splitAt(x1,x2)	weight: (/ 1 4)
 #fst(x1)	weight: 0
   U12(x1,x2)	weight: x1
 #U12(x1,x2)	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: 0
   nil()	weight: 0
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 4) + x1
#afterNth(x1,x2)	weight: 0
 #U11(x1,x2,x3,x4)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  head(x1)	weight: (/ 1 4)
 #snd(x1)	weight: 0
  cons(x1,x2)	weight: (/ 1 4) + x1
#natsFrom(x1)	weight: 0
#active(x1)	weight: (/ 1 4)
   snd(x1)	weight: 0
    tt()	weight: 0
#pair(x1,x2)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { 32..55 }
    Removed DPs: #106
Number of SCCs: 10, DPs: 5, edges: 7
	SCC { #33 #56 #95 #114 #119 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded.
   U11(x1,x2,x3,x4)	weight: max{(/ 83907 4) + x4, (/ 167815 8) + x3, (/ 41953 2) + x2, (/ 167811 8) + x1}	status: [x2,x3]	precedence above: and pair natsFrom splitAt U12 #mark sel afterNth nil mark active cons #active tt
#cons(x1,x2)	weight: (/ 1 8) + x2	status: [x2]	precedence above:
     s(x1)	weight: x1	status: [x1]	precedence above: and pair #mark sel afterNth mark active #active tt
#take(x1,x2)	weight: (/ 1 8) + x2 + x1	status: [x2,x1]	precedence above:
  take(x1,x2)	weight: 20977 + x2 + x1	status: [x1,x2]	precedence above: fst
   and(x1,x2)	weight: (/ 1 8) + x2	status: []	precedence above: pair #mark sel afterNth mark active #active
  pair(x1,x2)	weight: max{x2, x1}	status: [x1,x2]	precedence above:
   fst(x1)	weight: (/ 1 8) + x1	status: [x1]	precedence above:
natsFrom(x1)	weight: (/ 3 8) + x1	status: [x1]	precedence above: pair U12 cons
#head(x1)	weight: (/ 1 8)	status: []	precedence above:
splitAt(x1,x2)	weight: max{(/ 83907 4) + x2, (/ 41953 2) + x1}	status: [x1]	precedence above: U11 and pair natsFrom U12 #mark sel afterNth nil mark active cons #active tt
 #fst(x1)	weight: x1	status: []	precedence above:
   U12(x1,x2)	weight: max{(/ 167811 8) + x2, x1}	status: [x2,x1]	precedence above: pair natsFrom cons
 #U12(x1,x2)	weight: (/ 1 8) + x1	status: [x1]	precedence above:
  tail(x1)	weight: (/ 1 8) + x1	status: []	precedence above:
#mark(x1)	weight: x1	status: [x1]	precedence above: and pair sel afterNth mark active #active
     0()	weight: (/ 1 2)	status: []	precedence above: nil
 #sel(x1,x2)	weight: (/ 1 8) + x2 + x1	status: [x2,x1]	precedence above:
   sel(x1,x2)	weight: (/ 167817 8) + x2 + x1	status: [x2,x1]	precedence above: and pair #mark afterNth mark active #active
   #s(x1)	weight: x1	status: []	precedence above:
afterNth(x1,x2)	weight: (/ 167815 8) + x2 + x1	status: []	precedence above: and pair #mark sel mark active #active
   nil()	weight: (/ 167815 8)	status: []	precedence above:
#tail(x1)	weight: (/ 1 8)	status: []	precedence above:
#splitAt(x1,x2)	weight: (/ 1 8) + x2 + x1	status: [x1,x2]	precedence above:
  mark(x1)	weight: x1	status: x1
#afterNth(x1,x2)	weight: (/ 1 8) + x1	status: [x1]	precedence above:
 #U11(x1,x2,x3,x4)	weight: (/ 1 8) + x4 + x2 + x1	status: [x1,x4,x2]	precedence above:
active(x1)	weight: x1	status: x1
  head(x1)	weight: (/ 1 8) + x1	status: [x1]	precedence above:
 #snd(x1)	weight: x1	status: []	precedence above:
  cons(x1,x2)	weight: max{x2, (/ 1 4) + x1}	status: []	precedence above: pair natsFrom U12
#natsFrom(x1)	weight: x1	status: []	precedence above:
#active(x1)	weight: x1	status: [x1]	precedence above: and pair #mark sel afterNth mark active
   snd(x1)	weight: x1	status: [x1]	precedence above:
    tt()	weight: (/ 1 4)	status: []	precedence above: and pair #mark sel afterNth mark active #active
#pair(x1,x2)	weight: (/ 1 8) + x2 + x1	status: [x2,x1]	precedence above:
 #and(x1,x2)	weight: (/ 1 8)	status: []	precedence above:
    Usable rules: { 1..83 }
    Removed DPs: #33 #114 #119
Number of SCCs: 9, DPs: 0, edges: 0
YES