/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


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(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 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
	SCC { #1..25 #27 #29 #31..39 #41..66 #69 #71 #72 #74..123 #126..135 }
Sum... Max... succeeded.
  #0()		w: (0)
  U21(x1,x2)		w: (max{x2, 0})
  U11(x1,x2,x3)		w: (max{1 + x3, 1 + x2, 1 + x1})
  #cons(x1,x2)		w: (0)
  s(x1)		w: (x1)
  n__pair(x1,x2)		w: (max{x2, x1})
  #take(x1,x2)		w: (max{x2, x1})
  isPLNat(x1)		w: (x1)
  U91(x1,x2)		w: (max{x2, 0})
  #U101(x1,x2,x3)		w: (max{x3, x2, 0})
  activate(x1)		w: (x1)
  n__isLNat(x1)		w: (x1)
  #U82(x1,x2)		w: (max{x2, 0})
  take(x1,x2)		w: (max{x2, x1})
  U71(x1,x2)		w: (max{x2, 0})
  #U81(x1,x2,x3,x4)		w: (max{x4, x3, x2, 0})
  and(x1,x2)		w: (max{x2, x1})
  U101(x1,x2,x3)		w: (max{x3, x2, 0})
  pair(x1,x2)		w: (max{x2, x1})
  fst(x1)		w: (x1)
  #activate(x1)		w: (x1)
  natsFrom(x1)		w: (x1)
  #head(x1)		w: (x1)
  splitAt(x1,x2)		w: (max{x2, x1})
  #fst(x1)		w: (x1)
  n__nil()		w: (0)
  n__natsFrom(x1)		w: (x1)
  isNatural(x1)		w: (x1)
  n__snd(x1)		w: (x1)
  n__s(x1)		w: (x1)
  n__splitAt(x1,x2)		w: (max{x2, x1})
  tail(x1)		w: (x1)
  0()		w: (31203)
  n__take(x1,x2)		w: (max{x2, x1})
  #sel(x1,x2)		w: (max{14099 + x2, 14099 + x1})
  #isLNat(x1)		w: (x1)
  sel(x1,x2)		w: (max{14099 + x2, 14099 + x1})
  #s(x1)		w: (0)
  afterNth(x1,x2)		w: (max{1 + x2, 1 + x1})
  n__cons(x1,x2)		w: (max{x2, x1})
  #isPLNat(x1)		w: (x1)
  nil()		w: (0)
  isLNat(x1)		w: (x1)
  n__sel(x1,x2)		w: (max{14099 + x2, 14099 + x1})
  #tail(x1)		w: (x1)
  #splitAt(x1,x2)		w: (max{x2, x1})
  #nil()		w: (0)
  n__tail(x1)		w: (x1)
  #afterNth(x1,x2)		w: (max{1 + x2, 1 + x1})
  n__isNatural(x1)		w: (x1)
  n__0()		w: (31203)
  n__afterNth(x1,x2)		w: (max{1 + x2, 1 + x1})
  U61(x1,x2)		w: (max{x2, 0})
  #U51(x1,x2,x3)		w: (max{14099 + x3, 14099 + x2, 14099 + x1})
  n__fst(x1)		w: (x1)
  #U11(x1,x2,x3)		w: (max{x3, x2, 1 + x1})
  U31(x1,x2)		w: (max{x2, 1 + x1})
  head(x1)		w: (1 + x1)
  #snd(x1)		w: (x1)
  #U41(x1,x2)		w: (max{x2, 0})
  cons(x1,x2)		w: (max{x2, x1})
  #natsFrom(x1)		w: (x1)
  snd(x1)		w: (x1)
  #U21(x1,x2)		w: (max{x2, 0})
  U81(x1,x2,x3,x4)		w: (max{x4, x3, x2, 0})
  U82(x1,x2)		w: (max{x2, x1})
  tt()		w: (0)
  n__and(x1,x2)		w: (max{x2, x1})
  #U71(x1,x2)		w: (max{x2, 0})
  #isNatural(x1)		w: (x1)
  #pair(x1,x2)		w: (0)
  n__head(x1)		w: (1 + x1)
  U51(x1,x2,x3)		w: (max{2607 + x3, 4685 + x2, 0})
  U41(x1,x2)		w: (max{x2, 0})
  #U31(x1,x2)		w: (max{x2, 0})
  #and(x1,x2)		w: (max{x2, 0})
  #U91(x1,x2)		w: (max{x2, 0})
  #U61(x1,x2)		w: (max{x2, 0})
    USABLE RULES: { 1..71 }
    Removed DPs: #15 #16 #18 #19 #22..25 #49 #50 #52 #53 #62 #63 #76 #77 #89..92 #95..98
Number of SCCs: 1, DPs: 94
	SCC { #1..13 #17 #20 #21 #27 #29 #31..39 #41..48 #54..61 #64..66 #69 #71 #72 #74 #75 #78..88 #93 #94 #99..123 #126 #132..135 }
Sum... Max... succeeded.
  #0()		w: (0)
  U21(x1,x2)		w: (max{x2, 17978 + x1})
  U11(x1,x2,x3)		w: (max{56474 + x3, 56471 + x2, 0})
  #cons(x1,x2)		w: (0)
  s(x1)		w: (x1)
  n__pair(x1,x2)		w: (max{x2, 2 + x1})
  #take(x1,x2)		w: (max{58421 + x2, 56522 + x1})
  isPLNat(x1)		w: (2 + x1)
  U91(x1,x2)		w: (max{x2, 32662 + x1})
  #U101(x1,x2,x3)		w: (max{56523 + x3, 56521 + x2, 0})
  activate(x1)		w: (x1)
  n__isLNat(x1)		w: (2 + x1)
  #U82(x1,x2)		w: (max{1674 + x2, 0})
  take(x1,x2)		w: (max{58422 + x2, 79121 + x1})
  U71(x1,x2)		w: (max{5117 + x2, x1})
  #U81(x1,x2,x3,x4)		w: (max{9997 + x4, 9998 + x3, 9996 + x2, 9992 + x1})
  and(x1,x2)		w: (max{x2, 1 + x1})
  U101(x1,x2,x3)		w: (max{58422 + x3, 79121 + x2, 58420 + x1})
  pair(x1,x2)		w: (max{x2, 2 + x1})
  fst(x1)		w: (26326 + x1)
  #activate(x1)		w: (x1)
  natsFrom(x1)		w: (7 + x1)
  #head(x1)		w: (0)
  splitAt(x1,x2)		w: (max{32096 + x2, 32102 + x1})
  #fst(x1)		w: (24418 + x1)
  n__nil()		w: (5)
  n__natsFrom(x1)		w: (7 + x1)
  isNatural(x1)		w: (2 + x1)
  n__snd(x1)		w: (24369 + x1)
  n__s(x1)		w: (x1)
  n__splitAt(x1,x2)		w: (max{32096 + x2, 32102 + x1})
  tail(x1)		w: (32664 + x1)
  0()		w: (3702)
  n__take(x1,x2)		w: (max{58422 + x2, 79121 + x1})
  #sel(x1,x2)		w: (0)
  #isLNat(x1)		w: (2 + x1)
  sel(x1,x2)		w: (max{58416 + x2, 58415 + x1})
  #s(x1)		w: (0)
  afterNth(x1,x2)		w: (max{56474 + x2, 56473 + x1})
  n__cons(x1,x2)		w: (max{x2, 7 + x1})
  #isPLNat(x1)		w: (7844 + x1)
  nil()		w: (5)
  isLNat(x1)		w: (2 + x1)
  n__sel(x1,x2)		w: (max{58416 + x2, 58415 + x1})
  #tail(x1)		w: (32663 + x1)
  #splitAt(x1,x2)		w: (max{9997 + x2, 9996 + x1})
  #nil()		w: (0)
  n__tail(x1)		w: (32664 + x1)
  #afterNth(x1,x2)		w: (max{56465 + x2, 56472 + x1})
  n__isNatural(x1)		w: (2 + x1)
  n__0()		w: (3702)
  n__afterNth(x1,x2)		w: (max{56474 + x2, 56473 + x1})
  U61(x1,x2)		w: (max{x2, 24367 + x1})
  #U51(x1,x2,x3)		w: (0)
  n__fst(x1)		w: (26326 + x1)
  #U11(x1,x2,x3)		w: (max{56464 + x3, 56471 + x2, 0})
  U31(x1,x2)		w: (max{1 + x2, 1940 + x1})
  head(x1)		w: (1942 + x1)
  #snd(x1)		w: (24368 + x1)
  #U41(x1,x2)		w: (max{3 + x2, 0})
  cons(x1,x2)		w: (max{x2, 7 + x1})
  #natsFrom(x1)		w: (4 + x1)
  snd(x1)		w: (24369 + x1)
  #U21(x1,x2)		w: (max{24419 + x2, 0})
  U81(x1,x2,x3,x4)		w: (max{32096 + x4, 32103 + x3, 32102 + x2, 32089 + x1})
  U82(x1,x2)		w: (max{32103 + x2, x1})
  tt()		w: (6)
  n__and(x1,x2)		w: (max{x2, 1 + x1})
  #U71(x1,x2)		w: (max{9996 + x2, 0})
  #isNatural(x1)		w: (1 + x1)
  #pair(x1,x2)		w: (0)
  n__head(x1)		w: (1942 + x1)
  U51(x1,x2,x3)		w: (max{58416 + x3, 58415 + x2, 0})
  U41(x1,x2)		w: (max{7 + x2, 4 + x1})
  #U31(x1,x2)		w: (0)
  #and(x1,x2)		w: (max{x2, 0})
  #U91(x1,x2)		w: (max{27581 + x2, 0})
  #U61(x1,x2)		w: (max{x2, 24364 + x1})
    USABLE RULES: { 1..71 }
    Removed DPs: #2..13 #17 #20 #21 #27 #31 #34 #36..39 #41..45 #47 #48 #55..61 #64 #65 #69 #71 #72 #74 #75 #78..83 #85..88 #93 #94 #99..106 #108..123 #126 #133..135
Number of SCCs: 3, DPs: 9
	SCC { #107 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  #0()	0	w: (0)
  U21(x1,x2)	0[x2,x1]	w: (max{11824 + x2, x1})
  U11(x1,x2,x3)	7[]	w: (max{11827 + x3, 0, 4 + x1})
  #cons(x1,x2)	0[x2]	w: (max{x2, 0})
  s(x1)	4[x1]	w: (x1)
  n__pair(x1,x2)	2[x2]	w: (max{1 + x2, x1})
  #take(x1,x2)	0[]	w: (x2)
  isPLNat(x1)	8[]	w: (11825)
  U91(x1,x2)	4[]	w: (max{4187 + x2, 0})
  #U101(x1,x2,x3)	0[x3,x1,x2]	w: (1 + x3 + x2 + x1)
  activate(x1)	x1	w: (x1)
  n__isLNat(x1)	8[]	w: (11825)
  #U82(x1,x2)	0[x1,x2]	w: (1 + x2 + x1)
  take(x1,x2)	10[x2,x1]	w: (23652 + x2 + x1)
  U71(x1,x2)	4[]	w: (max{11821 + x2, x1})
  #U81(x1,x2,x3,x4)	0[]	w: (max{0, x3})
  and(x1,x2)	x2	w: (max{x2, 0})
  U101(x1,x2,x3)	9[x2]	w: (max{23650 + x3, 23651 + x2, 3 + x1})
  pair(x1,x2)	2[x2]	w: (max{1 + x2, x1})
  fst(x1)	9[]	w: (11825 + x1)
  #activate(x1)	0[]	w: (x1)
  natsFrom(x1)	6[]	w: (x1)
  #head(x1)	0[]	w: (1)
  splitAt(x1,x2)	4[]	w: (max{11825 + x2, 0})
  #fst(x1)	0[]	w: (1)
  n__nil()	4	w: (11822)
  n__natsFrom(x1)	6[]	w: (x1)
  isNatural(x1)	8[]	w: (11825)
  n__snd(x1)	6[x1]	w: (1 + x1)
  n__s(x1)	4[x1]	w: (x1)
  n__splitAt(x1,x2)	4[]	w: (max{11825 + x2, 0})
  tail(x1)	4[]	w: (4188 + x1)
  0()	0	w: (5298)
  n__take(x1,x2)	10[x2,x1]	w: (23652 + x2 + x1)
  #sel(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  #isLNat(x1)	0[]	w: (x1)
  sel(x1,x2)	8[]	w: (23656 + x2)
  #s(x1)	0[]	w: (x1)
  afterNth(x1,x2)	7[]	w: (max{11830 + x2, 0})
  n__cons(x1,x2)	5[]	w: (max{x2, x1})
  #isPLNat(x1)	0[]	w: (1)
  nil()	4	w: (11822)
  isLNat(x1)	8[]	w: (11825)
  n__sel(x1,x2)	8[]	w: (23656 + x2)
  #tail(x1)	0[]	w: (1)
  #splitAt(x1,x2)	0[x2]	w: (max{1 + x2, 0})
  #nil()	0	w: (0)
  n__tail(x1)	4[]	w: (4188 + x1)
  #afterNth(x1,x2)	0[x2]	w: (x2)
  n__isNatural(x1)	8[]	w: (11825)
  n__0()	0	w: (5298)
  n__afterNth(x1,x2)	7[]	w: (max{11830 + x2, 0})
  U61(x1,x2)	x2	w: (max{x2, 0})
  #U51(x1,x2,x3)	0[x3]	w: (max{x3, 0})
  n__fst(x1)	9[]	w: (11825 + x1)
  #U11(x1,x2,x3)	0[x3,x2]	w: (1 + x3 + x2)
  U31(x1,x2)	4[x2]	w: (max{1 + x2, 0})
  head(x1)	6[x1]	w: (11824 + x1)
  #snd(x1)	0[]	w: (x1)
  #U41(x1,x2)	0[]	w: (x2)
  cons(x1,x2)	5[]	w: (max{x2, x1})
  #natsFrom(x1)	0[]	w: (1)
  snd(x1)	6[x1]	w: (1 + x1)
  #U21(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  U81(x1,x2,x3,x4)	3[]	w: (max{11825 + x4, x3, 0})
  U82(x1,x2)	3[]	w: (max{x2, x1})
  tt()	1	w: (11823)
  n__and(x1,x2)	x2	w: (max{x2, 0})
  #U71(x1,x2)	0[]	w: (x2)
  #isNatural(x1)	0[x1]	w: (1 + x1)
  #pair(x1,x2)	0[x1,x2]	w: (max{1 + x2, 1 + x1})
  n__head(x1)	6[x1]	w: (11824 + x1)
  U51(x1,x2,x3)	7[x1,x3]	w: (max{23655 + x3, 0, 6 + x1})
  U41(x1,x2)	6[]	w: (max{x2, 0})
  #U31(x1,x2)	0[x2]	w: (max{x2, 0})
  #and(x1,x2)	0[x1]	w: (max{0, x1})
  #U91(x1,x2)	0[x2]	w: (x2)
  #U61(x1,x2)	0[x2]	w: (x2)
    USABLE RULES: { 1..71 }
    Removed DPs: #107
Number of SCCs: 2, DPs: 8
	SCC { #35 #84 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  #0()	0	w: (0)
  U21(x1,x2)	8[x2]	w: (max{2 + x2, 0})
  U11(x1,x2,x3)	8[x3]	w: (max{1510 + x3, 1510 + x2, 0})
  #cons(x1,x2)	0[x2]	w: (max{x2, 0})
  s(x1)	1[x1]	w: (x1)
  n__pair(x1,x2)	3[]	w: (max{5 + x2, 1 + x1})
  #take(x1,x2)	0[]	w: (x2)
  isPLNat(x1)	2[]	w: (1509)
  U91(x1,x2)	0[]	w: (max{1511 + x2, 0})
  #U101(x1,x2,x3)	0[x3,x1,x2]	w: (1 + x3 + x2 + x1)
  activate(x1)	x1	w: (x1)
  n__isLNat(x1)	2[]	w: (1509)
  #U82(x1,x2)	0[x1,x2]	w: (1 + x2 + x1)
  take(x1,x2)	10[]	w: (13336 + x2 + x1)
  U71(x1,x2)	5[]	w: (max{1504 + x2, 0})
  #U81(x1,x2,x3,x4)	8[x2]	w: (max{0, 1509 + x2, x1})
  and(x1,x2)	x2	w: (max{x2, 0})
  U101(x1,x2,x3)	9[x3]	w: (max{3013 + x3, 1507 + x2, 1505 + x1})
  pair(x1,x2)	3[]	w: (max{5 + x2, 1 + x1})
  fst(x1)	9[]	w: (1507 + x1)
  #activate(x1)	0[]	w: (x1)
  natsFrom(x1)	9[]	w: (1511 + x1)
  #head(x1)	0[]	w: (1)
  splitAt(x1,x2)	6[]	w: (max{1505 + x2, 0})
  #fst(x1)	0[]	w: (1)
  n__nil()	5	w: (1)
  n__natsFrom(x1)	9[]	w: (1511 + x1)
  isNatural(x1)	2[]	w: (1509)
  n__snd(x1)	8[]	w: (2 + x1)
  n__s(x1)	1[x1]	w: (x1)
  n__splitAt(x1,x2)	6[]	w: (max{1505 + x2, 0})
  tail(x1)	0[]	w: (1512 + x1)
  0()	0	w: (0)
  n__take(x1,x2)	10[]	w: (13336 + x2 + x1)
  #sel(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  #isLNat(x1)	0[]	w: (x1)
  sel(x1,x2)	10[x2]	w: (4530 + x2 + x1)
  #s(x1)	0[]	w: (x1)
  afterNth(x1,x2)	8[x2]	w: (max{1510 + x2, 1510 + x1})
  n__cons(x1,x2)	3[]	w: (max{x2, 1510 + x1})
  #isPLNat(x1)	0[]	w: (1)
  nil()	5	w: (1)
  isLNat(x1)	2[]	w: (1509)
  n__sel(x1,x2)	10[x2]	w: (4530 + x2 + x1)
  #tail(x1)	0[]	w: (1)
  #splitAt(x1,x2)	8[x1]	w: (max{0, 1509 + x1})
  #nil()	0	w: (0)
  n__tail(x1)	0[]	w: (1512 + x1)
  #afterNth(x1,x2)	0[x2]	w: (x2)
  n__isNatural(x1)	2[]	w: (1509)
  n__0()	0	w: (0)
  n__afterNth(x1,x2)	8[x2]	w: (max{1510 + x2, 1510 + x1})
  U61(x1,x2)	8[]	w: (max{4 + x2, 0})
  #U51(x1,x2,x3)	0[x3]	w: (max{x3, 1 + x2, 0})
  n__fst(x1)	9[]	w: (1507 + x1)
  #U11(x1,x2,x3)	0[x3]	w: (1 + x3 + x2 + x1)
  U31(x1,x2)	0[x2]	w: (max{1511 + x2, x1})
  head(x1)	1[]	w: (1510 + x1)
  #snd(x1)	0[]	w: (x1)
  #U41(x1,x2)	0[]	w: (x2)
  cons(x1,x2)	3[]	w: (max{x2, 1510 + x1})
  #natsFrom(x1)	0[]	w: (1)
  snd(x1)	8[]	w: (2 + x1)
  #U21(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  U81(x1,x2,x3,x4)	5[]	w: (max{1505 + x4, 3015 + x3, 0, x1})
  U82(x1,x2)	4[]	w: (max{3015 + x2, x1})
  tt()	2	w: (1)
  n__and(x1,x2)	x2	w: (max{x2, 0})
  #U71(x1,x2)	0[]	w: (x2)
  #isNatural(x1)	0[]	w: (1)
  #pair(x1,x2)	0[x1,x2]	w: (max{1 + x2, 1 + x1})
  n__head(x1)	1[]	w: (1510 + x1)
  U51(x1,x2,x3)	9[x1,x2]	w: (max{3021 + x3, 3021 + x2, 3020 + x1})
  U41(x1,x2)	8[]	w: (max{1511 + x2, 0})
  #U31(x1,x2)	0[x2]	w: (max{x2, 0})
  #and(x1,x2)	0[x1]	w: (max{0, x1})
  #U91(x1,x2)	0[x2]	w: (x2)
  #U61(x1,x2)	0[x2]	w: (x2)
    USABLE RULES: { 1..71 }
    Removed DPs: #84
Number of SCCs: 1, DPs: 6
	SCC { #29 #32 #33 #46 #54 #132 }
Sum... succeeded.
  #0()		w: (0)
  U21(x1,x2)		w: (x1)
  U11(x1,x2,x3)		w: (8538 + x2 + x1)
  #cons(x1,x2)		w: (0)
  s(x1)		w: (16693)
  n__pair(x1,x2)		w: (1 + x2 + x1)
  #take(x1,x2)		w: (3)
  isPLNat(x1)		w: (2 + x1)
  U91(x1,x2)		w: (4 + x2)
  #U101(x1,x2,x3)		w: (3)
  activate(x1)		w: (5)
  n__isLNat(x1)		w: (32072)
  #U82(x1,x2)		w: (3)
  take(x1,x2)		w: (1 + x2 + x1)
  U71(x1,x2)		w: (4)
  #U81(x1,x2,x3,x4)		w: (7)
  and(x1,x2)		w: (4)
  U101(x1,x2,x3)		w: (x2 + x1)
  pair(x1,x2)		w: (x2 + x1)
  fst(x1)		w: (3 + x1)
  #activate(x1)		w: (31851 + x1)
  natsFrom(x1)		w: (6)
  #head(x1)		w: (3)
  splitAt(x1,x2)		w: (x2)
  #fst(x1)		w: (3)
  n__nil()		w: (1)
  n__natsFrom(x1)		w: (32473)
  isNatural(x1)		w: (1)
  n__snd(x1)		w: (1)
  n__s(x1)		w: (16694 + x1)
  n__splitAt(x1,x2)		w: (1)
  tail(x1)		w: (6)
  0()		w: (6)
  n__take(x1,x2)		w: (2)
  #sel(x1,x2)		w: (3)
  #isLNat(x1)		w: (63923)
  sel(x1,x2)		w: (6)
  #s(x1)		w: (0)
  afterNth(x1,x2)		w: (x2)
  n__cons(x1,x2)		w: (9)
  #isPLNat(x1)		w: (3)
  nil()		w: (25155)
  isLNat(x1)		w: (6)
  n__sel(x1,x2)		w: (1 + x2 + x1)
  #tail(x1)		w: (3)
  #splitAt(x1,x2)		w: (8)
  #nil()		w: (0)
  n__tail(x1)		w: (7)
  #afterNth(x1,x2)		w: (3)
  n__isNatural(x1)		w: (x1)
  n__0()		w: (7)
  n__afterNth(x1,x2)		w: (1 + x1)
  U61(x1,x2)		w: (15695 + x1)
  #U51(x1,x2,x3)		w: (3)
  n__fst(x1)		w: (4 + x1)
  #U11(x1,x2,x3)		w: (3)
  U31(x1,x2)		w: (8 + x2 + x1)
  head(x1)		w: (11)
  #snd(x1)		w: (3)
  #U41(x1,x2)		w: (3)
  cons(x1,x2)		w: (8)
  #natsFrom(x1)		w: (3)
  snd(x1)		w: (15698 + x1)
  #U21(x1,x2)		w: (3)
  U81(x1,x2,x3,x4)		w: (6 + x3 + x2)
  U82(x1,x2)		w: (7)
  tt()		w: (7)
  n__and(x1,x2)		w: (5 + x2 + x1)
  #U71(x1,x2)		w: (3)
  #isNatural(x1)		w: (3)
  #pair(x1,x2)		w: (0)
  n__head(x1)		w: (12)
  U51(x1,x2,x3)		w: (3 + x2 + x1)
  U41(x1,x2)		w: (7 + x2)
  #U31(x1,x2)		w: (3)
  #and(x1,x2)		w: (31851 + x2)
  #U91(x1,x2)		w: (3)
  #U61(x1,x2)		w: (3)
    USABLE RULES: { }
    Removed DPs: #29 #32 #46
Number of SCCs: 1, DPs: 3
	SCC { #33 #54 #132 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.