MAYBE
Input TRS:
      1: U101(tt(),V1,V2) -> U102(isNatural(activate(V1)),activate(V2))
      2: U102(tt(),V2) -> U103(isLNat(activate(V2)))
      3: U103(tt()) -> tt()
      4: U11(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS)))
      5: U111(tt(),V1) -> U112(isLNat(activate(V1)))
      6: U112(tt()) -> tt()
      7: U121(tt(),V1) -> U122(isNatural(activate(V1)))
      8: U122(tt()) -> tt()
      9: U131(tt(),V1,V2) -> U132(isNatural(activate(V1)),activate(V2))
      10: U132(tt(),V2) -> U133(isLNat(activate(V2)))
      11: U133(tt()) -> tt()
      12: U141(tt(),V1,V2) -> U142(isLNat(activate(V1)),activate(V2))
      13: U142(tt(),V2) -> U143(isLNat(activate(V2)))
      14: U143(tt()) -> tt()
      15: U151(tt(),V1,V2) -> U152(isNatural(activate(V1)),activate(V2))
      16: U152(tt(),V2) -> U153(isLNat(activate(V2)))
      17: U153(tt()) -> tt()
      18: U161(tt(),N) -> cons(activate(N),n__natsFrom(s(activate(N))))
      19: U171(tt(),N,XS) -> head(afterNth(activate(N),activate(XS)))
      20: U181(tt(),Y) -> activate(Y)
      21: U191(tt(),XS) -> pair(nil(),activate(XS))
      22: U201(tt(),N,X,XS) -> U202(splitAt(activate(N),activate(XS)),activate(X))
      23: U202(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS)
      24: U21(tt(),X) -> activate(X)
      25: U211(tt(),XS) -> activate(XS)
      26: U221(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS)))
      27: U31(tt(),N) -> activate(N)
      28: U41(tt(),V1,V2) -> U42(isNatural(activate(V1)),activate(V2))
      29: U42(tt(),V2) -> U43(isLNat(activate(V2)))
      30: U43(tt()) -> tt()
      31: U51(tt(),V1,V2) -> U52(isNatural(activate(V1)),activate(V2))
      32: U52(tt(),V2) -> U53(isLNat(activate(V2)))
      33: U53(tt()) -> tt()
      34: U61(tt(),V1) -> U62(isPLNat(activate(V1)))
      35: U62(tt()) -> tt()
      36: U71(tt(),V1) -> U72(isNatural(activate(V1)))
      37: U72(tt()) -> tt()
      38: U81(tt(),V1) -> U82(isPLNat(activate(V1)))
      39: U82(tt()) -> tt()
      40: U91(tt(),V1) -> U92(isLNat(activate(V1)))
      41: U92(tt()) -> tt()
      42: afterNth(N,XS) -> U11(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
      43: and(tt(),X) -> activate(X)
      44: fst(pair(X,Y)) -> U21(and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y))),X)
      45: head(cons(N,XS)) -> U31(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS)))),N)
      46: isLNat(n__nil()) -> tt()
      47: isLNat(n__afterNth(V1,V2)) -> U41(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      48: isLNat(n__cons(V1,V2)) -> U51(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      49: isLNat(n__fst(V1)) -> U61(isPLNatKind(activate(V1)),activate(V1))
      50: isLNat(n__natsFrom(V1)) -> U71(isNaturalKind(activate(V1)),activate(V1))
      51: isLNat(n__snd(V1)) -> U81(isPLNatKind(activate(V1)),activate(V1))
      52: isLNat(n__tail(V1)) -> U91(isLNatKind(activate(V1)),activate(V1))
      53: isLNat(n__take(V1,V2)) -> U101(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      54: isLNatKind(n__nil()) -> tt()
      55: isLNatKind(n__afterNth(V1,V2)) -> and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
      56: isLNatKind(n__cons(V1,V2)) -> and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
      57: isLNatKind(n__fst(V1)) -> isPLNatKind(activate(V1))
      58: isLNatKind(n__natsFrom(V1)) -> isNaturalKind(activate(V1))
      59: isLNatKind(n__snd(V1)) -> isPLNatKind(activate(V1))
      60: isLNatKind(n__tail(V1)) -> isLNatKind(activate(V1))
      61: isLNatKind(n__take(V1,V2)) -> and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
      62: isNatural(n__0()) -> tt()
      63: isNatural(n__head(V1)) -> U111(isLNatKind(activate(V1)),activate(V1))
      64: isNatural(n__s(V1)) -> U121(isNaturalKind(activate(V1)),activate(V1))
      65: isNatural(n__sel(V1,V2)) -> U131(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      66: isNaturalKind(n__0()) -> tt()
      67: isNaturalKind(n__head(V1)) -> isLNatKind(activate(V1))
      68: isNaturalKind(n__s(V1)) -> isNaturalKind(activate(V1))
      69: isNaturalKind(n__sel(V1,V2)) -> and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
      70: isPLNat(n__pair(V1,V2)) -> U141(and(isLNatKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      71: isPLNat(n__splitAt(V1,V2)) -> U151(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
      72: isPLNatKind(n__pair(V1,V2)) -> and(isLNatKind(activate(V1)),n__isLNatKind(activate(V2)))
      73: isPLNatKind(n__splitAt(V1,V2)) -> and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
      74: natsFrom(N) -> U161(and(isNatural(N),n__isNaturalKind(N)),N)
      75: sel(N,XS) -> U171(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
      76: snd(pair(X,Y)) -> U181(and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y))),Y)
      77: splitAt(0(),XS) -> U191(and(isLNat(XS),n__isLNatKind(XS)),XS)
      78: splitAt(s(N),cons(X,XS)) -> U201(and(and(isNatural(N),n__isNaturalKind(N)),n__and(and(isNatural(X),n__isNaturalKind(X)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS))))),N,X,activate(XS))
      79: tail(cons(N,XS)) -> U211(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS)))),activate(XS))
      80: take(N,XS) -> U221(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
      81: natsFrom(X) -> n__natsFrom(X)
      82: isNaturalKind(X) -> n__isNaturalKind(X)
      83: and(X1,X2) -> n__and(X1,X2)
      84: isLNatKind(X) -> n__isLNatKind(X)
      85: nil() -> n__nil()
      86: afterNth(X1,X2) -> n__afterNth(X1,X2)
      87: cons(X1,X2) -> n__cons(X1,X2)
      88: fst(X) -> n__fst(X)
      89: snd(X) -> n__snd(X)
      90: tail(X) -> n__tail(X)
      91: take(X1,X2) -> n__take(X1,X2)
      92: 0() -> n__0()
      93: head(X) -> n__head(X)
      94: s(X) -> n__s(X)
      95: sel(X1,X2) -> n__sel(X1,X2)
      96: pair(X1,X2) -> n__pair(X1,X2)
      97: splitAt(X1,X2) -> n__splitAt(X1,X2)
      98: activate(n__natsFrom(X)) -> natsFrom(X)
      99: activate(n__isNaturalKind(X)) -> isNaturalKind(X)
      100: activate(n__and(X1,X2)) -> and(X1,X2)
      101: activate(n__isLNatKind(X)) -> isLNatKind(X)
      102: activate(n__nil()) -> nil()
      103: activate(n__afterNth(X1,X2)) -> afterNth(X1,X2)
      104: activate(n__cons(X1,X2)) -> cons(X1,X2)
      105: activate(n__fst(X)) -> fst(X)
      106: activate(n__snd(X)) -> snd(X)
      107: activate(n__tail(X)) -> tail(X)
      108: activate(n__take(X1,X2)) -> take(X1,X2)
      109: activate(n__0()) -> 0()
      110: activate(n__head(X)) -> head(X)
      111: activate(n__s(X)) -> s(X)
      112: activate(n__sel(X1,X2)) -> sel(X1,X2)
      113: activate(n__pair(X1,X2)) -> pair(X1,X2)
      114: activate(n__splitAt(X1,X2)) -> splitAt(X1,X2)
      115: activate(X) -> X
Number of strict rules: 115
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #U102(tt(),V2) -> #U103(isLNat(activate(V2)))
     #2: #U102(tt(),V2) -> #isLNat(activate(V2))
     #3: #U102(tt(),V2) -> #activate(V2)
     #4: #and(tt(),X) -> #activate(X)
     #5: #U42(tt(),V2) -> #U43(isLNat(activate(V2)))
     #6: #U42(tt(),V2) -> #isLNat(activate(V2))
     #7: #U42(tt(),V2) -> #activate(V2)
     #8: #afterNth(N,XS) -> #U11(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
     #9: #afterNth(N,XS) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS)))
     #10: #afterNth(N,XS) -> #and(isNatural(N),n__isNaturalKind(N))
     #11: #afterNth(N,XS) -> #isNatural(N)
     #12: #afterNth(N,XS) -> #isLNat(XS)
     #13: #activate(n__splitAt(X1,X2)) -> #splitAt(X1,X2)
     #14: #activate(n__isNaturalKind(X)) -> #isNaturalKind(X)
     #15: #isPLNatKind(n__splitAt(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #16: #isPLNatKind(n__splitAt(V1,V2)) -> #isNaturalKind(activate(V1))
     #17: #isPLNatKind(n__splitAt(V1,V2)) -> #activate(V1)
     #18: #isPLNatKind(n__splitAt(V1,V2)) -> #activate(V2)
     #19: #isLNat(n__afterNth(V1,V2)) -> #U41(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #20: #isLNat(n__afterNth(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #21: #isLNat(n__afterNth(V1,V2)) -> #isNaturalKind(activate(V1))
     #22: #isLNat(n__afterNth(V1,V2)) -> #activate(V1)
     #23: #isLNat(n__afterNth(V1,V2)) -> #activate(V2)
     #24: #isLNat(n__afterNth(V1,V2)) -> #activate(V1)
     #25: #isLNat(n__afterNth(V1,V2)) -> #activate(V2)
     #26: #isLNat(n__take(V1,V2)) -> #U101(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #27: #isLNat(n__take(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #28: #isLNat(n__take(V1,V2)) -> #isNaturalKind(activate(V1))
     #29: #isLNat(n__take(V1,V2)) -> #activate(V1)
     #30: #isLNat(n__take(V1,V2)) -> #activate(V2)
     #31: #isLNat(n__take(V1,V2)) -> #activate(V1)
     #32: #isLNat(n__take(V1,V2)) -> #activate(V2)
     #33: #isPLNat(n__splitAt(V1,V2)) -> #U151(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #34: #isPLNat(n__splitAt(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #35: #isPLNat(n__splitAt(V1,V2)) -> #isNaturalKind(activate(V1))
     #36: #isPLNat(n__splitAt(V1,V2)) -> #activate(V1)
     #37: #isPLNat(n__splitAt(V1,V2)) -> #activate(V2)
     #38: #isPLNat(n__splitAt(V1,V2)) -> #activate(V1)
     #39: #isPLNat(n__splitAt(V1,V2)) -> #activate(V2)
     #40: #isLNat(n__cons(V1,V2)) -> #U51(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #41: #isLNat(n__cons(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #42: #isLNat(n__cons(V1,V2)) -> #isNaturalKind(activate(V1))
     #43: #isLNat(n__cons(V1,V2)) -> #activate(V1)
     #44: #isLNat(n__cons(V1,V2)) -> #activate(V2)
     #45: #isLNat(n__cons(V1,V2)) -> #activate(V1)
     #46: #isLNat(n__cons(V1,V2)) -> #activate(V2)
     #47: #sel(N,XS) -> #U171(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
     #48: #sel(N,XS) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS)))
     #49: #sel(N,XS) -> #and(isNatural(N),n__isNaturalKind(N))
     #50: #sel(N,XS) -> #isNatural(N)
     #51: #sel(N,XS) -> #isLNat(XS)
     #52: #activate(n__sel(X1,X2)) -> #sel(X1,X2)
     #53: #natsFrom(N) -> #U161(and(isNatural(N),n__isNaturalKind(N)),N)
     #54: #natsFrom(N) -> #and(isNatural(N),n__isNaturalKind(N))
     #55: #natsFrom(N) -> #isNatural(N)
     #56: #isLNatKind(n__natsFrom(V1)) -> #isNaturalKind(activate(V1))
     #57: #isLNatKind(n__natsFrom(V1)) -> #activate(V1)
     #58: #activate(n__pair(X1,X2)) -> #pair(X1,X2)
     #59: #isLNatKind(n__take(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #60: #isLNatKind(n__take(V1,V2)) -> #isNaturalKind(activate(V1))
     #61: #isLNatKind(n__take(V1,V2)) -> #activate(V1)
     #62: #isLNatKind(n__take(V1,V2)) -> #activate(V2)
     #63: #U81(tt(),V1) -> #U82(isPLNat(activate(V1)))
     #64: #U81(tt(),V1) -> #isPLNat(activate(V1))
     #65: #U81(tt(),V1) -> #activate(V1)
     #66: #isLNatKind(n__snd(V1)) -> #isPLNatKind(activate(V1))
     #67: #isLNatKind(n__snd(V1)) -> #activate(V1)
     #68: #activate(n__head(X)) -> #head(X)
     #69: #isLNatKind(n__afterNth(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #70: #isLNatKind(n__afterNth(V1,V2)) -> #isNaturalKind(activate(V1))
     #71: #isLNatKind(n__afterNth(V1,V2)) -> #activate(V1)
     #72: #isLNatKind(n__afterNth(V1,V2)) -> #activate(V2)
     #73: #isNaturalKind(n__head(V1)) -> #isLNatKind(activate(V1))
     #74: #isNaturalKind(n__head(V1)) -> #activate(V1)
     #75: #U91(tt(),V1) -> #U92(isLNat(activate(V1)))
     #76: #U91(tt(),V1) -> #isLNat(activate(V1))
     #77: #U91(tt(),V1) -> #activate(V1)
     #78: #activate(n__tail(X)) -> #tail(X)
     #79: #isLNat(n__snd(V1)) -> #U81(isPLNatKind(activate(V1)),activate(V1))
     #80: #isLNat(n__snd(V1)) -> #isPLNatKind(activate(V1))
     #81: #isLNat(n__snd(V1)) -> #activate(V1)
     #82: #isLNat(n__snd(V1)) -> #activate(V1)
     #83: #U142(tt(),V2) -> #U143(isLNat(activate(V2)))
     #84: #U142(tt(),V2) -> #isLNat(activate(V2))
     #85: #U142(tt(),V2) -> #activate(V2)
     #86: #U131(tt(),V1,V2) -> #U132(isNatural(activate(V1)),activate(V2))
     #87: #U131(tt(),V1,V2) -> #isNatural(activate(V1))
     #88: #U131(tt(),V1,V2) -> #activate(V1)
     #89: #U131(tt(),V1,V2) -> #activate(V2)
     #90: #activate(n__natsFrom(X)) -> #natsFrom(X)
     #91: #isLNatKind(n__fst(V1)) -> #isPLNatKind(activate(V1))
     #92: #isLNatKind(n__fst(V1)) -> #activate(V1)
     #93: #snd(pair(X,Y)) -> #U181(and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y))),Y)
     #94: #snd(pair(X,Y)) -> #and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y)))
     #95: #snd(pair(X,Y)) -> #and(isLNat(X),n__isLNatKind(X))
     #96: #snd(pair(X,Y)) -> #isLNat(X)
     #97: #snd(pair(X,Y)) -> #isLNat(Y)
     #98: #activate(n__0()) -> #0()
     #99: #U21(tt(),X) -> #activate(X)
     #100: #isPLNat(n__pair(V1,V2)) -> #U141(and(isLNatKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #101: #isPLNat(n__pair(V1,V2)) -> #and(isLNatKind(activate(V1)),n__isLNatKind(activate(V2)))
     #102: #isPLNat(n__pair(V1,V2)) -> #isLNatKind(activate(V1))
     #103: #isPLNat(n__pair(V1,V2)) -> #activate(V1)
     #104: #isPLNat(n__pair(V1,V2)) -> #activate(V2)
     #105: #isPLNat(n__pair(V1,V2)) -> #activate(V1)
     #106: #isPLNat(n__pair(V1,V2)) -> #activate(V2)
     #107: #U202(pair(YS,ZS),X) -> #pair(cons(activate(X),YS),ZS)
     #108: #U202(pair(YS,ZS),X) -> #cons(activate(X),YS)
     #109: #U202(pair(YS,ZS),X) -> #activate(X)
     #110: #splitAt(s(N),cons(X,XS)) -> #U201(and(and(isNatural(N),n__isNaturalKind(N)),n__and(and(isNatural(X),n__isNaturalKind(X)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS))))),N,X,activate(XS))
     #111: #splitAt(s(N),cons(X,XS)) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(and(isNatural(X),n__isNaturalKind(X)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS)))))
     #112: #splitAt(s(N),cons(X,XS)) -> #and(isNatural(N),n__isNaturalKind(N))
     #113: #splitAt(s(N),cons(X,XS)) -> #isNatural(N)
     #114: #splitAt(s(N),cons(X,XS)) -> #and(isNatural(X),n__isNaturalKind(X))
     #115: #splitAt(s(N),cons(X,XS)) -> #isNatural(X)
     #116: #splitAt(s(N),cons(X,XS)) -> #isLNat(activate(XS))
     #117: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
     #118: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
     #119: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
     #120: #head(cons(N,XS)) -> #U31(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS)))),N)
     #121: #head(cons(N,XS)) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS))))
     #122: #head(cons(N,XS)) -> #and(isNatural(N),n__isNaturalKind(N))
     #123: #head(cons(N,XS)) -> #isNatural(N)
     #124: #head(cons(N,XS)) -> #isLNat(activate(XS))
     #125: #head(cons(N,XS)) -> #activate(XS)
     #126: #head(cons(N,XS)) -> #activate(XS)
     #127: #isNaturalKind(n__sel(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #128: #isNaturalKind(n__sel(V1,V2)) -> #isNaturalKind(activate(V1))
     #129: #isNaturalKind(n__sel(V1,V2)) -> #activate(V1)
     #130: #isNaturalKind(n__sel(V1,V2)) -> #activate(V2)
     #131: #activate(n__isLNatKind(X)) -> #isLNatKind(X)
     #132: #U141(tt(),V1,V2) -> #U142(isLNat(activate(V1)),activate(V2))
     #133: #U141(tt(),V1,V2) -> #isLNat(activate(V1))
     #134: #U141(tt(),V1,V2) -> #activate(V1)
     #135: #U141(tt(),V1,V2) -> #activate(V2)
     #136: #U51(tt(),V1,V2) -> #U52(isNatural(activate(V1)),activate(V2))
     #137: #U51(tt(),V1,V2) -> #isNatural(activate(V1))
     #138: #U51(tt(),V1,V2) -> #activate(V1)
     #139: #U51(tt(),V1,V2) -> #activate(V2)
     #140: #tail(cons(N,XS)) -> #U211(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS)))),activate(XS))
     #141: #tail(cons(N,XS)) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(activate(XS)),n__isLNatKind(activate(XS))))
     #142: #tail(cons(N,XS)) -> #and(isNatural(N),n__isNaturalKind(N))
     #143: #tail(cons(N,XS)) -> #isNatural(N)
     #144: #tail(cons(N,XS)) -> #isLNat(activate(XS))
     #145: #tail(cons(N,XS)) -> #activate(XS)
     #146: #tail(cons(N,XS)) -> #activate(XS)
     #147: #tail(cons(N,XS)) -> #activate(XS)
     #148: #isLNatKind(n__cons(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #149: #isLNatKind(n__cons(V1,V2)) -> #isNaturalKind(activate(V1))
     #150: #isLNatKind(n__cons(V1,V2)) -> #activate(V1)
     #151: #isLNatKind(n__cons(V1,V2)) -> #activate(V2)
     #152: #activate(n__s(X)) -> #s(X)
     #153: #activate(n__snd(X)) -> #snd(X)
     #154: #isLNat(n__tail(V1)) -> #U91(isLNatKind(activate(V1)),activate(V1))
     #155: #isLNat(n__tail(V1)) -> #isLNatKind(activate(V1))
     #156: #isLNat(n__tail(V1)) -> #activate(V1)
     #157: #isLNat(n__tail(V1)) -> #activate(V1)
     #158: #isLNat(n__fst(V1)) -> #U61(isPLNatKind(activate(V1)),activate(V1))
     #159: #isLNat(n__fst(V1)) -> #isPLNatKind(activate(V1))
     #160: #isLNat(n__fst(V1)) -> #activate(V1)
     #161: #isLNat(n__fst(V1)) -> #activate(V1)
     #162: #U211(tt(),XS) -> #activate(XS)
     #163: #activate(n__take(X1,X2)) -> #take(X1,X2)
     #164: #U181(tt(),Y) -> #activate(Y)
     #165: #U121(tt(),V1) -> #U122(isNatural(activate(V1)))
     #166: #U121(tt(),V1) -> #isNatural(activate(V1))
     #167: #U121(tt(),V1) -> #activate(V1)
     #168: #U132(tt(),V2) -> #U133(isLNat(activate(V2)))
     #169: #U132(tt(),V2) -> #isLNat(activate(V2))
     #170: #U132(tt(),V2) -> #activate(V2)
     #171: #isNatural(n__s(V1)) -> #U121(isNaturalKind(activate(V1)),activate(V1))
     #172: #isNatural(n__s(V1)) -> #isNaturalKind(activate(V1))
     #173: #isNatural(n__s(V1)) -> #activate(V1)
     #174: #isNatural(n__s(V1)) -> #activate(V1)
     #175: #isPLNatKind(n__pair(V1,V2)) -> #and(isLNatKind(activate(V1)),n__isLNatKind(activate(V2)))
     #176: #isPLNatKind(n__pair(V1,V2)) -> #isLNatKind(activate(V1))
     #177: #isPLNatKind(n__pair(V1,V2)) -> #activate(V1)
     #178: #isPLNatKind(n__pair(V1,V2)) -> #activate(V2)
     #179: #U111(tt(),V1) -> #U112(isLNat(activate(V1)))
     #180: #U111(tt(),V1) -> #isLNat(activate(V1))
     #181: #U111(tt(),V1) -> #activate(V1)
     #182: #fst(pair(X,Y)) -> #U21(and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y))),X)
     #183: #fst(pair(X,Y)) -> #and(and(isLNat(X),n__isLNatKind(X)),n__and(isLNat(Y),n__isLNatKind(Y)))
     #184: #fst(pair(X,Y)) -> #and(isLNat(X),n__isLNatKind(X))
     #185: #fst(pair(X,Y)) -> #isLNat(X)
     #186: #fst(pair(X,Y)) -> #isLNat(Y)
     #187: #isNatural(n__sel(V1,V2)) -> #U131(and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2))),activate(V1),activate(V2))
     #188: #isNatural(n__sel(V1,V2)) -> #and(isNaturalKind(activate(V1)),n__isLNatKind(activate(V2)))
     #189: #isNatural(n__sel(V1,V2)) -> #isNaturalKind(activate(V1))
     #190: #isNatural(n__sel(V1,V2)) -> #activate(V1)
     #191: #isNatural(n__sel(V1,V2)) -> #activate(V2)
     #192: #isNatural(n__sel(V1,V2)) -> #activate(V1)
     #193: #isNatural(n__sel(V1,V2)) -> #activate(V2)
     #194: #U41(tt(),V1,V2) -> #U42(isNatural(activate(V1)),activate(V2))
     #195: #U41(tt(),V1,V2) -> #isNatural(activate(V1))
     #196: #U41(tt(),V1,V2) -> #activate(V1)
     #197: #U41(tt(),V1,V2) -> #activate(V2)
     #198: #U201(tt(),N,X,XS) -> #U202(splitAt(activate(N),activate(XS)),activate(X))
     #199: #U201(tt(),N,X,XS) -> #splitAt(activate(N),activate(XS))
     #200: #U201(tt(),N,X,XS) -> #activate(N)
     #201: #U201(tt(),N,X,XS) -> #activate(XS)
     #202: #U201(tt(),N,X,XS) -> #activate(X)
     #203: #U61(tt(),V1) -> #U62(isPLNat(activate(V1)))
     #204: #U61(tt(),V1) -> #isPLNat(activate(V1))
     #205: #U61(tt(),V1) -> #activate(V1)
     #206: #U31(tt(),N) -> #activate(N)
     #207: #isLNatKind(n__tail(V1)) -> #isLNatKind(activate(V1))
     #208: #isLNatKind(n__tail(V1)) -> #activate(V1)
     #209: #U52(tt(),V2) -> #U53(isLNat(activate(V2)))
     #210: #U52(tt(),V2) -> #isLNat(activate(V2))
     #211: #U52(tt(),V2) -> #activate(V2)
     #212: #U171(tt(),N,XS) -> #head(afterNth(activate(N),activate(XS)))
     #213: #U171(tt(),N,XS) -> #afterNth(activate(N),activate(XS))
     #214: #U171(tt(),N,XS) -> #activate(N)
     #215: #U171(tt(),N,XS) -> #activate(XS)
     #216: #isNatural(n__head(V1)) -> #U111(isLNatKind(activate(V1)),activate(V1))
     #217: #isNatural(n__head(V1)) -> #isLNatKind(activate(V1))
     #218: #isNatural(n__head(V1)) -> #activate(V1)
     #219: #isNatural(n__head(V1)) -> #activate(V1)
     #220: #activate(n__fst(X)) -> #fst(X)
     #221: #U221(tt(),N,XS) -> #fst(splitAt(activate(N),activate(XS)))
     #222: #U221(tt(),N,XS) -> #splitAt(activate(N),activate(XS))
     #223: #U221(tt(),N,XS) -> #activate(N)
     #224: #U221(tt(),N,XS) -> #activate(XS)
     #225: #activate(n__and(X1,X2)) -> #and(X1,X2)
     #226: #isNaturalKind(n__s(V1)) -> #isNaturalKind(activate(V1))
     #227: #isNaturalKind(n__s(V1)) -> #activate(V1)
     #228: #U71(tt(),V1) -> #U72(isNatural(activate(V1)))
     #229: #U71(tt(),V1) -> #isNatural(activate(V1))
     #230: #U71(tt(),V1) -> #activate(V1)
     #231: #U191(tt(),XS) -> #pair(nil(),activate(XS))
     #232: #U191(tt(),XS) -> #nil()
     #233: #U191(tt(),XS) -> #activate(XS)
     #234: #U152(tt(),V2) -> #U153(isLNat(activate(V2)))
     #235: #U152(tt(),V2) -> #isLNat(activate(V2))
     #236: #U152(tt(),V2) -> #activate(V2)
     #237: #splitAt(0(),XS) -> #U191(and(isLNat(XS),n__isLNatKind(XS)),XS)
     #238: #splitAt(0(),XS) -> #and(isLNat(XS),n__isLNatKind(XS))
     #239: #splitAt(0(),XS) -> #isLNat(XS)
     #240: #U101(tt(),V1,V2) -> #U102(isNatural(activate(V1)),activate(V2))
     #241: #U101(tt(),V1,V2) -> #isNatural(activate(V1))
     #242: #U101(tt(),V1,V2) -> #activate(V1)
     #243: #U101(tt(),V1,V2) -> #activate(V2)
     #244: #U151(tt(),V1,V2) -> #U152(isNatural(activate(V1)),activate(V2))
     #245: #U151(tt(),V1,V2) -> #isNatural(activate(V1))
     #246: #U151(tt(),V1,V2) -> #activate(V1)
     #247: #U151(tt(),V1,V2) -> #activate(V2)
     #248: #activate(n__nil()) -> #nil()
     #249: #activate(n__afterNth(X1,X2)) -> #afterNth(X1,X2)
     #250: #U11(tt(),N,XS) -> #snd(splitAt(activate(N),activate(XS)))
     #251: #U11(tt(),N,XS) -> #splitAt(activate(N),activate(XS))
     #252: #U11(tt(),N,XS) -> #activate(N)
     #253: #U11(tt(),N,XS) -> #activate(XS)
     #254: #activate(n__cons(X1,X2)) -> #cons(X1,X2)
     #255: #take(N,XS) -> #U221(and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS))),N,XS)
     #256: #take(N,XS) -> #and(and(isNatural(N),n__isNaturalKind(N)),n__and(isLNat(XS),n__isLNatKind(XS)))
     #257: #take(N,XS) -> #and(isNatural(N),n__isNaturalKind(N))
     #258: #take(N,XS) -> #isNatural(N)
     #259: #take(N,XS) -> #isLNat(XS)
     #260: #isLNat(n__natsFrom(V1)) -> #U71(isNaturalKind(activate(V1)),activate(V1))
     #261: #isLNat(n__natsFrom(V1)) -> #isNaturalKind(activate(V1))
     #262: #isLNat(n__natsFrom(V1)) -> #activate(V1)
     #263: #isLNat(n__natsFrom(V1)) -> #activate(V1)
     #264: #U161(tt(),N) -> #cons(activate(N),n__natsFrom(s(activate(N))))
     #265: #U161(tt(),N) -> #activate(N)
     #266: #U161(tt(),N) -> #s(activate(N))
     #267: #U161(tt(),N) -> #activate(N)
Number of SCCs: 1, DPs: 244
  SCC { #2..4 #6..57 #59..62 #64..74 #76..82 #84..97 #99..106 #109..151 #153..164 #166 #167 #169..178 #180..202 #204..208 #210..227 #229 #230 #233 #235..247 #249..253 #255..263 #265 #267 }
POLO(Sum)... POLO(max)... succeeded.
      #U201	w: max(x2 + 18, x3 + 17, x4 + 5)
      #isLNatKind	w: x1 + 2
      #0 	w: 0
      #U72	w: 0
      U21	w: max(x1 + 14, x2)
      U161	w: max(x1 + 15538, x2 + 15553)
      n__isLNatKind	w: x1 + 2
      U11	w: max(x2 + 34, x3 + 35)
      #cons	w: 0
      s 	w: x1
      n__pair	w: max(x1, x2 + 1)
      U143	w: 0
      #U142	w: max(x1, x2 + 8)
      #take	w: max(x1 + 26, x2 + 13)
      isPLNatKind	w: x1 + 7
      U142	w: 0
      #U152	w: max(x2 + 10)
      #U181	w: max(x2)
      isPLNat	w: 0
      U42	w: max(x2 + 29)
      U91	w: max(x1, x2 + 16)
      U221	w: max(x2 + 24585, x3 + 27)
      #U101	w: max(x2 + 19, x3 + 23)
      activate	w: x1
      #U82	w: 0
      take	w: max(x1 + 24585, x2 + 27)
      U71	w: max(x1, x2 + 28)
      #U81	w: max(x1 + 4, x2 + 18)
      and	w: max(x2)
      #U92	w: 0
      #U133	w: 0
      U131	w: max(x1 + 89, x2 + 109, x3 + 110)
      U101	w: max(x1, x3 + 42)
      pair	w: max(x1, x2 + 1)
      fst	w: x1 + 15
      U111	w: max(x1 + 18559, x2 + 18575)
      U132	w: max(x1 + 111, x2 + 110)
      U43	w: x1
      #activate	w: x1
      U152	w: max(x2 + 24861)
      U103	w: x1
      #U53	w: 0
      natsFrom	w: x1 + 15553
      #head	w: x1 + 15
      #U43	w: 0
      #U121	w: max(x1 + 6, x2 + 14)
      splitAt	w: max(x1 + 19, x2 + 6)
      isNaturalKind	w: x1 + 6
      #U131	w: max(x1 + 51, x2 + 80, x3 + 35)
      U72	w: 15
      n__isNaturalKind	w: x1 + 6
      #fst	w: x1 + 5
      #U143	w: 0
      n__nil	w: 14
      #U52	w: max(x2 + 4)
      #U103	w: 0
      #isPLNatKind	w: x1 + 3
      #U202	w: max(x2 + 17)
      n__natsFrom	w: x1 + 15553
      isNatural	w: x1
      n__snd	w: x1 + 15
      U201	w: max(x1 + 1, x2 + 19, x3 + 17, x4 + 6)
      n__s	w: x1
      n__splitAt	w: max(x1 + 19, x2 + 6)
      #U42	w: max(x2 + 12)
      #U141	w: max(x2 + 16, x3 + 9)
      U141	w: max(x2 + 1, x3 + 15877)
      #U171	w: max(x1 + 65, x2 + 69, x3 + 67)
      tail	w: x1 + 20538
      #U62	w: 0
      0 	w: 14
      U191	w: max(x1, x2 + 3)
      n__take	w: max(x1 + 24585, x2 + 27)
      #sel	w: max(x1 + 70, x2 + 68)
      #U102	w: max(x2 + 18)
      U153	w: x1
      U171	w: max(x1 + 72, x2 + 71, x3 + 88)
      #isLNat	w: x1 + 4
      U202	w: max(x1, x2 + 17)
      sel	w: max(x1 + 71, x2 + 88)
      #s 	w: 0
      afterNth	w: max(x1 + 34, x2 + 51)
      n__cons	w: max(x1 + 12, x2)
      #U211	w: max(x2 + 11314)
      #isPLNat	w: x1 + 17
      nil	w: 14
      isLNat	w: x1 + 15
      U62	w: 30
      #U153	w: 0
      n__sel	w: max(x1 + 71, x2 + 88)
      #tail	w: x1 + 20537
      #isNaturalKind	w: x1 + 1
      #splitAt	w: max(x1 + 18, x2 + 5)
      U151	w: max(x2 + 1, x3 + 1)
      #nil	w: 0
      U133	w: 127
      n__tail	w: x1 + 20538
      #afterNth	w: max(x1 + 26, x2 + 28)
      #U111	w: max(x2 + 7)
      #U221	w: max(x1 + 10, x2 + 25, x3 + 12)
      n__0	w: 14
      n__afterNth	w: max(x1 + 34, x2 + 51)
      U211	w: max(x2)
      isLNatKind	w: x1 + 2
      U52	w: max(x2 + 15)
      U61	w: max(x1 + 7, x2 + 30)
      #U51	w: max(x1 + 1, x2 + 15, x3 + 4)
      n__fst	w: x1 + 15
      #U11	w: max(x1 + 10, x2 + 25, x3 + 27)
      U31	w: max(x1 + 11, x2 + 38)
      U92	w: 16
      head	w: x1 + 37
      U112	w: 18575
      #snd	w: x1 + 5
      #U41	w: max(x1 + 30, x2 + 30, x3 + 30)
      cons	w: max(x1 + 12, x2)
      #natsFrom	w: x1 + 15
      U102	w: max(x2 + 15)
      snd	w: x1 + 15
      #U191	w: max(x2 + 4)
      #U21	w: max(x2 + 3)
      U81	w: max(x1 + 5, x2 + 26)
      U82	w: 21
      #U112	w: 0
      tt	w: 15
      n__and	w: max(x2)
      #U71	w: max(x2 + 6616)
      #U151	w: max(x1 + 20, x2 + 21, x3 + 15)
      #isNatural	w: x1 + 14
      #pair	w: 0
      n__head	w: x1 + 37
      U51	w: max(x1 + 2, x3 + 15)
      #U161	w: max(x2 + 13)
      #U122	w: 0
      U53	w: 15
      U41	w: max(x3 + 51)
      #U31	w: max(x2 + 6)
      #and	w: max(x2)
      #U91	w: max(x2 + 11419)
      #U132	w: max(x2 + 12)
      U121	w: max(x1 + 1, x2 + 1)
      #U61	w: max(x1 + 3, x2 + 18)
      U181	w: max(x1 + 14, x2 + 16)
      U122	w: 17
    USABLE RULES: { 1..4 18..61 66..69 72..115 }
    Removed DPs: #2 #3 #6..39 #41..57 #59..62 #64..74 #76..82 #84..97 #99..106 #109 #111..130 #132..135 #137..147 #149..151 #153..163 #167 #169 #170 #172..178 #180..197 #200..202 #204..208 #211..224 #227 #229 #230 #233 #235..247 #249..253 #255..263 #265 #267
Number of SCCs: 5, DPs: 12
  SCC { #226 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      #U201	s: [3,2,1]	p: 0	w: max(x1 + 1, x2 + 1, x3 + 1)
      #isLNatKind	s: []	p: 0	w: 1
      #0 	s: []	p: 0	w: 0
      #U72	s: []	p: 0	w: 1
      U21	s: [2]	p: 7	w: max(x2 + 8)
      U161	s: []	p: 12	w: max(x2 + 13)
      n__isLNatKind	s: []	p: 6	w: x1 + 6
      U11	s: []	p: 0	w: max(x1 + 1, x2 + 1, x3 + 9)
      #cons	s: []	p: 0	w: max(x2 + 1)
      s 	s: [1]	p: 4	w: x1
      n__pair	s: []	p: 6	w: max(x1 + 5, x2 + 7)
      U143	s: 1
      #U142	s: []	p: 0	w: 1
      #take	s: [2,1]	p: 0	w: x1 + x2 + 1
      isPLNatKind	s: []	p: 6	w: x1 + 5
      U142	s: []	p: 9	w: max(x1 + 1, x2 + 30)
      #U152	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U181	s: []	p: 0	w: x2 + 1
      isPLNat	s: []	p: 5	w: 0
      U42	s: []	p: 9	w: max(x1 + 15, x2 + 48)
      U91	s: [1,2]	p: 3	w: max(x1 + 15363, x2 + 10788)
      U221	s: [3]	p: 10	w: max(x2 + 26, x3 + 20)
      #U101	s: [3,1]	p: 0	w: x1 + x2 + x3 + 1
      activate	s: 1
      #U82	s: []	p: 0	w: 1
      take	s: []	p: 11	w: x1 + x2 + 28
      U71	s: []	p: 3	w: max(x1 + 14304)
      #U81	s: [1]	p: 0	w: x1 + 1
      and	s: 2
      #U92	s: []	p: 0	w: 1
      #U133	s: []	p: 0	w: 1
      U131	s: [1]	p: 1	w: max(x1 + 3864, x2 + 3864)
      U101	s: [3,2]	p: 10	w: max(x1 + 51, x2 + 56, x3 + 21150)
      pair	s: []	p: 6	w: max(x1 + 5, x2 + 7)
      fst	s: []	p: 8	w: x1 + 4
      U111	s: [1,2]	p: 4	w: max(x1 + 2, x2 + 5)
      U132	s: []	p: 2	w: max(x2)
      U43	s: []	p: 8	w: 47
      #activate	s: []	p: 0	w: 1
      U152	s: []	p: 0	w: 0
      U103	s: []	p: 9	w: 31
      #U53	s: []	p: 0	w: 1
      natsFrom	s: []	p: 13	w: x1 + 13
      #head	s: []	p: 0	w: 1
      #U43	s: []	p: 0	w: 1
      #U121	s: []	p: 0	w: max(x1 + 1)
      splitAt	s: []	p: 8	w: max(x2 + 8)
      isNaturalKind	s: 1
      #U131	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      U72	s: []	p: 3	w: 31
      n__isNaturalKind	s: 1
      #fst	s: []	p: 0	w: 1
      #U143	s: []	p: 0	w: 1
      n__nil	s: []	p: 2	w: 25
      #U52	s: [1]	p: 0	w: max(x1 + 1)
      #U103	s: 1
      #isPLNatKind	s: []	p: 0	w: 1
      #U202	s: []	p: 0	w: 0
      n__natsFrom	s: []	p: 13	w: x1 + 13
      isNatural	s: []	p: 10	w: x1 + 12
      n__snd	s: []	p: 0	w: x1
      U201	s: []	p: 8	w: max(x1, x3 + 20, x4 + 8)
      n__s	s: [1]	p: 4	w: x1
      n__splitAt	s: []	p: 8	w: max(x2 + 8)
      #U42	s: [1,2]	p: 0	w: x1 + x2 + 1
      #U141	s: [3,1,2]	p: 0	w: x1 + x2 + x3 + 1
      U141	s: []	p: 9	w: max(x1 + 10121, x2 + 29)
      #U171	s: [3]	p: 0	w: x3 + 1
      tail	s: [1]	p: 10	w: x1 + 13
      #U62	s: []	p: 0	w: 1
      0 	s: []	p: 9	w: 32
      U191	s: [2]	p: 6	w: max(x1 + 2, x2 + 8)
      n__take	s: []	p: 11	w: x1 + x2 + 28
      #sel	s: []	p: 0	w: x2 + 1
      #U102	s: [1]	p: 0	w: x1 + 1
      U153	s: []	p: 3	w: 31
      U171	s: [3]	p: 5	w: max(x1 + 1, x2 + 2258, x3 + 1504)
      #isLNat	s: []	p: 0	w: 1
      U202	s: []	p: 7	w: max(x1, x2 + 19)
      sel	s: [2]	p: 6	w: x1 + x2 + 3851
      #s 	s: []	p: 0	w: 1
      afterNth	s: []	p: 8	w: max(x1 + 11, x2 + 10)
      n__cons	s: [1]	p: 11	w: max(x1 + 13, x2)
      #U211	s: []	p: 0	w: x1
      #isPLNat	s: []	p: 0	w: 1
      nil	s: []	p: 2	w: 25
      isLNat	s: [1]	p: 1	w: x1 + 27
      U62	s: []	p: 3	w: x1 + 55
      #U153	s: 1
      n__sel	s: [2]	p: 6	w: x1 + x2 + 3851
      #tail	s: []	p: 0	w: 1
      #isNaturalKind	s: [1]	p: 0	w: x1 + 1
      #splitAt	s: []	p: 0	w: 0
      U151	s: [2]	p: 9	w: max(x2)
      #nil	s: []	p: 0	w: 0
      U133	s: []	p: 3	w: 31
      n__tail	s: [1]	p: 10	w: x1 + 13
      #afterNth	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U111	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U221	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      n__0	s: []	p: 9	w: 32
      n__afterNth	s: []	p: 8	w: max(x1 + 11, x2 + 10)
      U211	s: [2]	p: 9	w: max(x2 + 6)
      isLNatKind	s: []	p: 6	w: x1 + 6
      U52	s: [1]	p: 2	w: max(x1 + 6)
      U61	s: [2]	p: 3	w: max(x1 + 23, x2 + 7)
      #U51	s: [2]	p: 0	w: max(x2 + 1, x3 + 1)
      n__fst	s: []	p: 8	w: x1 + 4
      #U11	s: []	p: 0	w: x2 + 1
      U31	s: [2]	p: 7	w: max(x2 + 5)
      U92	s: []	p: 3	w: 0
      head	s: []	p: 11	w: x1 + 13
      U112	s: []	p: 3	w: 32
      #snd	s: []	p: 0	w: 1
      #U41	s: [3]	p: 0	w: x2 + x3 + 1
      cons	s: [1]	p: 11	w: max(x1 + 13, x2)
      #natsFrom	s: 1
      U102	s: [2]	p: 9	w: max(x2 + 41)
      snd	s: []	p: 0	w: x1
      #U191	s: []	p: 0	w: x2 + 1
      #U21	s: [2]	p: 0	w: x2 + 1
      U81	s: [1]	p: 4	w: max(x1 + 16782, x2 + 50)
      U82	s: []	p: 4	w: 49
      #U112	s: []	p: 0	w: 1
      tt	s: []	p: 3	w: 31
      n__and	s: 2
      #U71	s: [1,2]	p: 0	w: x1 + x2 + 1
      #U151	s: [1,2,3]	p: 0	w: x1 + x2 + x3 + 1
      #isNatural	s: []	p: 0	w: 1
      #pair	s: [2,1]	p: 0	w: max(x1 + 1, x2 + 1)
      n__head	s: []	p: 11	w: x1 + 13
      U51	s: [2]	p: 1	w: max(x2 + 17, x3 + 12)
      #U161	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U122	s: []	p: 0	w: 1
      U53	s: 1
      U41	s: []	p: 1	w: 0
      #U31	s: [1,2]	p: 0	w: x1 + x2 + 1
      #and	s: []	p: 0	w: max(x2 + 1)
      #U91	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U132	s: [2]	p: 0	w: x2 + 1
      U121	s: []	p: 10	w: max(x2 + 12)
      #U61	s: [2,1]	p: 0	w: x1 + x2 + 1
      U181	s: []	p: 0	w: max(x2 + 6)
      U122	s: []	p: 11	w: x1 + 20
    USABLE RULES: { 3..6 8 11 14 17..27 33 35..39 42..45 54..61 63 66..69 72..115 }
    Removed DPs: #226
Number of SCCs: 4, DPs: 11
  SCC { #166 #171 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      #U201	s: [3,2,1]	p: 0	w: max(x1 + 1, x2 + 1, x3 + 1)
      #isLNatKind	s: []	p: 0	w: 1
      #0 	s: []	p: 0	w: 0
      #U72	s: []	p: 0	w: 1
      U21	s: []	p: 12	w: max(x2 + 13)
      U161	s: [2]	p: 8	w: max(x2)
      n__isLNatKind	s: []	p: 8	w: x1 + 11
      U11	s: []	p: 9	w: max(x1, x3 + 26)
      #cons	s: []	p: 0	w: max(x2 + 1)
      s 	s: [1]	p: 13	w: x1
      n__pair	s: []	p: 2	w: max(x1 + 12, x2 + 11)
      U143	s: []	p: 13	w: 0
      #U142	s: []	p: 0	w: 1
      #take	s: [2,1]	p: 0	w: x1 + x2 + 1
      isPLNatKind	s: []	p: 8	w: x1 + 12
      U142	s: []	p: 12	w: max(x2 + 4)
      #U152	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U181	s: []	p: 0	w: x2 + 1
      isPLNat	s: []	p: 5	w: 0
      U42	s: []	p: 12	w: max(x2 + 2284)
      U91	s: [1,2]	p: 9	w: max(x1, x2 + 1)
      U221	s: [3,2,1]	p: 14	w: max(x1 + 6, x2 + 32, x3 + 32)
      #U101	s: [3,1]	p: 0	w: x1 + x2 + x3 + 1
      activate	s: 1
      #U82	s: []	p: 0	w: 1
      take	s: [2]	p: 15	w: x1 + x2 + 33
      U71	s: [2]	p: 10	w: max(x1 + 1, x2 + 1)
      #U81	s: [1]	p: 0	w: x1 + 1
      and	s: 2
      #U92	s: []	p: 0	w: 1
      #U133	s: []	p: 0	w: 1
      U131	s: [2]	p: 0	w: max(x1 + 113, x2 + 113)
      U101	s: []	p: 15	w: max(x1 + 34, x2 + 34, x3 + 33)
      pair	s: []	p: 2	w: max(x1 + 12, x2 + 11)
      fst	s: []	p: 13	w: x1 + 13
      U111	s: [2]	p: 9	w: max(x1 + 39, x2 + 49)
      U132	s: []	p: 10	w: 0
      U43	s: []	p: 11	w: 2285
      #activate	s: []	p: 0	w: 1
      U152	s: []	p: 0	w: max(x2 + 1)
      U103	s: []	p: 12	w: 8
      #U53	s: []	p: 0	w: 1
      natsFrom	s: [1]	p: 8	w: x1
      #head	s: []	p: 0	w: 1
      #U43	s: []	p: 0	w: 1
      #U121	s: 2
      splitAt	s: []	p: 5	w: max(x2 + 18)
      isNaturalKind	s: [1]	p: 8	w: x1 + 10
      #U131	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      U72	s: []	p: 10	w: 8
      n__isNaturalKind	s: [1]	p: 8	w: x1 + 10
      #fst	s: []	p: 0	w: 1
      #U143	s: []	p: 0	w: 1
      n__nil	s: []	p: 0	w: 0
      #U52	s: [1]	p: 0	w: max(x1 + 1)
      #U103	s: 1
      #isPLNatKind	s: []	p: 0	w: 1
      #U202	s: []	p: 0	w: 0
      n__natsFrom	s: [1]	p: 8	w: x1
      isNatural	s: []	p: 15	w: x1 + 9
      n__snd	s: []	p: 8	w: x1 + 7
      U201	s: []	p: 4	w: max(x1, x3 + 12, x4 + 18)
      n__s	s: [1]	p: 13	w: x1
      n__splitAt	s: []	p: 5	w: max(x2 + 18)
      #U42	s: [1,2]	p: 0	w: x1 + x2 + 1
      #U141	s: [3,1,2]	p: 0	w: x1 + x2 + x3 + 1
      U141	s: []	p: 12	w: max(x1 + 10121, x2 + 3)
      #U171	s: [3]	p: 0	w: x3 + 1
      tail	s: []	p: 16	w: x1 + 47
      #U62	s: []	p: 0	w: 1
      0 	s: []	p: 12	w: 47
      U191	s: [1]	p: 3	w: max(x1 + 7, x2 + 18)
      n__take	s: [2]	p: 15	w: x1 + x2 + 33
      #sel	s: []	p: 0	w: x2 + 1
      #U102	s: [1]	p: 0	w: x1 + 1
      U153	s: []	p: 1	w: x1 + 1
      U171	s: []	p: 10	w: max(x1 + 91, x3 + 99)
      #isLNat	s: []	p: 0	w: 1
      U202	s: []	p: 3	w: max(x1, x2 + 12)
      sel	s: [2]	p: 12	w: x2 + 103
      #s 	s: []	p: 0	w: 1
      afterNth	s: []	p: 11	w: max(x2 + 47)
      n__cons	s: [1]	p: 7	w: max(x1, x2)
      #U211	s: []	p: 0	w: x1
      #isPLNat	s: []	p: 0	w: 1
      nil	s: []	p: 0	w: 0
      isLNat	s: []	p: 9	w: 46
      U62	s: []	p: 1	w: 26
      #U153	s: 1
      n__sel	s: [2]	p: 12	w: x2 + 103
      #tail	s: []	p: 0	w: 1
      #isNaturalKind	s: []	p: 0	w: 1
      #splitAt	s: []	p: 0	w: 0
      U151	s: []	p: 12	w: max(x2, x3 + 1)
      #nil	s: []	p: 0	w: 0
      U133	s: []	p: 1	w: 8
      n__tail	s: []	p: 16	w: x1 + 47
      #afterNth	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U111	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U221	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      n__0	s: []	p: 12	w: 47
      n__afterNth	s: []	p: 11	w: max(x2 + 47)
      U211	s: [2]	p: 12	w: max(x2 + 47)
      isLNatKind	s: []	p: 8	w: x1 + 11
      U52	s: []	p: 10	w: 0
      U61	s: []	p: 1	w: max(x1 + 18)
      #U51	s: [2]	p: 0	w: max(x2 + 1, x3 + 1)
      n__fst	s: []	p: 13	w: x1 + 13
      #U11	s: []	p: 0	w: x2 + 1
      U31	s: []	p: 7	w: max(x1 + 38, x2 + 34)
      U92	s: []	p: 1	w: 0
      head	s: []	p: 10	w: x1 + 51
      U112	s: []	p: 1	w: 48
      #snd	s: []	p: 0	w: 1
      #U41	s: [3]	p: 0	w: x2 + x3 + 1
      cons	s: [1]	p: 7	w: max(x1, x2)
      #natsFrom	s: 1
      U102	s: []	p: 12	w: 0
      snd	s: []	p: 8	w: x1 + 7
      #U191	s: []	p: 0	w: x2 + 1
      #U21	s: [2]	p: 0	w: x2 + 1
      U81	s: []	p: 4	w: max(x1 + 1, x2 + 7)
      U82	s: []	p: 4	w: 9
      #U112	s: []	p: 0	w: 1
      tt	s: []	p: 1	w: 8
      n__and	s: 2
      #U71	s: [1,2]	p: 0	w: x1 + x2 + 1
      #U151	s: [1,2,3]	p: 0	w: x1 + x2 + x3 + 1
      #isNatural	s: 1
      #pair	s: [2,1]	p: 0	w: max(x1 + 1, x2 + 1)
      n__head	s: []	p: 10	w: x1 + 51
      U51	s: [1]	p: 10	w: max(x1 + 46)
      #U161	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U122	s: []	p: 0	w: 1
      U53	s: []	p: 11	w: 8
      U41	s: []	p: 8	w: 0
      #U31	s: [1,2]	p: 0	w: x1 + x2 + 1
      #and	s: []	p: 0	w: max(x2 + 1)
      #U91	s: [2,1]	p: 0	w: x1 + x2 + 1
      #U132	s: [2]	p: 0	w: x2 + 1
      U121	s: []	p: 15	w: 0
      #U61	s: [2,1]	p: 0	w: x1 + x2 + 1
      U181	s: [2,1]	p: 1	w: max(x1 + 6, x2 + 13)
      U122	s: []	p: 16	w: x1 + 1
    USABLE RULES: { 3 4 6 8 11 17..27 30 33 35 37 39 42..45 54..61 66..69 72..115 }
    Removed DPs: #171
Number of SCCs: 3, DPs: 9
  SCC { #4 #131 #148 #225 }
POLO(Sum)... succeeded.
      #U201	w: 0
      #isLNatKind	w: 1
      #0 	w: 0
      #U72	w: 0
      U21	w: x2 + 25039
      U161	w: x2 + 30359
      n__isLNatKind	w: 1
      U11	w: x3 + 1
      #cons	w: 0
      s 	w: x1 + 35069
      n__pair	w: x1 + 60110
      U143	w: 1
      #U142	w: 0
      #take	w: 0
      isPLNatKind	w: 2
      U142	w: x2
      #U152	w: 0
      #U181	w: 0
      isPLNat	w: 3005
      U42	w: x1 + x2
      U91	w: x1
      U221	w: x1
      #U101	w: 0
      activate	w: x1 + 25036
      #U82	w: 0
      take	w: x2
      U71	w: x2
      #U81	w: 0
      and	w: x1 + 8502
      #U92	w: 0
      #U133	w: 0
      U131	w: x2 + x3
      U101	w: x2 + x3
      pair	w: 60109
      fst	w: 25038
      U111	w: x1
      U132	w: x1 + x2
      U43	w: 7766
      #activate	w: x1
      U152	w: 1
      U103	w: x1
      #U53	w: 0
      natsFrom	w: 30358
      #head	w: 0
      #U43	w: 0
      #U121	w: 0
      splitAt	w: x1 + 25037
      isNaturalKind	w: 5322
      #U131	w: 0
      U72	w: 1
      n__isNaturalKind	w: 5323
      #fst	w: 0
      #U143	w: 0
      n__nil	w: 1
      #U52	w: 0
      #U103	w: 0
      #isPLNatKind	w: 0
      #U202	w: 0
      n__natsFrom	w: x1 + 5321
      isNatural	w: x1 + 5722
      n__snd	w: x1 + 1
      U201	w: 60107
      n__s	w: 10032
      n__splitAt	w: x2
      #U42	w: 0
      #U141	w: 0
      U141	w: x2 + x3
      #U171	w: 0
      tail	w: 32379
      #U62	w: 0
      0 	w: 0
      U191	w: 25038
      n__take	w: x1 + x2 + 1
      #sel	w: 0
      #U102	w: 0
      U153	w: x1 + 1
      U171	w: x3 + 1
      #isLNat	w: 0
      U202	w: 60108
      sel	w: 0
      #s 	w: 0
      afterNth	w: 0
      n__cons	w: x1 + 13824
      #U211	w: 0
      #isPLNat	w: 0
      nil	w: 25038
      isLNat	w: 1
      U62	w: 7766
      #U153	w: 0
      n__sel	w: x2 + 1
      #tail	w: 0
      #isNaturalKind	w: 0
      #splitAt	w: 0
      U151	w: x2 + x3
      #nil	w: 0
      U133	w: x1 + 7765
      n__tail	w: x1 + 7342
      #afterNth	w: 0
      #U111	w: 0
      #U221	w: 0
      n__0	w: 2042
      n__afterNth	w: x1 + x2 + 4
      U211	w: x2 + 25035
      isLNatKind	w: x1
      U52	w: x1
      U61	w: x1 + x2
      #U51	w: 0
      n__fst	w: x1 + 1
      #U11	w: 0
      U31	w: x1 + x2 + 17270
      U92	w: x1 + 7765
      head	w: x1 + 25038
      U112	w: x1 + 7765
      #snd	w: 0
      #U41	w: 0
      cons	w: x1 + x2 + 1
      #natsFrom	w: 0
      U102	w: x2
      snd	w: x1 + 25038
      #U191	w: 0
      #U21	w: 0
      U81	w: x1 + x2
      U82	w: x1 + 4761
      #U112	w: 0
      tt	w: 7765
      n__and	w: x2 + 8503
      #U71	w: 0
      #U151	w: 0
      #isNatural	w: 0
      #pair	w: 0
      n__head	w: x1 + 1
      U51	w: x1 + x3
      #U161	w: 0
      #U122	w: 0
      U53	w: 7764
      U41	w: x1 + x2 + x3 + 48028
      #U31	w: 0
      #and	w: x2
      #U91	w: 0
      #U132	w: 0
      U121	w: x2
      #U61	w: 0
      U181	w: x2 + 25035
      U122	w: 1
    USABLE RULES: { 94 }
    Removed DPs: #225
Number of SCCs: 3, DPs: 8
  SCC { #4 #131 #148 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.