/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(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 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__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 }
Sum... Max... succeeded.
  #0()		w: (0)
  U21(x1,x2)		w: (max{x2, 0})
  U11(x1,x2,x3)		w: (max{42 + x3, 30 + x2, 29 + x1})
  #cons(x1,x2)		w: (0)
  s(x1)		w: (x1)
  n__pair(x1,x2)		w: (max{x2, 2 + x1})
  #take(x1,x2)		w: (max{32 + x2, 34 + x1})
  isPLNat(x1)		w: (8 + x1)
  U91(x1,x2)		w: (max{x2, 0})
  #U101(x1,x2,x3)		w: (max{31 + x3, 33 + x2, 23 + x1})
  activate(x1)		w: (x1)
  n__isLNat(x1)		w: (7 + x1)
  #U82(x1,x2)		w: (max{8 + x2, x1})
  take(x1,x2)		w: (max{15978 + x2, 35 + x1})
  U71(x1,x2)		w: (max{11 + x2, 12 + x1})
  #U81(x1,x2,x3,x4)		w: (max{22 + x4, 8 + x3, 10 + x2, 2 + x1})
  and(x1,x2)		w: (max{x2, 2 + x1})
  U101(x1,x2,x3)		w: (max{36 + x3, 18 + x2, 29 + x1})
  pair(x1,x2)		w: (max{x2, 2 + x1})
  fst(x1)		w: (8 + x1)
  #activate(x1)		w: (x1)
  natsFrom(x1)		w: (11 + x1)
  #head(x1)		w: (8 + x1)
  splitAt(x1,x2)		w: (max{22 + x2, 10 + x1})
  #fst(x1)		w: (8 + x1)
  n__nil()		w: (10)
  n__natsFrom(x1)		w: (11 + x1)
  isNatural(x1)		w: (x1)
  n__snd(x1)		w: (20 + x1)
  n__s(x1)		w: (x1)
  n__splitAt(x1,x2)		w: (max{22 + x2, 10 + x1})
  tail(x1)		w: (11 + x1)
  0()		w: (0)
  n__take(x1,x2)		w: (max{15978 + x2, 35 + x1})
  #sel(x1,x2)		w: (max{46927 + x2, 46929 + x1})
  #isLNat(x1)		w: (7 + x1)
  sel(x1,x2)		w: (max{46928 + x2, 46930 + x1})
  #s(x1)		w: (0)
  afterNth(x1,x2)		w: (max{18046 + x2, 35 + x1})
  n__cons(x1,x2)		w: (max{x2, 4 + x1})
  #isPLNat(x1)		w: (14 + x1)
  nil()		w: (10)
  isLNat(x1)		w: (7 + x1)
  n__sel(x1,x2)		w: (max{46928 + x2, 46930 + x1})
  #tail(x1)		w: (10 + x1)
  #splitAt(x1,x2)		w: (max{22 + x2, 10 + x1})
  #nil()		w: (0)
  n__tail(x1)		w: (11 + x1)
  #afterNth(x1,x2)		w: (max{34 + x2, 23 + x1})
  n__0()		w: (0)
  n__afterNth(x1,x2)		w: (max{18046 + x2, 35 + x1})
  U61(x1,x2)		w: (max{1 + x2, 12 + x1})
  #U51(x1,x2,x3)		w: (max{18055 + x3, 46928 + x2, 0})
  n__fst(x1)		w: (8 + x1)
  #U11(x1,x2,x3)		w: (max{33 + x3, 21 + x2, 17 + x1})
  U31(x1,x2)		w: (max{x2, 0})
  head(x1)		w: (9 + x1)
  #snd(x1)		w: (10 + x1)
  #U41(x1,x2)		w: (max{1 + x2, 0})
  cons(x1,x2)		w: (max{x2, 4 + x1})
  #natsFrom(x1)		w: (10 + x1)
  snd(x1)		w: (20 + x1)
  #U21(x1,x2)		w: (max{9 + x2, 0})
  U81(x1,x2,x3,x4)		w: (max{22 + x4, 9 + x3, 10 + x2, 8 + x1})
  U82(x1,x2)		w: (max{9 + x2, x1})
  tt()		w: (0)
  n__and(x1,x2)		w: (max{x2, 2 + x1})
  #U71(x1,x2)		w: (max{11 + x2, 1 + x1})
  #isNatural(x1)		w: (9 + x1)
  #pair(x1,x2)		w: (0)
  n__head(x1)		w: (9 + x1)
  U51(x1,x2,x3)		w: (max{18055 + x3, 44 + x2, 1 + x1})
  U41(x1,x2)		w: (max{11 + x2, 3 + x1})
  #U31(x1,x2)		w: (max{11 + x2, 0})
  #and(x1,x2)		w: (max{x2, 2 + x1})
  #U91(x1,x2)		w: (max{x2, 0})
  #U61(x1,x2)		w: (max{1 + x2, 2 + x1})
    USABLE RULES: { 1..69 }
    Removed DPs: #1..13 #15 #17..22 #28..30 #33..46 #48..54 #57 #59 #60 #62 #64..71 #73..92 #94 #96..105 #109..114 #116..118
Number of SCCs: 3, DPs: 7
	SCC { #93 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  #0()	0	w: (0)
  U21(x1,x2)	1[x1]	w: (max{15047 + x2, 31987 + x1})
  U11(x1,x2,x3)	11[]	w: (max{79316 + x3, 79315 + x2, 79315 + x1})
  #cons(x1,x2)	0[x1]	w: (max{0, x1})
  s(x1)	13[x1]	w: (x1)
  n__pair(x1,x2)	7[x2]	w: (max{32426 + x2, 31988 + x1})
  #take(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  isPLNat(x1)	5[]	w: (0)
  U91(x1,x2)	12[x2]	w: (max{x2, 0})
  #U101(x1,x2,x3)	0[x3,x1]	w: (1 + x3 + x1)
  activate(x1)	x1	w: (x1)
  n__isLNat(x1)	5[]	w: (0)
  #U82(x1,x2)	0[x1]	w: (max{0, 1 + x1})
  take(x1,x2)	3[x1,x2]	w: (78881 + x2 + x1)
  U71(x1,x2)	7[x2]	w: (max{32426 + x2, 64416 + x1})
  #U81(x1,x2,x3,x4)	0[x4]	w: (max{x4, 0})
  and(x1,x2)	x2	w: (max{x2, 0})
  U101(x1,x2,x3)	2[]	w: (max{78877 + x3, 78880 + x2, 78880 + x1})
  pair(x1,x2)	7[x2]	w: (max{32426 + x2, 31988 + x1})
  fst(x1)	1[x1]	w: (1 + x1)
  #activate(x1)	0[]	w: (1)
  natsFrom(x1)	14[]	w: (14463 + x1)
  #head(x1)	0[]	w: (1)
  splitAt(x1,x2)	10[x2]	w: (max{64417 + x2, 78878 + x1})
  #fst(x1)	0[]	w: (1)
  n__nil()	7	w: (32427)
  n__natsFrom(x1)	14[]	w: (14463 + x1)
  isNatural(x1)	5[]	w: (0)
  n__snd(x1)	11[]	w: (436 + x1)
  n__s(x1)	13[x1]	w: (x1)
  n__splitAt(x1,x2)	10[x2]	w: (max{64417 + x2, 78878 + x1})
  tail(x1)	13[x1]	w: (32582 + x1)
  0()	13	w: (64417)
  n__take(x1,x2)	3[x1,x2]	w: (78881 + x2 + x1)
  #sel(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  #isLNat(x1)	0[]	w: (1)
  sel(x1,x2)	15[]	w: (79321 + x2 + x1)
  #s(x1)	0[]	w: (x1)
  afterNth(x1,x2)	13[x2]	w: (max{79317 + x2, 79315 + x1})
  n__cons(x1,x2)	6[x1]	w: (max{x2, 14463 + x1})
  #isPLNat(x1)	0[]	w: (1)
  nil()	7	w: (32427)
  isLNat(x1)	5[]	w: (0)
  n__sel(x1,x2)	15[]	w: (79321 + x2 + x1)
  #tail(x1)	0[]	w: (1)
  #splitAt(x1,x2)	0[x1]	w: (max{0, 1 + x1})
  #nil()	0	w: (0)
  n__tail(x1)	13[x1]	w: (32582 + x1)
  #afterNth(x1,x2)	0[]	w: (x2)
  n__0()	13	w: (64417)
  n__afterNth(x1,x2)	13[x2]	w: (max{79317 + x2, 79315 + x1})
  U61(x1,x2)	10[x2]	w: (max{32425 + x2, 32425 + x1})
  #U51(x1,x2,x3)	0[x2,x3,x1]	w: (1 + x3 + x2 + x1)
  n__fst(x1)	1[x1]	w: (1 + x1)
  #U11(x1,x2,x3)	0[]	w: (1 + x2 + x1)
  U31(x1,x2)	14[]	w: (max{3 + x2, 0})
  head(x1)	14[]	w: (2 + x1)
  #snd(x1)	0[]	w: (1)
  #U41(x1,x2)	0[x1,x2]	w: (1 + x2 + x1)
  cons(x1,x2)	6[x1]	w: (max{x2, 14463 + x1})
  #natsFrom(x1)	0[]	w: (x1)
  snd(x1)	11[]	w: (436 + x1)
  #U21(x1,x2)	0[x1]	w: (x1)
  U81(x1,x2,x3,x4)	9[x4]	w: (max{64417 + x4, 78879 + x3, 78878 + x2, 0})
  U82(x1,x2)	8[]	w: (max{46452 + x2, x1})
  tt()	0	w: (0)
  n__and(x1,x2)	x2	w: (max{x2, 0})
  #U71(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  #isNatural(x1)	0[x1]	w: (x1)
  #pair(x1,x2)	0[x1,x2]	w: (max{x2, 1 + x1})
  n__head(x1)	14[]	w: (2 + x1)
  U51(x1,x2,x3)	14[]	w: (max{79320 + x3, 79320 + x2, 79320 + x1})
  U41(x1,x2)	13[x2]	w: (max{14463 + x2, 0})
  #U31(x1,x2)	0[]	w: (1)
  #and(x1,x2)	0[x1,x2]	w: (max{x2, 1 + x1})
  #U91(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  #U61(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
    USABLE RULES: { 1..69 }
    Removed DPs: #93
Number of SCCs: 2, DPs: 6
	SCC { #25 #95 #106 #115 }
Sum... succeeded.
  #0()		w: (0)
  U21(x1,x2)		w: (18 + x1)
  U11(x1,x2,x3)		w: (9 + x3 + x2 + x1)
  #cons(x1,x2)		w: (0)
  s(x1)		w: (1)
  n__pair(x1,x2)		w: (1)
  #take(x1,x2)		w: (4)
  isPLNat(x1)		w: (3 + x1)
  U91(x1,x2)		w: (5)
  #U101(x1,x2,x3)		w: (3)
  activate(x1)		w: (6 + x1)
  n__isLNat(x1)		w: (1)
  #U82(x1,x2)		w: (4)
  take(x1,x2)		w: (x2 + x1)
  U71(x1,x2)		w: (5 + x1)
  #U81(x1,x2,x3,x4)		w: (4)
  and(x1,x2)		w: (0)
  U101(x1,x2,x3)		w: (1 + x2 + x1)
  pair(x1,x2)		w: (8 + x2 + x1)
  fst(x1)		w: (9 + x1)
  #activate(x1)		w: (x1)
  natsFrom(x1)		w: (8 + x1)
  #head(x1)		w: (4)
  splitAt(x1,x2)		w: (8 + x2 + x1)
  #fst(x1)		w: (4)
  n__nil()		w: (1)
  n__natsFrom(x1)		w: (1)
  isNatural(x1)		w: (9)
  n__snd(x1)		w: (22775)
  n__s(x1)		w: (24327 + x1)
  n__splitAt(x1,x2)		w: (9 + x2)
  tail(x1)		w: (x1)
  0()		w: (1)
  n__take(x1,x2)		w: (6812 + x2 + x1)
  #sel(x1,x2)		w: (4)
  #isLNat(x1)		w: (1)
  sel(x1,x2)		w: (x1)
  #s(x1)		w: (0)
  afterNth(x1,x2)		w: (8)
  n__cons(x1,x2)		w: (5 + x2)
  #isPLNat(x1)		w: (4)
  nil()		w: (8)
  isLNat(x1)		w: (8)
  n__sel(x1,x2)		w: (12701 + x2 + x1)
  #tail(x1)		w: (4)
  #splitAt(x1,x2)		w: (4)
  #nil()		w: (0)
  n__tail(x1)		w: (15620)
  #afterNth(x1,x2)		w: (4)
  n__0()		w: (14924)
  n__afterNth(x1,x2)		w: (1 + x2 + x1)
  U61(x1,x2)		w: (0)
  #U51(x1,x2,x3)		w: (3)
  n__fst(x1)		w: (10)
  #U11(x1,x2,x3)		w: (4)
  U31(x1,x2)		w: (13)
  head(x1)		w: (8 + x1)
  #snd(x1)		w: (4)
  #U41(x1,x2)		w: (4)
  cons(x1,x2)		w: (4 + x1)
  #natsFrom(x1)		w: (4)
  snd(x1)		w: (x1)
  #U21(x1,x2)		w: (4)
  U81(x1,x2,x3,x4)		w: (28 + x2)
  U82(x1,x2)		w: (9 + x1)
  tt()		w: (10)
  n__and(x1,x2)		w: (1 + x2)
  #U71(x1,x2)		w: (4)
  #isNatural(x1)		w: (4)
  #pair(x1,x2)		w: (0)
  n__head(x1)		w: (1)
  U51(x1,x2,x3)		w: (1 + x2 + x1)
  U41(x1,x2)		w: (9 + x2)
  #U31(x1,x2)		w: (4)
  #and(x1,x2)		w: (x2)
  #U91(x1,x2)		w: (3)
  #U61(x1,x2)		w: (3)
    USABLE RULES: { }
    Removed DPs: #95
Number of SCCs: 2, DPs: 5
	SCC { #25 #106 #115 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.