MAYBE
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(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(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: isLNat(X) -> n__isLNat(X)
      39: nil() -> n__nil()
      40: afterNth(X1,X2) -> n__afterNth(X1,X2)
      41: cons(X1,X2) -> n__cons(X1,X2)
      42: fst(X) -> n__fst(X)
      43: snd(X) -> n__snd(X)
      44: tail(X) -> n__tail(X)
      45: take(X1,X2) -> n__take(X1,X2)
      46: 0() -> n__0()
      47: head(X) -> n__head(X)
      48: s(X) -> n__s(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: activate(n__natsFrom(X)) -> natsFrom(X)
      54: activate(n__isLNat(X)) -> isLNat(X)
      55: activate(n__nil()) -> nil()
      56: activate(n__afterNth(X1,X2)) -> afterNth(X1,X2)
      57: activate(n__cons(X1,X2)) -> cons(X1,X2)
      58: activate(n__fst(X)) -> fst(X)
      59: activate(n__snd(X)) -> snd(X)
      60: activate(n__tail(X)) -> tail(X)
      61: activate(n__take(X1,X2)) -> take(X1,X2)
      62: activate(n__0()) -> 0()
      63: activate(n__head(X)) -> head(X)
      64: activate(n__s(X)) -> s(X)
      65: activate(n__sel(X1,X2)) -> sel(X1,X2)
      66: activate(n__pair(X1,X2)) -> pair(X1,X2)
      67: activate(n__splitAt(X1,X2)) -> splitAt(X1,X2)
      68: activate(n__and(X1,X2)) -> and(X1,X2)
      69: activate(X) -> X
Number of strict rules: 69
Direct POLO(bPol) ... failed.
Uncurrying ... 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__pair(X1,X2)) -> #pair(X1,X2)
     #15: #activate(n__natsFrom(X)) -> #natsFrom(X)
     #16: #activate(n__fst(X)) -> #fst(X)
     #17: #activate(n__take(X1,X2)) -> #take(X1,X2)
     #18: #U51(tt(),N,XS) -> #head(afterNth(activate(N),activate(XS)))
     #19: #U51(tt(),N,XS) -> #afterNth(activate(N),activate(XS))
     #20: #U51(tt(),N,XS) -> #activate(N)
     #21: #U51(tt(),N,XS) -> #activate(XS)
     #22: #activate(n__snd(X)) -> #snd(X)
     #23: #activate(n__nil()) -> #nil()
     #24: #activate(n__splitAt(X1,X2)) -> #splitAt(X1,X2)
     #25: #and(tt(),X) -> #activate(X)
     #26: #U81(tt(),N,X,XS) -> #U82(splitAt(activate(N),activate(XS)),activate(X))
     #27: #U81(tt(),N,X,XS) -> #splitAt(activate(N),activate(XS))
     #28: #U81(tt(),N,X,XS) -> #activate(N)
     #29: #U81(tt(),N,X,XS) -> #activate(XS)
     #30: #U81(tt(),N,X,XS) -> #activate(X)
     #31: #U91(tt(),XS) -> #activate(XS)
     #32: #activate(n__cons(X1,X2)) -> #cons(X1,X2)
     #33: #isLNat(n__take(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
     #34: #isLNat(n__take(V1,V2)) -> #isNatural(activate(V1))
     #35: #isLNat(n__take(V1,V2)) -> #activate(V1)
     #36: #isLNat(n__take(V1,V2)) -> #activate(V2)
     #37: #afterNth(N,XS) -> #U11(and(isNatural(N),n__isLNat(XS)),N,XS)
     #38: #afterNth(N,XS) -> #and(isNatural(N),n__isLNat(XS))
     #39: #afterNth(N,XS) -> #isNatural(N)
     #40: #sel(N,XS) -> #U51(and(isNatural(N),n__isLNat(XS)),N,XS)
     #41: #sel(N,XS) -> #and(isNatural(N),n__isLNat(XS))
     #42: #sel(N,XS) -> #isNatural(N)
     #43: #activate(n__afterNth(X1,X2)) -> #afterNth(X1,X2)
     #44: #fst(pair(X,Y)) -> #U21(and(isLNat(X),n__isLNat(Y)),X)
     #45: #fst(pair(X,Y)) -> #and(isLNat(X),n__isLNat(Y))
     #46: #fst(pair(X,Y)) -> #isLNat(X)
     #47: #activate(n__0()) -> #0()
     #48: #natsFrom(N) -> #U41(isNatural(N),N)
     #49: #natsFrom(N) -> #isNatural(N)
     #50: #isNatural(n__head(V1)) -> #isLNat(activate(V1))
     #51: #isNatural(n__head(V1)) -> #activate(V1)
     #52: #isLNat(n__natsFrom(V1)) -> #isNatural(activate(V1))
     #53: #isLNat(n__natsFrom(V1)) -> #activate(V1)
     #54: #U61(tt(),Y) -> #activate(Y)
     #55: #U82(pair(YS,ZS),X) -> #pair(cons(activate(X),YS),ZS)
     #56: #U82(pair(YS,ZS),X) -> #cons(activate(X),YS)
     #57: #U82(pair(YS,ZS),X) -> #activate(X)
     #58: #activate(n__s(X)) -> #s(X)
     #59: #splitAt(0(),XS) -> #U71(isLNat(XS),XS)
     #60: #splitAt(0(),XS) -> #isLNat(XS)
     #61: #U41(tt(),N) -> #cons(activate(N),n__natsFrom(s(activate(N))))
     #62: #U41(tt(),N) -> #activate(N)
     #63: #U41(tt(),N) -> #s(activate(N))
     #64: #U41(tt(),N) -> #activate(N)
     #65: #activate(n__sel(X1,X2)) -> #sel(X1,X2)
     #66: #isPLNat(n__pair(V1,V2)) -> #and(isLNat(activate(V1)),n__isLNat(activate(V2)))
     #67: #isPLNat(n__pair(V1,V2)) -> #isLNat(activate(V1))
     #68: #isPLNat(n__pair(V1,V2)) -> #activate(V1)
     #69: #isPLNat(n__pair(V1,V2)) -> #activate(V2)
     #70: #isLNat(n__tail(V1)) -> #isLNat(activate(V1))
     #71: #isLNat(n__tail(V1)) -> #activate(V1)
     #72: #splitAt(s(N),cons(X,XS)) -> #U81(and(isNatural(N),n__and(isNatural(X),n__isLNat(activate(XS)))),N,X,activate(XS))
     #73: #splitAt(s(N),cons(X,XS)) -> #and(isNatural(N),n__and(isNatural(X),n__isLNat(activate(XS))))
     #74: #splitAt(s(N),cons(X,XS)) -> #isNatural(N)
     #75: #splitAt(s(N),cons(X,XS)) -> #isNatural(X)
     #76: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
     #77: #splitAt(s(N),cons(X,XS)) -> #activate(XS)
     #78: #isNatural(n__sel(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
     #79: #isNatural(n__sel(V1,V2)) -> #isNatural(activate(V1))
     #80: #isNatural(n__sel(V1,V2)) -> #activate(V1)
     #81: #isNatural(n__sel(V1,V2)) -> #activate(V2)
     #82: #activate(n__tail(X)) -> #tail(X)
     #83: #isLNat(n__afterNth(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
     #84: #isLNat(n__afterNth(V1,V2)) -> #isNatural(activate(V1))
     #85: #isLNat(n__afterNth(V1,V2)) -> #activate(V1)
     #86: #isLNat(n__afterNth(V1,V2)) -> #activate(V2)
     #87: #snd(pair(X,Y)) -> #U61(and(isLNat(X),n__isLNat(Y)),Y)
     #88: #snd(pair(X,Y)) -> #and(isLNat(X),n__isLNat(Y))
     #89: #snd(pair(X,Y)) -> #isLNat(X)
     #90: #isLNat(n__fst(V1)) -> #isPLNat(activate(V1))
     #91: #isLNat(n__fst(V1)) -> #activate(V1)
     #92: #activate(n__head(X)) -> #head(X)
     #93: #isNatural(n__s(V1)) -> #isNatural(activate(V1))
     #94: #isNatural(n__s(V1)) -> #activate(V1)
     #95: #activate(n__and(X1,X2)) -> #and(X1,X2)
     #96: #take(N,XS) -> #U101(and(isNatural(N),n__isLNat(XS)),N,XS)
     #97: #take(N,XS) -> #and(isNatural(N),n__isLNat(XS))
     #98: #take(N,XS) -> #isNatural(N)
     #99: #isLNat(n__snd(V1)) -> #isPLNat(activate(V1))
     #100: #isLNat(n__snd(V1)) -> #activate(V1)
     #101: #U21(tt(),X) -> #activate(X)
     #102: #U101(tt(),N,XS) -> #fst(splitAt(activate(N),activate(XS)))
     #103: #U101(tt(),N,XS) -> #splitAt(activate(N),activate(XS))
     #104: #U101(tt(),N,XS) -> #activate(N)
     #105: #U101(tt(),N,XS) -> #activate(XS)
     #106: #activate(n__isLNat(X)) -> #isLNat(X)
     #107: #U71(tt(),XS) -> #pair(nil(),activate(XS))
     #108: #U71(tt(),XS) -> #nil()
     #109: #U71(tt(),XS) -> #activate(XS)
     #110: #head(cons(N,XS)) -> #U31(and(isNatural(N),n__isLNat(activate(XS))),N)
     #111: #head(cons(N,XS)) -> #and(isNatural(N),n__isLNat(activate(XS)))
     #112: #head(cons(N,XS)) -> #isNatural(N)
     #113: #head(cons(N,XS)) -> #activate(XS)
     #114: #U31(tt(),N) -> #activate(N)
     #115: #isLNat(n__cons(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2)))
     #116: #isLNat(n__cons(V1,V2)) -> #isNatural(activate(V1))
     #117: #isLNat(n__cons(V1,V2)) -> #activate(V1)
     #118: #isLNat(n__cons(V1,V2)) -> #activate(V2)
Number of SCCs: 1, DPs: 107
  SCC { #1..13 #15..22 #24..31 #33..46 #48..54 #57 #59 #60 #62 #64..106 #109..118 }
POLO(Sum)... POLO(max)... succeeded.
      #0 	w: 0
      U21	w: max(x1 + 11561, x2 + 1)
      U11	w: max(x1 + 1, x2 + 1198, x3 + 1193)
      #cons	w: 0
      s 	w: x1
      n__pair	w: max(x1 + 1079, x2 + 1081)
      #take	w: max(x1 + 11680, x2 + 11680)
      isPLNat	w: x1
      U91	w: max(x1 + 27275, x2 + 785)
      #U101	w: max(x1 + 11675, x2 + 11679, x3 + 11679)
      activate	w: x1
      n__isLNat	w: x1
      #U82	w: max(x2 + 468)
      take	w: max(x1 + 11680, x2 + 11681)
      U71	w: max(x1 + 1076, x2 + 1114)
      #U81	w: max(x1 + 1188, x2 + 1191, x3 + 1191, x4 + 1188)
      and	w: max(x1 + 1, x2)
      U101	w: max(x1 + 1305, x2 + 11678, x3 + 11681)
      pair	w: max(x1 + 1079, x2 + 1081)
      fst	w: x1 + 10483
      #activate	w: x1 + 1
      natsFrom	w: x1 + 28257
      #head	w: x1 + 184
      splitAt	w: max(x1 + 1195, x2 + 1191)
      #fst	w: x1 + 10483
      n__nil	w: 35
      n__natsFrom	w: x1 + 28257
      isNatural	w: x1 + 2
      n__snd	w: x1 + 2
      n__s	w: x1
      n__splitAt	w: max(x1 + 1195, x2 + 1191)
      tail	w: x1 + 27277
      0 	w: 29135
      n__take	w: max(x1 + 11680, x2 + 11681)
      #sel	w: max(x1 + 1569, x2 + 29858)
      #isLNat	w: x1 + 1
      sel	w: max(x1 + 30044, x2 + 29858)
      #s 	w: 0
      afterNth	w: max(x1 + 1383, x2 + 1197)
      n__cons	w: max(x1 + 3, x2)
      #isPLNat	w: x1
      nil	w: 35
      isLNat	w: x1
      n__sel	w: max(x1 + 30044, x2 + 29858)
      #tail	w: x1 + 19916
      #splitAt	w: max(x1 + 1191, x2 + 1188)
      #nil	w: 0
      n__tail	w: x1 + 27277
      #afterNth	w: max(x1 + 1383, x2 + 1197)
      n__0	w: 29135
      n__afterNth	w: max(x1 + 1383, x2 + 1197)
      U61	w: max(x2 + 1083)
      #U51	w: max(x2 + 1568, x3 + 1382)
      n__fst	w: x1 + 10483
      #U11	w: max(x2 + 1196, x3 + 1196)
      U31	w: max(x2 + 28664)
      head	w: x1 + 28661
      #snd	w: x1
      #U41	w: max(x1, x2 + 2)
      cons	w: max(x1 + 3, x2)
      #natsFrom	w: x1 + 3
      snd	w: x1 + 2
      #U21	w: max(x1 + 11560, x2 + 11561)
      U81	w: max(x1 + 1189, x2 + 1195, x3 + 1194, x4 + 1191)
      U82	w: max(x1, x2 + 1194)
      tt	w: 4
      n__and	w: max(x1 + 1, x2)
      #U71	w: max(x1 + 920, x2 + 1187)
      #isNatural	w: x1 + 2
      #pair	w: 0
      n__head	w: x1 + 28661
      U51	w: max(x1 + 29856, x2 + 30044, x3 + 29858)
      U41	w: max(x2 + 28257)
      #U31	w: max(x1 + 182, x2 + 183)
      #and	w: max(x2 + 1)
      #U91	w: max(x1 + 19912, x2 + 19914)
      #U61	w: max(x2 + 1078)
    USABLE RULES: { 1..69 }
    Removed DPs: #1..13 #15..22 #24 #26 #28..31 #33..46 #48..54 #57 #59 #60 #62 #64..71 #73..92 #94 #96..105 #109..114 #116 #117
Number of SCCs: 3, DPs: 8
  SCC { #93 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      #0 	s: []	p: 0	w: 0
      U21	s: [2]	p: 3	w: max(x2 + 63181)
      U11	s: [2,1]	p: 3	w: max(x1 + 63189, x2 + 126376, x3 + 126378)
      #cons	s: 1
      s 	s: [1]	p: 3	w: x1
      n__pair	s: [1,2]	p: 0	w: max(x1 + 63181, x2 + 41066)
      #take	s: [2,1]	p: 0	w: x1 + x2 + 1
      isPLNat	s: []	p: 3	w: 63189
      U91	s: []	p: 0	w: max(x2 + 24338)
      #U101	s: [3]	p: 0	w: x2 + x3 + 1
      activate	s: 1
      n__isLNat	s: []	p: 3	w: 63189
      #U82	s: 1
      take	s: [2]	p: 6	w: x1 + x2 + 126381
      U71	s: [2]	p: 4	w: max(x1 + 63183, x2 + 41067)
      #U81	s: [3,2,1]	p: 0	w: max(x1 + 1, x2 + 1, x3 + 1)
      and	s: 2
      U101	s: [2,1]	p: 5	w: max(x1 + 63191, x2 + 126380, x3 + 126380)
      pair	s: [1,2]	p: 0	w: max(x1 + 63181, x2 + 41066)
      fst	s: []	p: 5	w: x1
      #activate	s: []	p: 0	w: 1
      natsFrom	s: [1]	p: 7	w: x1
      #head	s: 1
      splitAt	s: [2,1]	p: 4	w: max(x1 + 126375, x2 + 63184)
      #fst	s: 1
      n__nil	s: []	p: 3	w: 63186
      n__natsFrom	s: [1]	p: 7	w: x1
      isNatural	s: []	p: 3	w: 63189
      n__snd	s: [1]	p: 0	w: x1
      n__s	s: [1]	p: 3	w: x1
      n__splitAt	s: [2,1]	p: 4	w: max(x1 + 126375, x2 + 63184)
      tail	s: []	p: 0	w: x1 + 63190
      0 	s: []	p: 5	w: 63190
      n__take	s: [2]	p: 6	w: x1 + x2 + 126381
      #sel	s: [1,2]	p: 0	w: x1 + x2 + 1
      #isLNat	s: []	p: 0	w: 1
      sel	s: [2]	p: 8	w: x1 + x2 + 296067
      #s 	s: []	p: 0	w: 1
      afterNth	s: []	p: 6	w: max(x1 + 126377, x2 + 211222)
      n__cons	s: []	p: 2	w: max(x1, x2)
      #isPLNat	s: []	p: 0	w: 1
      nil	s: []	p: 3	w: 63186
      isLNat	s: []	p: 3	w: 63189
      n__sel	s: [2]	p: 8	w: x1 + x2 + 296067
      #tail	s: 1
      #splitAt	s: 1
      #nil	s: []	p: 0	w: 0
      n__tail	s: []	p: 0	w: x1 + 63190
      #afterNth	s: [2,1]	p: 0	w: x1 + x2 + 1
      n__0	s: []	p: 5	w: 63190
      n__afterNth	s: []	p: 6	w: max(x1 + 126377, x2 + 211222)
      U61	s: [2]	p: 3	w: max(x2 + 26929)
      #U51	s: 1
      n__fst	s: []	p: 5	w: x1
      #U11	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      U31	s: []	p: 6	w: max(x1 + 21653, x2 + 62088)
      head	s: []	p: 6	w: x1 + 84843
      #snd	s: []	p: 0	w: 1
      #U41	s: []	p: 0	w: x2 + 1
      cons	s: []	p: 2	w: max(x1, x2)
      #natsFrom	s: []	p: 0	w: 1
      snd	s: [1]	p: 0	w: x1
      #U21	s: [2,1]	p: 0	w: x1 + x2 + 1
      U81	s: [2]	p: 3	w: max(x1 + 63185, x2 + 126375, x3 + 63183, x4 + 63184)
      U82	s: []	p: 3	w: max(x1, x2 + 63182)
      tt	s: []	p: 6	w: 63185
      n__and	s: 2
      #U71	s: [1,2]	p: 0	w: x1 + x2 + 1
      #isNatural	s: [1]	p: 0	w: x1 + 1
      #pair	s: [1,2]	p: 0	w: max(x1 + 1, x2 + 1)
      n__head	s: []	p: 6	w: x1 + 84843
      U51	s: [1]	p: 7	w: max(x1 + 8405, x2 + 211221, x3 + 296066)
      U41	s: []	p: 7	w: max(x2)
      #U31	s: [1]	p: 0	w: x1 + 1
      #and	s: [2,1]	p: 0	w: max(x1 + 1, x2 + 1)
      #U91	s: [2]	p: 0	w: x2 + 1
      #U61	s: [1]	p: 0	w: x1 + 1
    USABLE RULES: { 1..69 }
    Removed DPs: #93
Number of SCCs: 2, DPs: 7
  SCC { #27 #72 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      #0 	s: []	p: 0	w: 0
      U21	s: [2]	p: 3	w: max(x2 + 10)
      U11	s: [2,3]	p: 1	w: max(x1 + 33, x2 + 40, x3 + 42)
      #cons	s: 1
      s 	s: [1]	p: 3	w: x1
      n__pair	s: []	p: 1	w: max(x1 + 10, x2 + 12)
      #take	s: [2,1]	p: 0	w: x1 + x2 + 1
      isPLNat	s: []	p: 6	w: 9
      U91	s: []	p: 4	w: max(x2 + 5)
      #U101	s: [3]	p: 0	w: x2 + x3 + 1
      activate	s: 1
      n__isLNat	s: []	p: 6	w: 9
      #U82	s: 1
      take	s: []	p: 9	w: x1 + x2 + 13530
      U71	s: [1]	p: 7	w: max(x1 + 63195, x2 + 29)
      #U81	s: [2]	p: 10	w: max(x1, x2 + 30258)
      and	s: 2
      U101	s: [3,1]	p: 8	w: max(x1 + 13520, x2 + 13521, x3 + 13521)
      pair	s: []	p: 1	w: max(x1 + 10, x2 + 12)
      fst	s: []	p: 8	w: x1 + 13485
      #activate	s: []	p: 0	w: 1
      natsFrom	s: []	p: 10	w: x1 + 9
      #head	s: 1
      splitAt	s: [1]	p: 7	w: max(x1 + 35, x2 + 29)
      #fst	s: 1
      n__nil	s: []	p: 3	w: 749
      n__natsFrom	s: []	p: 10	w: x1 + 9
      isNatural	s: []	p: 6	w: 9
      n__snd	s: []	p: 0	w: x1 + 4
      n__s	s: [1]	p: 3	w: x1
      n__splitAt	s: [1]	p: 7	w: max(x1 + 35, x2 + 29)
      tail	s: []	p: 4	w: x1 + 63190
      0 	s: []	p: 8	w: 63170
      n__take	s: []	p: 9	w: x1 + x2 + 13530
      #sel	s: [1,2]	p: 0	w: x1 + x2 + 1
      #isLNat	s: []	p: 0	w: 1
      sel	s: [2]	p: 11	w: x1 + x2 + 39907
      #s 	s: []	p: 0	w: 1
      afterNth	s: []	p: 9	w: max(x1 + 41, x2 + 19974)
      n__cons	s: []	p: 5	w: max(x1 + 9, x2)
      #isPLNat	s: []	p: 0	w: 1
      nil	s: []	p: 3	w: 749
      isLNat	s: []	p: 6	w: 9
      n__sel	s: [2]	p: 11	w: x1 + x2 + 39907
      #tail	s: 1
      #splitAt	s: [1]	p: 10	w: max(x1 + 30258)
      #nil	s: []	p: 0	w: 0
      n__tail	s: []	p: 4	w: x1 + 63190
      #afterNth	s: [2,1]	p: 0	w: x1 + x2 + 1
      n__0	s: []	p: 8	w: 63170
      n__afterNth	s: []	p: 9	w: max(x1 + 41, x2 + 19974)
      U61	s: [1,2]	p: 0	w: max(x1 + 4, x2 + 11)
      #U51	s: 1
      n__fst	s: []	p: 8	w: x1 + 13485
      #U11	s: [1,3,2]	p: 0	w: x1 + x2 + x3 + 1
      U31	s: []	p: 9	w: max(x1 + 19921, x2 + 6446)
      head	s: []	p: 9	w: x1 + 19931
      #snd	s: []	p: 0	w: 1
      #U41	s: []	p: 0	w: x2 + 1
      cons	s: []	p: 5	w: max(x1 + 9, x2)
      #natsFrom	s: []	p: 0	w: 1
      snd	s: []	p: 0	w: x1 + 4
      #U21	s: [2,1]	p: 0	w: x1 + x2 + 1
      U81	s: [2]	p: 3	w: max(x1 + 19, x2 + 35, x3 + 28, x4 + 29)
      U82	s: []	p: 3	w: max(x1, x2 + 19)
      tt	s: []	p: 9	w: 1
      n__and	s: 2
      #U71	s: [1,2]	p: 0	w: x1 + x2 + 1
      #isNatural	s: []	p: 0	w: 1
      #pair	s: [1,2]	p: 0	w: max(x1 + 1, x2 + 1)
      n__head	s: []	p: 9	w: x1 + 19931
      U51	s: []	p: 10	w: max(x2 + 19973, x3 + 39906)
      U41	s: []	p: 10	w: max(x2 + 9)
      #U31	s: [1]	p: 0	w: x1 + 1
      #and	s: [2,1]	p: 0	w: max(x1 + 1, x2 + 1)
      #U91	s: [2]	p: 0	w: x2 + 1
      #U61	s: [1]	p: 0	w: x1 + 1
    USABLE RULES: { 1..69 }
    Removed DPs: #72
Number of SCCs: 1, DPs: 5
  SCC { #25 #95 #106 #115 #118 }
POLO(Sum)... POLO(max)... succeeded.
      #0 	w: 0
      U21	w: max(x2 + 1)
      U11	w: max(x1, x2 + 5, x3 + 4)
      #cons	w: 0
      s 	w: x1
      n__pair	w: max(x1 + 1, x2 + 1)
      #take	w: 0
      isPLNat	w: x1 + 1
      U91	w: max(x1, x2 + 1)
      #U101	w: 0
      activate	w: x1
      n__isLNat	w: x1 + 1
      #U82	w: 0
      take	w: max(x1 + 11407, x2 + 11408)
      U71	w: max(x2 + 3)
      #U81	w: 0
      and	w: max(x1 + 1, x2)
      U101	w: max(x2 + 5, x3 + 11408)
      pair	w: max(x1 + 1, x2 + 1)
      fst	w: x1 + 1
      #activate	w: x1 + 39802
      natsFrom	w: x1 + 2
      #head	w: 184
      splitAt	w: max(x1 + 4, x2 + 3)
      #fst	w: 10483
      n__nil	w: 2
      n__natsFrom	w: x1 + 2
      isNatural	w: x1 + 1
      n__snd	w: x1
      n__s	w: x1
      n__splitAt	w: max(x1 + 4, x2 + 3)
      tail	w: x1 + 1
      0 	w: 36242
      n__take	w: max(x1 + 11407, x2 + 11408)
      #sel	w: 0
      #isLNat	w: x1 + 39803
      sel	w: max(x1 + 27076, x2 + 27077)
      #s 	w: 0
      afterNth	w: max(x1 + 5, x2 + 4)
      n__cons	w: max(x1 + 2, x2)
      #isPLNat	w: 0
      nil	w: 2
      isLNat	w: x1 + 1
      n__sel	w: max(x1 + 27076, x2 + 27077)
      #tail	w: 19916
      #splitAt	w: 0
      #nil	w: 0
      n__tail	w: x1 + 1
      #afterNth	w: 0
      n__0	w: 36242
      n__afterNth	w: max(x1 + 5, x2 + 4)
      U61	w: max(x2 + 1)
      #U51	w: 0
      n__fst	w: x1 + 1
      #U11	w: 0
      U31	w: max(x2 + 2)
      head	w: x1
      #snd	w: 0
      #U41	w: 0
      cons	w: max(x1 + 2, x2)
      #natsFrom	w: 3
      snd	w: x1
      #U21	w: 0
      U81	w: max(x1 + 2, x2 + 4, x3 + 5, x4 + 3)
      U82	w: max(x1, x2 + 5)
      tt	w: 2
      n__and	w: max(x1 + 1, x2)
      #U71	w: 0
      #isNatural	w: 2
      #pair	w: 0
      n__head	w: x1
      U51	w: max(x2 + 5, x3 + 27077)
      U41	w: max(x1, x2 + 2)
      #U31	w: 0
      #and	w: max(x2 + 39802)
      #U91	w: 0
      #U61	w: 0
    USABLE RULES: { 1..69 }
    Removed DPs: #118
Number of SCCs: 1, DPs: 4
  SCC { #25 #95 #106 #115 }
POLO(Sum)... succeeded.
      #0 	w: 0
      U21	w: 7
      U11	w: x1 + x3
      #cons	w: 0
      s 	w: 3
      n__pair	w: 9
      #take	w: 2
      isPLNat	w: 4
      U91	w: x1 + 1
      #U101	w: 0
      activate	w: 2
      n__isLNat	w: 4
      #U82	w: 2
      take	w: x2 + 4
      U71	w: x1 + 9
      #U81	w: 0
      and	w: x2 + 1
      U101	w: 5
      pair	w: x1 + 3
      fst	w: x1 + 3
      #activate	w: x1
      natsFrom	w: 6
      #head	w: 2
      splitAt	w: 3
      #fst	w: 2
      n__nil	w: 24
      n__natsFrom	w: 12
      isNatural	w: x1 + 2
      n__snd	w: 4
      n__s	w: 11861
      n__splitAt	w: 4
      tail	w: 5
      0 	w: 3
      n__take	w: x1 + 6
      #sel	w: 2
      #isLNat	w: 4
      sel	w: x1 + 3
      #s 	w: 0
      afterNth	w: x1 + 4
      n__cons	w: 6
      #isPLNat	w: 2
      nil	w: 23
      isLNat	w: 3
      n__sel	w: x2
      #tail	w: 2
      #splitAt	w: 0
      #nil	w: 0
      n__tail	w: x1 + 6
      #afterNth	w: 2
      n__0	w: 7365
      n__afterNth	w: x1 + 5
      U61	w: x2 + 1
      #U51	w: 0
      n__fst	w: 4
      #U11	w: 1
      U31	w: 8
      head	w: x1 + 3
      #snd	w: 2
      #U41	w: 0
      cons	w: x1 + 4
      #natsFrom	w: 2
      snd	w: x1 + 3
      #U21	w: 2
      U81	w: x2 + x3 + 9
      U82	w: x2 + 8
      tt	w: 0
      n__and	w: x2 + 14621
      #U71	w: 0
      #isNatural	w: 2
      #pair	w: 0
      n__head	w: x1
      U51	w: x1 + x3
      U41	w: x1 + 5
      #U31	w: 2
      #and	w: x2
      #U91	w: 2
      #U61	w: 2
    USABLE RULES: { }
    Removed DPs: #95
Number of SCCs: 1, DPs: 3
  SCC { #25 #106 #115 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.