Input TRS:
    1: U101(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS)))
    2: U11(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS)))
    3: U21(tt(),X) -> activate(X)
    4: U31(tt(),N) -> activate(N)
    5: U41(tt(),N) -> cons(activate(N),n__natsFrom(n__s(activate(N))))
    6: U51(tt(),N,XS) -> head(afterNth(activate(N),activate(XS)))
    7: U61(tt(),Y) -> activate(Y)
    8: U71(tt(),XS) -> pair(nil(),activate(XS))
    9: U81(tt(),N,X,XS) -> U82(splitAt(activate(N),activate(XS)),activate(X))
    10: U82(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS)
    11: U91(tt(),XS) -> activate(XS)
    12: afterNth(N,XS) -> U11(and(isNatural(N),n__isLNat(XS)),N,XS)
    13: and(tt(),X) -> activate(X)
    14: fst(pair(X,Y)) -> U21(and(isLNat(X),n__isLNat(Y)),X)
    15: head(cons(N,XS)) -> U31(and(isNatural(N),n__isLNat(activate(XS))),N)
    16: isLNat(n__nil()) -> tt()
    17: isLNat(n__afterNth(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2)))
    18: isLNat(n__cons(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2)))
    19: isLNat(n__fst(V1)) -> isPLNat(activate(V1))
    20: isLNat(n__natsFrom(V1)) -> isNatural(activate(V1))
    21: isLNat(n__snd(V1)) -> isPLNat(activate(V1))
    22: isLNat(n__tail(V1)) -> isLNat(activate(V1))
    23: isLNat(n__take(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2)))
    24: isNatural(n__0()) -> tt()
    25: isNatural(n__head(V1)) -> isLNat(activate(V1))
    26: isNatural(n__s(V1)) -> isNatural(activate(V1))
    27: isNatural(n__sel(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2)))
    28: isPLNat(n__pair(V1,V2)) -> and(isLNat(activate(V1)),n__isLNat(activate(V2)))
    29: isPLNat(n__splitAt(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2)))
    30: natsFrom(N) -> U41(isNatural(N),N)
    31: sel(N,XS) -> U51(and(isNatural(N),n__isLNat(XS)),N,XS)
    32: snd(pair(X,Y)) -> U61(and(isLNat(X),n__isLNat(Y)),Y)
    33: splitAt(|0|(),XS) -> U71(isLNat(XS),XS)
    34: splitAt(s(N),cons(X,XS)) -> U81(and(isNatural(N),n__and(n__isNatural(X),n__isLNat(activate(XS)))),N,X,activate(XS))
    35: tail(cons(N,XS)) -> U91(and(isNatural(N),n__isLNat(activate(XS))),activate(XS))
    36: take(N,XS) -> U101(and(isNatural(N),n__isLNat(XS)),N,XS)
    37: natsFrom(X) -> n__natsFrom(X)
    38: s(X) -> n__s(X)
    39: isLNat(X) -> n__isLNat(X)
    40: nil() -> n__nil()
    41: afterNth(X1,X2) -> n__afterNth(X1,X2)
    42: cons(X1,X2) -> n__cons(X1,X2)
    43: fst(X) -> n__fst(X)
    44: snd(X) -> n__snd(X)
    45: tail(X) -> n__tail(X)
    46: take(X1,X2) -> n__take(X1,X2)
    47: |0|() -> n__0()
    48: head(X) -> n__head(X)
    49: sel(X1,X2) -> n__sel(X1,X2)
    50: pair(X1,X2) -> n__pair(X1,X2)
    51: splitAt(X1,X2) -> n__splitAt(X1,X2)
    52: and(X1,X2) -> n__and(X1,X2)
    53: isNatural(X) -> n__isNatural(X)
    54: activate(n__natsFrom(X)) -> natsFrom(activate(X))
    55: activate(n__s(X)) -> s(activate(X))
    56: activate(n__isLNat(X)) -> isLNat(X)
    57: activate(n__nil()) -> nil()
    58: activate(n__afterNth(X1,X2)) -> afterNth(activate(X1),activate(X2))
    59: activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
    60: activate(n__fst(X)) -> fst(activate(X))
    61: activate(n__snd(X)) -> snd(activate(X))
    62: activate(n__tail(X)) -> tail(activate(X))
    63: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
    64: activate(n__0()) -> |0|()
    65: activate(n__head(X)) -> head(activate(X))
    66: activate(n__sel(X1,X2)) -> sel(activate(X1),activate(X2))
    67: activate(n__pair(X1,X2)) -> pair(activate(X1),activate(X2))
    68: activate(n__splitAt(X1,X2)) -> splitAt(activate(X1),activate(X2))
    69: activate(n__and(X1,X2)) -> and(activate(X1),X2)
    70: activate(n__isNatural(X)) -> isNatural(X)
    71: activate(X) -> X
Number of strict rules: 71
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #U11(tt(),N,XS) -> #snd(splitAt(activate(N),activate(XS)))
   #2: #U11(tt(),N,XS) -> #splitAt(activate(N),activate(XS))
   #3: #U11(tt(),N,XS) -> #activate(N)
   #4: #U11(tt(),N,XS) -> #activate(XS)
   #5: #isPLNat(n__splitAt(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
   #6: #isPLNat(n__splitAt(V1,V2)) -> #isNatural(activate(V1))
   #7: #isPLNat(n__splitAt(V1,V2)) -> #activate(V1)
   #8: #isPLNat(n__splitAt(V1,V2)) -> #activate(V2)
   #9: #tail(cons(N,XS)) -> #U91(and(isNatural(N),n__isLNat(activate(XS))),activate(XS))
   #10: #tail(cons(N,XS)) -> #and(isNatural(N),n__isLNat(activate(XS)))
   #11: #tail(cons(N,XS)) -> #isNatural(N)
   #12: #tail(cons(N,XS)) -> #activate(XS)
   #13: #tail(cons(N,XS)) -> #activate(XS)
   #14: #activate(n__sel(X1,X2)) -> #sel(activate(X1),activate(X2))
   #15: #activate(n__sel(X1,X2)) -> #activate(X1)
   #16: #activate(n__sel(X1,X2)) -> #activate(X2)
   #17: #activate(n__afterNth(X1,X2)) -> #afterNth(activate(X1),activate(X2))
   #18: #activate(n__afterNth(X1,X2)) -> #activate(X1)
   #19: #activate(n__afterNth(X1,X2)) -> #activate(X2)
   #20: #activate(n__snd(X)) -> #snd(activate(X))
   #21: #activate(n__snd(X)) -> #activate(X)
   #22: #U51(tt(),N,XS) -> #head(afterNth(activate(N),activate(XS)))
   #23: #U51(tt(),N,XS) -> #afterNth(activate(N),activate(XS))
   #24: #U51(tt(),N,XS) -> #activate(N)
   #25: #U51(tt(),N,XS) -> #activate(XS)
   #26: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2)
   #27: #activate(n__cons(X1,X2)) -> #activate(X1)
   #28: #activate(n__s(X)) -> #s(activate(X))
   #29: #activate(n__s(X)) -> #activate(X)
   #30: #activate(n__pair(X1,X2)) -> #pair(activate(X1),activate(X2))
   #31: #activate(n__pair(X1,X2)) -> #activate(X1)
   #32: #activate(n__pair(X1,X2)) -> #activate(X2)
   #33: #and(tt(),X) -> #activate(X)
   #34: #U81(tt(),N,X,XS) -> #U82(splitAt(activate(N),activate(XS)),activate(X))
   #35: #U81(tt(),N,X,XS) -> #splitAt(activate(N),activate(XS))
   #36: #U81(tt(),N,X,XS) -> #activate(N)
   #37: #U81(tt(),N,X,XS) -> #activate(XS)
   #38: #U81(tt(),N,X,XS) -> #activate(X)
   #39: #U91(tt(),XS) -> #activate(XS)
   #40: #activate(n__nil()) -> #nil()
   #41: #activate(n__isNatural(X)) -> #isNatural(X)
   #42: #isLNat(n__take(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
   #43: #isLNat(n__take(V1,V2)) -> #isNatural(activate(V1))
   #44: #isLNat(n__take(V1,V2)) -> #activate(V1)
   #45: #isLNat(n__take(V1,V2)) -> #activate(V2)
   #46: #activate(n__and(X1,X2)) -> #and(activate(X1),X2)
   #47: #activate(n__and(X1,X2)) -> #activate(X1)
   #48: #afterNth(N,XS) -> #U11(and(isNatural(N),n__isLNat(XS)),N,XS)
   #49: #afterNth(N,XS) -> #and(isNatural(N),n__isLNat(XS))
   #50: #afterNth(N,XS) -> #isNatural(N)
   #51: #sel(N,XS) -> #U51(and(isNatural(N),n__isLNat(XS)),N,XS)
   #52: #sel(N,XS) -> #and(isNatural(N),n__isLNat(XS))
   #53: #sel(N,XS) -> #isNatural(N)
   #54: #activate(n__isLNat(X)) -> #isLNat(X)
   #55: #fst(pair(X,Y)) -> #U21(and(isLNat(X),n__isLNat(Y)),X)
   #56: #fst(pair(X,Y)) -> #and(isLNat(X),n__isLNat(Y))
   #57: #fst(pair(X,Y)) -> #isLNat(X)
   #58: #activate(n__tail(X)) -> #tail(activate(X))
   #59: #activate(n__tail(X)) -> #activate(X)
   #60: #natsFrom(N) -> #U41(isNatural(N),N)
   #61: #natsFrom(N) -> #isNatural(N)
   #62: #isNatural(n__head(V1)) -> #isLNat(activate(V1))
   #63: #isNatural(n__head(V1)) -> #activate(V1)
   #64: #isLNat(n__natsFrom(V1)) -> #isNatural(activate(V1))
   #65: #isLNat(n__natsFrom(V1)) -> #activate(V1)
   #66: #U61(tt(),Y) -> #activate(Y)
   #67: #U82(pair(YS,ZS),X) -> #pair(cons(activate(X),YS),ZS)
   #68: #U82(pair(YS,ZS),X) -> #cons(activate(X),YS)
   #69: #U82(pair(YS,ZS),X) -> #activate(X)
   #70: #activate(n__0()) -> #|0|()
   #71: #splitAt(|0|(),XS) -> #U71(isLNat(XS),XS)
   #72: #splitAt(|0|(),XS) -> #isLNat(XS)
   #73: #U41(tt(),N) -> #cons(activate(N),n__natsFrom(n__s(activate(N))))
   #74: #U41(tt(),N) -> #activate(N)
   #75: #U41(tt(),N) -> #activate(N)
   #76: #activate(n__head(X)) -> #head(activate(X))
   #77: #activate(n__head(X)) -> #activate(X)
   #78: #isPLNat(n__pair(V1,V2)) -> #and(isLNat(activate(V1)),n__isLNat(activate(V2)))
   #79: #isPLNat(n__pair(V1,V2)) -> #isLNat(activate(V1))
   #80: #isPLNat(n__pair(V1,V2)) -> #activate(V1)
   #81: #isPLNat(n__pair(V1,V2)) -> #activate(V2)
   #82: #isLNat(n__tail(V1)) -> #isLNat(activate(V1))
   #83: #isLNat(n__tail(V1)) -> #activate(V1)
   #84: #splitAt(s(N),cons(X,XS)) -> #U81(and(isNatural(N),n__and(n__isNatural(X),n__isLNat(activate(XS)))),N,X,activate(XS))
   #85: #splitAt(s(N),cons(X,XS)) -> #and(isNatural(N),n__and(n__isNatural(X),n__isLNat(activate(XS))))
   #86: #splitAt(s(N),cons(X,XS)) -> #isNatural(N)
   #87: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
   #88: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
   #89: #isNatural(n__sel(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
   #90: #isNatural(n__sel(V1,V2)) -> #isNatural(activate(V1))
   #91: #isNatural(n__sel(V1,V2)) -> #activate(V1)
   #92: #isNatural(n__sel(V1,V2)) -> #activate(V2)
   #93: #activate(n__fst(X)) -> #fst(activate(X))
   #94: #activate(n__fst(X)) -> #activate(X)
   #95: #isLNat(n__afterNth(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
   #96: #isLNat(n__afterNth(V1,V2)) -> #isNatural(activate(V1))
   #97: #isLNat(n__afterNth(V1,V2)) -> #activate(V1)
   #98: #isLNat(n__afterNth(V1,V2)) -> #activate(V2)
   #99: #snd(pair(X,Y)) -> #U61(and(isLNat(X),n__isLNat(Y)),Y)
   #100: #snd(pair(X,Y)) -> #and(isLNat(X),n__isLNat(Y))
   #101: #snd(pair(X,Y)) -> #isLNat(X)
   #102: #isLNat(n__fst(V1)) -> #isPLNat(activate(V1))
   #103: #isLNat(n__fst(V1)) -> #activate(V1)
   #104: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2))
   #105: #activate(n__take(X1,X2)) -> #activate(X1)
   #106: #activate(n__take(X1,X2)) -> #activate(X2)
   #107: #isNatural(n__s(V1)) -> #isNatural(activate(V1))
   #108: #isNatural(n__s(V1)) -> #activate(V1)
   #109: #activate(n__splitAt(X1,X2)) -> #splitAt(activate(X1),activate(X2))
   #110: #activate(n__splitAt(X1,X2)) -> #activate(X1)
   #111: #activate(n__splitAt(X1,X2)) -> #activate(X2)
   #112: #take(N,XS) -> #U101(and(isNatural(N),n__isLNat(XS)),N,XS)
   #113: #take(N,XS) -> #and(isNatural(N),n__isLNat(XS))
   #114: #take(N,XS) -> #isNatural(N)
   #115: #isLNat(n__snd(V1)) -> #isPLNat(activate(V1))
   #116: #isLNat(n__snd(V1)) -> #activate(V1)
   #117: #U21(tt(),X) -> #activate(X)
   #118: #U101(tt(),N,XS) -> #fst(splitAt(activate(N),activate(XS)))
   #119: #U101(tt(),N,XS) -> #splitAt(activate(N),activate(XS))
   #120: #U101(tt(),N,XS) -> #activate(N)
   #121: #U101(tt(),N,XS) -> #activate(XS)
   #122: #activate(n__natsFrom(X)) -> #natsFrom(activate(X))
   #123: #activate(n__natsFrom(X)) -> #activate(X)
   #124: #U71(tt(),XS) -> #pair(nil(),activate(XS))
   #125: #U71(tt(),XS) -> #nil()
   #126: #U71(tt(),XS) -> #activate(XS)
   #127: #head(cons(N,XS)) -> #U31(and(isNatural(N),n__isLNat(activate(XS))),N)
   #128: #head(cons(N,XS)) -> #and(isNatural(N),n__isLNat(activate(XS)))
   #129: #head(cons(N,XS)) -> #isNatural(N)
   #130: #head(cons(N,XS)) -> #activate(XS)
   #131: #U31(tt(),N) -> #activate(N)
   #132: #isLNat(n__cons(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
   #133: #isLNat(n__cons(V1,V2)) -> #isNatural(activate(V1))
   #134: #isLNat(n__cons(V1,V2)) -> #activate(V1)
   #135: #isLNat(n__cons(V1,V2)) -> #activate(V2)
Number of SCCs: 1, DPs: 125, edges: 2153
	SCC { #1..25 #27 #29 #31..39 #41..66 #69 #71 #72 #74..123 #126..135 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
   |0|()	weight: (/ 1 8)
   U21(x1,x2)	weight: max{0, (/ 1 8) + x2}
 #|0|()	weight: 0
   U11(x1,x2,x3)	weight: max{0, x3, x2}
#cons(x1,x2)	weight: 0
     s(x1)	weight: x1
n__pair(x1,x2)	weight: max{x2, x1}
#take(x1,x2)	weight: max{(/ 1 8) + x2, (/ 1 4) + x1}
isPLNat(x1)	weight: x1
   U91(x1,x2)	weight: max{0, (/ 1 8) + x2}
#U101(x1,x2,x3)	weight: max{0, (/ 1 8) + x3, (/ 1 4) + x2}
activate(x1)	weight: x1
n__isLNat(x1)	weight: x1
 #U82(x1,x2)	weight: max{0, (/ 1 8) + x2}
  take(x1,x2)	weight: max{(/ 3 8) + x2, (/ 1 4) + x1}
   U71(x1,x2)	weight: max{0, x2}
 #U81(x1,x2,x3,x4)	weight: max{0, (/ 1 8) + x4, (/ 1 8) + x3, (/ 1 8) + x2}
   and(x1,x2)	weight: max{x2, x1}
  U101(x1,x2,x3)	weight: max{0, (/ 3 8) + x3, (/ 1 4) + x2}
  pair(x1,x2)	weight: max{x2, x1}
   fst(x1)	weight: (/ 1 8) + x1
#activate(x1)	weight: (/ 1 8) + x1
natsFrom(x1)	weight: x1
#head(x1)	weight: (/ 1 8) + x1
splitAt(x1,x2)	weight: max{x2, x1}
 #fst(x1)	weight: (/ 1 8) + x1
n__nil()	weight: 0
n__natsFrom(x1)	weight: x1
isNatural(x1)	weight: x1
n__snd(x1)	weight: x1
  n__s(x1)	weight: x1
n__splitAt(x1,x2)	weight: max{x2, x1}
  tail(x1)	weight: (/ 1 8) + x1
n__take(x1,x2)	weight: max{(/ 3 8) + x2, (/ 1 4) + x1}
 #sel(x1,x2)	weight: max{(/ 1 8) + x2, (/ 1 8) + x1}
#isLNat(x1)	weight: (/ 1 8) + x1
   sel(x1,x2)	weight: max{x2, x1}
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: max{x2, x1}
n__cons(x1,x2)	weight: max{x2, x1}
#isPLNat(x1)	weight: (/ 1 8) + x1
   nil()	weight: 0
isLNat(x1)	weight: x1
n__sel(x1,x2)	weight: max{x2, x1}
#tail(x1)	weight: (/ 1 8) + x1
#splitAt(x1,x2)	weight: max{(/ 1 8) + x2, (/ 1 8) + x1}
 #nil()	weight: 0
n__tail(x1)	weight: (/ 1 8) + x1
#afterNth(x1,x2)	weight: max{(/ 1 8) + x2, (/ 1 8) + x1}
n__isNatural(x1)	weight: x1
  n__0()	weight: (/ 1 8)
n__afterNth(x1,x2)	weight: max{x2, x1}
   U61(x1,x2)	weight: max{0, x2}
 #U51(x1,x2,x3)	weight: max{0, (/ 1 8) + x3, (/ 1 8) + x2}
n__fst(x1)	weight: (/ 1 8) + x1
 #U11(x1,x2,x3)	weight: max{0, (/ 1 8) + x3, (/ 1 8) + x2}
   U31(x1,x2)	weight: max{0, x2}
  head(x1)	weight: x1
 #snd(x1)	weight: (/ 1 8) + x1
 #U41(x1,x2)	weight: max{0, (/ 1 8) + x2}
  cons(x1,x2)	weight: max{x2, x1}
#natsFrom(x1)	weight: (/ 1 8) + x1
   snd(x1)	weight: x1
 #U21(x1,x2)	weight: max{0, (/ 1 8) + x2}
   U81(x1,x2,x3,x4)	weight: max{0, x4, x3, x2}
   U82(x1,x2)	weight: max{x2, x1}
    tt()	weight: 0
n__and(x1,x2)	weight: max{x2, x1}
 #U71(x1,x2)	weight: max{0, (/ 1 8) + x2}
#isNatural(x1)	weight: (/ 1 8) + x1
#pair(x1,x2)	weight: 0
n__head(x1)	weight: x1
   U51(x1,x2,x3)	weight: max{0, x3, x2}
   U41(x1,x2)	weight: max{0, x2}
 #U31(x1,x2)	weight: max{0, (/ 1 8) + x2}
 #and(x1,x2)	weight: max{0, (/ 1 8) + x2}
 #U91(x1,x2)	weight: max{0, (/ 1 8) + x2}
 #U61(x1,x2)	weight: max{0, (/ 1 8) + x2}
    Usable rules: { 1..71 }
    Removed DPs: #42..45 #58 #59 #82 #83 #93 #94 #102..106 #114 #120
Number of SCCs: 1, DPs: 93, edges: 1275
	SCC { #1..8 #14..25 #27 #29 #31..38 #41 #46..54 #60..66 #69 #71 #72 #74..81 #84..92 #95..101 #107..111 #115 #116 #122 #123 #126..135 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
   |0|()	weight: (/ 1 4)
   U21(x1,x2)	weight: max{0, (/ 1 8) + x2}
 #|0|()	weight: 0
   U11(x1,x2,x3)	weight: max{0, (/ 340471 4) + x3, 57742 + x2}
#cons(x1,x2)	weight: 0
     s(x1)	weight: x1
n__pair(x1,x2)	weight: max{(/ 109503 4) + x2, x1}
#take(x1,x2)	weight: 0
isPLNat(x1)	weight: (/ 230967 8) + x1
   U91(x1,x2)	weight: max{0, x2}
#U101(x1,x2,x3)	weight: 0
activate(x1)	weight: x1
n__isLNat(x1)	weight: (/ 115483 4) + x1
 #U82(x1,x2)	weight: max{(/ 219007 8) + x2, (/ 1 8) + x1}
  take(x1,x2)	weight: max{(/ 449975 8) + x2, 56247 + x1}
   U71(x1,x2)	weight: max{(/ 230971 8) + x2, 27376 + x1}
 #U81(x1,x2,x3,x4)	weight: max{83622 + x4, (/ 115485 4) + x3, (/ 449973 8) + x2, (/ 219005 4) + x1}
   and(x1,x2)	weight: max{x2, (/ 1 8) + x1}
  U101(x1,x2,x3)	weight: max{0, (/ 449975 8) + x3, 56247 + x2}
  pair(x1,x2)	weight: max{(/ 109503 4) + x2, x1}
   fst(x1)	weight: (/ 1 8) + x1
#activate(x1)	weight: (/ 109503 4) + x1
natsFrom(x1)	weight: (/ 219007 8) + x1
#head(x1)	weight: (/ 449973 8) + x1
splitAt(x1,x2)	weight: max{(/ 224987 4) + x2, 28871 + x1}
 #fst(x1)	weight: (/ 1 8)
n__nil()	weight: (/ 57743 2)
n__natsFrom(x1)	weight: (/ 219007 8) + x1
isNatural(x1)	weight: (/ 5981 4) + x1
n__snd(x1)	weight: 28871 + x1
  n__s(x1)	weight: x1
n__splitAt(x1,x2)	weight: max{(/ 224987 4) + x2, 28871 + x1}
  tail(x1)	weight: x1
n__take(x1,x2)	weight: max{(/ 449975 8) + x2, 56247 + x1}
 #sel(x1,x2)	weight: max{(/ 674961 4) + x2, 141365 + x1}
#isLNat(x1)	weight: (/ 112493 2) + x1
   sel(x1,x2)	weight: max{(/ 565459 4) + x2, (/ 1130917 8) + x1}
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: max{85118 + x2, (/ 680945 8) + x1}
n__cons(x1,x2)	weight: max{x2, (/ 219007 8) + x1}
#isPLNat(x1)	weight: (/ 449973 8) + x1
   nil()	weight: (/ 57743 2)
isLNat(x1)	weight: (/ 115483 4) + x1
n__sel(x1,x2)	weight: max{(/ 565459 4) + x2, (/ 1130917 8) + x1}
#tail(x1)	weight: (/ 1 8)
#splitAt(x1,x2)	weight: max{83622 + x2, (/ 449973 8) + x1}
 #nil()	weight: 0
n__tail(x1)	weight: x1
#afterNth(x1,x2)	weight: max{(/ 899949 8) + x2, (/ 899947 8) + x1}
n__isNatural(x1)	weight: (/ 5981 4) + x1
  n__0()	weight: (/ 1 4)
n__afterNth(x1,x2)	weight: max{85118 + x2, (/ 680945 8) + x1}
   U61(x1,x2)	weight: max{0, x2}
 #U51(x1,x2,x3)	weight: max{141365 + x3, (/ 1130919 8) + x2, (/ 1118955 8) + x1}
n__fst(x1)	weight: (/ 1 8) + x1
 #U11(x1,x2,x3)	weight: max{0, (/ 224987 2) + x3, (/ 340471 4) + x2}
   U31(x1,x2)	weight: max{0, x2}
  head(x1)	weight: 28871 + x1
 #snd(x1)	weight: (/ 449973 8) + x1
 #U41(x1,x2)	weight: max{0, (/ 219007 8) + x2}
  cons(x1,x2)	weight: max{x2, (/ 219007 8) + x1}
#natsFrom(x1)	weight: (/ 109503 2) + x1
   snd(x1)	weight: 28871 + x1
 #U21(x1,x2)	weight: 0
   U81(x1,x2,x3,x4)	weight: max{(/ 224987 4) + x4, (/ 449975 8) + x3, 28871 + x2, (/ 219005 8) + x1}
   U82(x1,x2)	weight: max{(/ 449975 8) + x2, x1}
    tt()	weight: (/ 2991 2)
n__and(x1,x2)	weight: max{x2, (/ 1 8) + x1}
 #U71(x1,x2)	weight: max{(/ 219007 8) + x2, 27376 + x1}
#isNatural(x1)	weight: (/ 230967 8) + x1
#pair(x1,x2)	weight: 0
n__head(x1)	weight: 28871 + x1
   U51(x1,x2,x3)	weight: max{113989 + x3, (/ 911913 8) + x2, (/ 899949 8) + x1}
   U41(x1,x2)	weight: max{(/ 219007 8) + x2, x1}
 #U31(x1,x2)	weight: max{(/ 224987 4) + x2, (/ 207041 8) + x1}
 #and(x1,x2)	weight: max{0, (/ 109503 4) + x2}
 #U91(x1,x2)	weight: 0
 #U61(x1,x2)	weight: max{0, (/ 109503 4) + x2}
    Usable rules: { 1..71 }
    Removed DPs: #1..8 #14..25 #27 #32 #34 #36..38 #41 #47..53 #60..65 #69 #71 #72 #74..81 #85..92 #95..101 #108..111 #115 #116 #122 #123 #126..131 #133..135
Number of SCCs: 3, DPs: 9, edges: 18
	SCC { #107 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded.
   |0|()	weight: 29177	status: []	precedence above: n__0
   U21(x1,x2)	weight: max{0, 29177 + x2}	status: [x2]	precedence above:
 #|0|()	weight: 0	status: []	precedence above:
   U11(x1,x2,x3)	weight: max{0, 58354 + x3, 29177 + x2}	status: []	precedence above: n__pair U71 pair splitAt n__snd n__splitAt n__cons U31 cons snd U81 U82
#cons(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
     s(x1)	weight: x1	status: [x1]	precedence above: n__s
n__pair(x1,x2)	weight: max{(/ 116707 4) + x2, (/ 19451 2) + x1}	status: []	precedence above: pair
#take(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
isPLNat(x1)	weight: 19451	status: []	precedence above: U21 U11 n__pair n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
   U91(x1,x2)	weight: max{0, (/ 19451 2) + x2}	status: [x2]	precedence above: n__cons U31 cons
#U101(x1,x2,x3)	weight: (/ 1 4) + x3 + x2 + x1	status: [x1,x3,x2]	precedence above:
activate(x1)	weight: x1	status: x1
n__isLNat(x1)	weight: 19451	status: []	precedence above: U21 U11 n__pair isPLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
 #U82(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
  take(x1,x2)	weight: (/ 233419 4) + x2 + x1	status: []	precedence above: U21 U101 fst n__take n__fst
   U71(x1,x2)	weight: max{0, (/ 116707 4) + x2}	status: [x2]	precedence above: n__pair pair
 #U81(x1,x2,x3,x4)	weight: max{(/ 1 4) + x4, (/ 1 4) + x3, (/ 1 4) + x2, (/ 1 4) + x1}	status: [x3,x2,x4,x1]	precedence above:
   and(x1,x2)	weight: max{0, x2}	status: x2
  U101(x1,x2,x3)	weight: max{0, (/ 116709 2) + x3, (/ 116709 4) + x2}	status: []	precedence above: U21 fst n__fst
  pair(x1,x2)	weight: max{(/ 116707 4) + x2, (/ 19451 2) + x1}	status: []	precedence above: n__pair
   fst(x1)	weight: (/ 116709 4) + x1	status: []	precedence above: U21 n__fst
#activate(x1)	weight: (/ 1 4)	status: []	precedence above:
natsFrom(x1)	weight: (/ 77805 4) + x1	status: []	precedence above: s n__natsFrom n__s n__cons U31 cons U41
#head(x1)	weight: x1	status: []	precedence above:
splitAt(x1,x2)	weight: max{29177 + x2, x1}	status: [x1]	precedence above: U11 n__pair U71 pair n__snd n__splitAt n__cons U31 cons snd U81 U82
 #fst(x1)	weight: x1	status: []	precedence above:
n__nil()	weight: (/ 77805 4)	status: []	precedence above: nil tt
n__natsFrom(x1)	weight: (/ 77805 4) + x1	status: []	precedence above: s natsFrom n__s n__cons U31 cons U41
isNatural(x1)	weight: 19451	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
n__snd(x1)	weight: 29177 + x1	status: [x1]	precedence above: snd
  n__s(x1)	weight: x1	status: [x1]	precedence above: s
n__splitAt(x1,x2)	weight: max{29177 + x2, x1}	status: [x1]	precedence above: U11 n__pair U71 pair splitAt n__snd n__cons U31 cons snd U81 U82
  tail(x1)	weight: (/ 19451 2) + x1	status: []	precedence above: U91 n__cons n__tail U31 cons
n__take(x1,x2)	weight: (/ 233419 4) + x2 + x1	status: []	precedence above: U21 take U101 fst n__fst
 #sel(x1,x2)	weight: (/ 1 4) + x1	status: [x1]	precedence above:
#isLNat(x1)	weight: x1	status: []	precedence above:
   sel(x1,x2)	weight: 58355 + x2 + x1	status: [x2]	precedence above: n__sel U31 head n__head U51
   #s(x1)	weight: x1	status: []	precedence above:
afterNth(x1,x2)	weight: max{(/ 116709 2) + x2, (/ 233417 4) + x1}	status: [x1]	precedence above: n__afterNth U31 head n__head U51
n__cons(x1,x2)	weight: max{x2, (/ 38903 4) + x1}	status: [x1]	precedence above: U31 cons
#isPLNat(x1)	weight: (/ 1 4)	status: []	precedence above:
   nil()	weight: (/ 77805 4)	status: []	precedence above: n__nil tt
isLNat(x1)	weight: 19451	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
n__sel(x1,x2)	weight: 58355 + x2 + x1	status: [x2]	precedence above: sel U31 head n__head U51
#tail(x1)	weight: (/ 1 4)	status: []	precedence above:
#splitAt(x1,x2)	weight: max{(/ 1 4) + x2, (/ 1 4) + x1}	status: [x1,x2]	precedence above:
 #nil()	weight: 0	status: []	precedence above:
n__tail(x1)	weight: (/ 19451 2) + x1	status: []	precedence above: U91 tail n__cons U31 cons
#afterNth(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x2,x1]	precedence above:
n__isNatural(x1)	weight: 19451	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
  n__0()	weight: 29177	status: []	precedence above: |0|
n__afterNth(x1,x2)	weight: max{(/ 116709 2) + x2, (/ 233417 4) + x1}	status: [x1]	precedence above: afterNth U31 head n__head U51
   U61(x1,x2)	weight: max{0, (/ 58353 2) + x2}	status: [x2]	precedence above: n__pair pair
 #U51(x1,x2,x3)	weight: (/ 1 4) + x3 + x2 + x1	status: [x2,x3,x1]	precedence above:
n__fst(x1)	weight: (/ 116709 4) + x1	status: []	precedence above: U21 fst
 #U11(x1,x2,x3)	weight: (/ 1 4) + x3 + x2	status: [x3,x2]	precedence above:
   U31(x1,x2)	weight: max{0, (/ 38903 4) + x2}	status: [x2]	precedence above:
  head(x1)	weight: x1	status: [x1]	precedence above: U31 n__head
 #snd(x1)	weight: x1	status: []	precedence above:
 #U41(x1,x2)	weight: x1	status: []	precedence above:
  cons(x1,x2)	weight: max{x2, (/ 38903 4) + x1}	status: [x1]	precedence above: n__cons U31
#natsFrom(x1)	weight: x1	status: []	precedence above:
   snd(x1)	weight: 29177 + x1	status: [x1]	precedence above: n__snd
 #U21(x1,x2)	weight: x1	status: [x1]	precedence above:
   U81(x1,x2,x3,x4)	weight: max{29177 + x4, (/ 77805 4) + x3, x2, (/ 38905 4) + x1}	status: []	precedence above: n__pair pair n__cons U31 cons U82
   U82(x1,x2)	weight: max{(/ 77805 4) + x2, x1}	status: [x2]	precedence above: n__pair pair n__cons U31 cons
    tt()	weight: 19451	status: []	precedence above:
n__and(x1,x2)	weight: max{0, x2}	status: x2
 #U71(x1,x2)	weight: (/ 1 4) + x1	status: [x1]	precedence above:
#isNatural(x1)	weight: x1	status: [x1]	precedence above:
#pair(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
n__head(x1)	weight: x1	status: [x1]	precedence above: U31 head
   U51(x1,x2,x3)	weight: max{0, (/ 233419 4) + x3, (/ 233419 4) + x2}	status: []	precedence above: U31 head n__head
   U41(x1,x2)	weight: max{(/ 77805 4) + x2, (/ 1 4) + x1}	status: [x2]	precedence above: s n__s n__cons U31 cons
 #U31(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
 #and(x1,x2)	weight: max{(/ 1 4) + x2, (/ 1 4) + x1}	status: [x1,x2]	precedence above:
 #U91(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
 #U61(x1,x2)	weight: (/ 1 4) + x2 + x1	status: [x1,x2]	precedence above:
    Usable rules: { 1..71 }
    Removed DPs: #107
Number of SCCs: 2, DPs: 8, edges: 17
	SCC { #35 #84 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded.
   |0|()	weight: (/ 58351 2)	status: []	precedence above: n__0
   U21(x1,x2)	weight: max{0, (/ 58351 2) + x2}	status: [x2]	precedence above:
 #|0|()	weight: 0	status: []	precedence above:
   U11(x1,x2,x3)	weight: max{0, 63243 + x3, (/ 63243 2) + x2}	status: []	precedence above: n__pair U71 pair splitAt n__snd n__splitAt n__cons U31 cons snd U81 U82
#cons(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
     s(x1)	weight: x1	status: [x1]	precedence above: #U81 n__s n__cons #splitAt U31 cons
n__pair(x1,x2)	weight: max{(/ 466807 16) + x2, (/ 1 8) + x1}	status: []	precedence above: pair
#take(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
isPLNat(x1)	weight: (/ 1 4)	status: []	precedence above: U21 U11 n__pair n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
   U91(x1,x2)	weight: max{0, (/ 1 8) + x2}	status: [x2]	precedence above: n__cons U31 cons
#U101(x1,x2,x3)	weight: (/ 1 16) + x3 + x2 + x1	status: [x1,x3,x2]	precedence above:
activate(x1)	weight: x1	status: x1
n__isLNat(x1)	weight: (/ 1 4)	status: []	precedence above: U21 U11 n__pair isPLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
 #U82(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
  take(x1,x2)	weight: (/ 1011891 16) + x2 + x1	status: []	precedence above: U21 U101 fst n__take n__fst
   U71(x1,x2)	weight: max{0, (/ 466807 16) + x2}	status: [x2]	precedence above: n__pair pair
 #U81(x1,x2,x3,x4)	weight: max{(/ 3 8) + x4, x3, (/ 7 16) + x2, (/ 1 4) + x1}	status: [x2,x3]	precedence above: n__cons #splitAt U31 cons
   and(x1,x2)	weight: max{0, x2}	status: x2
  U101(x1,x2,x3)	weight: max{0, (/ 505945 8) + x3, (/ 505945 16) + x2}	status: []	precedence above: U21 fst n__fst
  pair(x1,x2)	weight: max{(/ 466807 16) + x2, (/ 1 8) + x1}	status: []	precedence above: n__pair
   fst(x1)	weight: (/ 505945 16) + x1	status: []	precedence above: U21 n__fst
#activate(x1)	weight: (/ 1 16)	status: []	precedence above:
natsFrom(x1)	weight: (/ 5 16) + x1	status: []	precedence above: s #U81 n__natsFrom n__s n__cons #splitAt U31 cons U41
#head(x1)	weight: x1	status: []	precedence above:
splitAt(x1,x2)	weight: max{(/ 63243 2) + x2, x1}	status: [x1]	precedence above: U11 n__pair U71 pair n__snd n__splitAt n__cons U31 cons snd U81 U82
 #fst(x1)	weight: x1	status: []	precedence above:
n__nil()	weight: (/ 466805 16)	status: []	precedence above: nil tt
n__natsFrom(x1)	weight: (/ 5 16) + x1	status: []	precedence above: s #U81 natsFrom n__s n__cons #splitAt U31 cons U41
isNatural(x1)	weight: (/ 1 4)	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt n__snd n__splitAt n__take afterNth n__cons isLNat n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
n__snd(x1)	weight: (/ 63243 2) + x1	status: [x1]	precedence above: snd
  n__s(x1)	weight: x1	status: [x1]	precedence above: s #U81 n__cons #splitAt U31 cons
n__splitAt(x1,x2)	weight: max{(/ 63243 2) + x2, x1}	status: [x1]	precedence above: U11 n__pair U71 pair splitAt n__snd n__cons U31 cons snd U81 U82
  tail(x1)	weight: (/ 1 8) + x1	status: []	precedence above: U91 n__cons n__tail U31 cons
n__take(x1,x2)	weight: (/ 1011891 16) + x2 + x1	status: []	precedence above: U21 take U101 fst n__fst
 #sel(x1,x2)	weight: (/ 1 16) + x1	status: [x1]	precedence above:
#isLNat(x1)	weight: x1	status: []	precedence above:
   sel(x1,x2)	weight: (/ 252973 4) + x2 + x1	status: [x2]	precedence above: n__sel U31 head n__head U51
   #s(x1)	weight: x1	status: []	precedence above:
afterNth(x1,x2)	weight: max{(/ 505945 8) + x2, (/ 1011889 16) + x1}	status: [x1]	precedence above: n__afterNth U31 head n__head U51
n__cons(x1,x2)	weight: max{x2, (/ 3 16) + x1}	status: [x1]	precedence above: U31 cons
#isPLNat(x1)	weight: (/ 1 16)	status: []	precedence above:
   nil()	weight: (/ 466805 16)	status: []	precedence above: n__nil tt
isLNat(x1)	weight: (/ 1 4)	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons n__isNatural n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
n__sel(x1,x2)	weight: (/ 252973 4) + x2 + x1	status: [x2]	precedence above: sel U31 head n__head U51
#tail(x1)	weight: (/ 1 16)	status: []	precedence above:
#splitAt(x1,x2)	weight: max{(/ 3 8) + x2, (/ 7 16) + x1}	status: [x1]	precedence above: #U81 n__cons U31 cons
 #nil()	weight: 0	status: []	precedence above:
n__tail(x1)	weight: (/ 1 8) + x1	status: []	precedence above: U91 tail n__cons U31 cons
#afterNth(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x2,x1]	precedence above:
n__isNatural(x1)	weight: (/ 1 4)	status: []	precedence above: U21 U11 n__pair isPLNat n__isLNat take U71 U101 pair fst splitAt isNatural n__snd n__splitAt n__take afterNth n__cons isLNat n__afterNth n__fst U31 head cons snd U81 U82 tt n__head U51
  n__0()	weight: (/ 58351 2)	status: []	precedence above: |0|
n__afterNth(x1,x2)	weight: max{(/ 505945 8) + x2, (/ 1011889 16) + x1}	status: [x1]	precedence above: afterNth U31 head n__head U51
   U61(x1,x2)	weight: max{0, (/ 3 16) + x2}	status: [x2]	precedence above: n__pair pair
 #U51(x1,x2,x3)	weight: (/ 1 16) + x3 + x2 + x1	status: [x2,x3,x1]	precedence above:
n__fst(x1)	weight: (/ 505945 16) + x1	status: []	precedence above: U21 fst
 #U11(x1,x2,x3)	weight: (/ 1 16) + x3 + x2	status: [x3,x2]	precedence above:
   U31(x1,x2)	weight: max{0, (/ 3 16) + x2}	status: [x2]	precedence above:
  head(x1)	weight: x1	status: [x1]	precedence above: U31 n__head
 #snd(x1)	weight: x1	status: []	precedence above:
 #U41(x1,x2)	weight: x1	status: []	precedence above:
  cons(x1,x2)	weight: max{x2, (/ 3 16) + x1}	status: [x1]	precedence above: n__cons U31
#natsFrom(x1)	weight: x1	status: []	precedence above:
   snd(x1)	weight: (/ 63243 2) + x1	status: [x1]	precedence above: n__snd
 #U21(x1,x2)	weight: x1	status: [x1]	precedence above:
   U81(x1,x2,x3,x4)	weight: max{(/ 63243 2) + x4, (/ 5 16) + x3, x2, (/ 505941 16) + x1}	status: []	precedence above: n__pair pair n__cons U31 cons U82
   U82(x1,x2)	weight: max{(/ 5 16) + x2, x1}	status: [x2]	precedence above: n__pair pair n__cons U31 cons
    tt()	weight: (/ 1 4)	status: []	precedence above:
n__and(x1,x2)	weight: max{0, x2}	status: x2
 #U71(x1,x2)	weight: (/ 1 16) + x1	status: [x1]	precedence above:
#isNatural(x1)	weight: x1	status: [x1]	precedence above:
#pair(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
n__head(x1)	weight: x1	status: [x1]	precedence above: U31 head
   U51(x1,x2,x3)	weight: max{0, (/ 1011891 16) + x3, (/ 1011891 16) + x2}	status: []	precedence above: U31 head n__head
   U41(x1,x2)	weight: max{(/ 5 16) + x2, (/ 1 16) + x1}	status: [x2]	precedence above: s #U81 n__s n__cons #splitAt U31 cons
 #U31(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
 #and(x1,x2)	weight: max{(/ 1 16) + x2, (/ 1 16) + x1}	status: [x1,x2]	precedence above:
 #U91(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
 #U61(x1,x2)	weight: (/ 1 16) + x2 + x1	status: [x1,x2]	precedence above:
    Usable rules: { 1..71 }
    Removed DPs: #35 #84
Number of SCCs: 1, DPs: 6, edges: 15
	SCC { #29 #31 #33 #46 #54 #132 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   |0|()	weight: 0
   U21(x1,x2)	weight: (/ 1 4)
 #|0|()	weight: 0
   U11(x1,x2,x3)	weight: x1
#cons(x1,x2)	weight: 0
     s(x1)	weight: (/ 3 8)
n__pair(x1,x2)	weight: (/ 9 16) + x1
#take(x1,x2)	weight: 0
isPLNat(x1)	weight: (/ 1 2)
   U91(x1,x2)	weight: (/ 1 8) + x2
#U101(x1,x2,x3)	weight: 0
activate(x1)	weight: (/ 5 16)
n__isLNat(x1)	weight: (/ 1 2)
 #U82(x1,x2)	weight: (/ 1 16)
  take(x1,x2)	weight: (/ 1 16) + x1
   U71(x1,x2)	weight: (/ 7 16)
 #U81(x1,x2,x3,x4)	weight: (/ 1 16)
   and(x1,x2)	weight: (/ 9 16)
  U101(x1,x2,x3)	weight: (/ 1 8) + x2
  pair(x1,x2)	weight: (/ 1 2)
   fst(x1)	weight: (/ 3 16)
#activate(x1)	weight: x1
natsFrom(x1)	weight: (/ 3 8)
#head(x1)	weight: 0
splitAt(x1,x2)	weight: (/ 3 8)
 #fst(x1)	weight: 0
n__nil()	weight: 0
n__natsFrom(x1)	weight: (/ 7 16)
isNatural(x1)	weight: (/ 3 8)
n__snd(x1)	weight: (/ 7 16) + x1
  n__s(x1)	weight: (/ 7 16) + x1
n__splitAt(x1,x2)	weight: x1
  tail(x1)	weight: (/ 3 8)
n__take(x1,x2)	weight: (/ 1 8) + x2
 #sel(x1,x2)	weight: 0
#isLNat(x1)	weight: (/ 1 2)
   sel(x1,x2)	weight: x1 + x2
   #s(x1)	weight: 0
afterNth(x1,x2)	weight: (/ 1 2) + x1
n__cons(x1,x2)	weight: (/ 9 16) + x1
#isPLNat(x1)	weight: 0
   nil()	weight: 0
isLNat(x1)	weight: (/ 7 16)
n__sel(x1,x2)	weight: (/ 1 16) + x1
#tail(x1)	weight: 0
#splitAt(x1,x2)	weight: 0
 #nil()	weight: 0
n__tail(x1)	weight: (/ 7 16) + x1
#afterNth(x1,x2)	weight: 0
n__isNatural(x1)	weight: (/ 7 16)
  n__0()	weight: 0
n__afterNth(x1,x2)	weight: (/ 9 16)
   U61(x1,x2)	weight: (/ 7 16)
 #U51(x1,x2,x3)	weight: 0
n__fst(x1)	weight: (/ 1 4) + x1
 #U11(x1,x2,x3)	weight: 0
   U31(x1,x2)	weight: (/ 1 4)
  head(x1)	weight: (/ 3 8)
 #snd(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: (/ 1 2)
#natsFrom(x1)	weight: 0
   snd(x1)	weight: (/ 3 8)
 #U21(x1,x2)	weight: 0
   U81(x1,x2,x3,x4)	weight: x1 + x4
   U82(x1,x2)	weight: (/ 1 16)
    tt()	weight: 0
n__and(x1,x2)	weight: (/ 5 8) + x2
 #U71(x1,x2)	weight: 0
#isNatural(x1)	weight: 0
#pair(x1,x2)	weight: 0
n__head(x1)	weight: (/ 7 16) + x1
   U51(x1,x2,x3)	weight: (/ 5 16) + x1 + x2 + x3
   U41(x1,x2)	weight: (/ 7 16) + x2
 #U31(x1,x2)	weight: 0
 #and(x1,x2)	weight: x2
 #U91(x1,x2)	weight: (/ 1 16)
 #U61(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #29 #31 #46
Number of SCCs: 1, DPs: 3, edges: 3
	SCC { #33 #54 #132 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE