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


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


YES
Input TRS:
    1: a__and(tt(),T) -> mark(T)
    2: a__isNatIList(IL) -> a__isNatList(IL)
    3: a__isNat(0()) -> tt()
    4: a__isNat(s(N)) -> a__isNat(N)
    5: a__isNat(length(L)) -> a__isNatList(L)
    6: a__isNatIList(zeros()) -> tt()
    7: a__isNatIList(cons(N,IL)) -> a__and(a__isNat(N),a__isNatIList(IL))
    8: a__isNatList(nil()) -> tt()
    9: a__isNatList(cons(N,L)) -> a__and(a__isNat(N),a__isNatList(L))
    10: a__isNatList(take(N,IL)) -> a__and(a__isNat(N),a__isNatIList(IL))
    11: a__zeros() -> cons(0(),zeros())
    12: a__take(0(),IL) -> a__uTake1(a__isNatIList(IL))
    13: a__uTake1(tt()) -> nil()
    14: a__take(s(M),cons(N,IL)) -> a__uTake2(a__and(a__isNat(M),a__and(a__isNat(N),a__isNatIList(IL))),M,N,IL)
    15: a__uTake2(tt(),M,N,IL) -> cons(mark(N),take(M,IL))
    16: a__length(cons(N,L)) -> a__uLength(a__and(a__isNat(N),a__isNatList(L)),L)
    17: a__uLength(tt(),L) -> s(a__length(mark(L)))
    18: mark(and(X1,X2)) -> a__and(mark(X1),mark(X2))
    19: mark(isNatIList(X)) -> a__isNatIList(X)
    20: mark(isNatList(X)) -> a__isNatList(X)
    21: mark(isNat(X)) -> a__isNat(X)
    22: mark(length(X)) -> a__length(mark(X))
    23: mark(zeros()) -> a__zeros()
    24: mark(take(X1,X2)) -> a__take(mark(X1),mark(X2))
    25: mark(uTake1(X)) -> a__uTake1(mark(X))
    26: mark(uTake2(X1,X2,X3,X4)) -> a__uTake2(mark(X1),X2,X3,X4)
    27: mark(uLength(X1,X2)) -> a__uLength(mark(X1),X2)
    28: mark(tt()) -> tt()
    29: mark(0()) -> 0()
    30: mark(s(X)) -> s(mark(X))
    31: mark(cons(X1,X2)) -> cons(mark(X1),X2)
    32: mark(nil()) -> nil()
    33: a__and(X1,X2) -> and(X1,X2)
    34: a__isNatIList(X) -> isNatIList(X)
    35: a__isNatList(X) -> isNatList(X)
    36: a__isNat(X) -> isNat(X)
    37: a__length(X) -> length(X)
    38: a__zeros() -> zeros()
    39: a__take(X1,X2) -> take(X1,X2)
    40: a__uTake1(X) -> uTake1(X)
    41: a__uTake2(X1,X2,X3,X4) -> uTake2(X1,X2,X3,X4)
    42: a__uLength(X1,X2) -> uLength(X1,X2)
Number of strict rules: 42
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #a__isNatIList(IL) -> #a__isNatList(IL)
   #2: #a__isNatList(cons(N,L)) -> #a__and(a__isNat(N),a__isNatList(L))
   #3: #a__isNatList(cons(N,L)) -> #a__isNat(N)
   #4: #a__isNatList(cons(N,L)) -> #a__isNatList(L)
   #5: #mark(take(X1,X2)) -> #a__take(mark(X1),mark(X2))
   #6: #mark(take(X1,X2)) -> #mark(X1)
   #7: #mark(take(X1,X2)) -> #mark(X2)
   #8: #mark(zeros()) -> #a__zeros()
   #9: #a__take(0(),IL) -> #a__uTake1(a__isNatIList(IL))
   #10: #a__take(0(),IL) -> #a__isNatIList(IL)
   #11: #mark(cons(X1,X2)) -> #mark(X1)
   #12: #a__take(s(M),cons(N,IL)) -> #a__uTake2(a__and(a__isNat(M),a__and(a__isNat(N),a__isNatIList(IL))),M,N,IL)
   #13: #a__take(s(M),cons(N,IL)) -> #a__and(a__isNat(M),a__and(a__isNat(N),a__isNatIList(IL)))
   #14: #a__take(s(M),cons(N,IL)) -> #a__isNat(M)
   #15: #a__take(s(M),cons(N,IL)) -> #a__and(a__isNat(N),a__isNatIList(IL))
   #16: #a__take(s(M),cons(N,IL)) -> #a__isNat(N)
   #17: #a__take(s(M),cons(N,IL)) -> #a__isNatIList(IL)
   #18: #mark(s(X)) -> #mark(X)
   #19: #mark(uTake1(X)) -> #a__uTake1(mark(X))
   #20: #mark(uTake1(X)) -> #mark(X)
   #21: #mark(isNatList(X)) -> #a__isNatList(X)
   #22: #a__isNatIList(cons(N,IL)) -> #a__and(a__isNat(N),a__isNatIList(IL))
   #23: #a__isNatIList(cons(N,IL)) -> #a__isNat(N)
   #24: #a__isNatIList(cons(N,IL)) -> #a__isNatIList(IL)
   #25: #a__isNatList(take(N,IL)) -> #a__and(a__isNat(N),a__isNatIList(IL))
   #26: #a__isNatList(take(N,IL)) -> #a__isNat(N)
   #27: #a__isNatList(take(N,IL)) -> #a__isNatIList(IL)
   #28: #a__isNat(length(L)) -> #a__isNatList(L)
   #29: #mark(length(X)) -> #a__length(mark(X))
   #30: #mark(length(X)) -> #mark(X)
   #31: #mark(uLength(X1,X2)) -> #a__uLength(mark(X1),X2)
   #32: #mark(uLength(X1,X2)) -> #mark(X1)
   #33: #a__uLength(tt(),L) -> #a__length(mark(L))
   #34: #a__uLength(tt(),L) -> #mark(L)
   #35: #mark(isNatIList(X)) -> #a__isNatIList(X)
   #36: #mark(uTake2(X1,X2,X3,X4)) -> #a__uTake2(mark(X1),X2,X3,X4)
   #37: #mark(uTake2(X1,X2,X3,X4)) -> #mark(X1)
   #38: #mark(isNat(X)) -> #a__isNat(X)
   #39: #a__length(cons(N,L)) -> #a__uLength(a__and(a__isNat(N),a__isNatList(L)),L)
   #40: #a__length(cons(N,L)) -> #a__and(a__isNat(N),a__isNatList(L))
   #41: #a__length(cons(N,L)) -> #a__isNat(N)
   #42: #a__length(cons(N,L)) -> #a__isNatList(L)
   #43: #a__and(tt(),T) -> #mark(T)
   #44: #a__uTake2(tt(),M,N,IL) -> #mark(N)
   #45: #a__isNat(s(N)) -> #a__isNat(N)
   #46: #mark(and(X1,X2)) -> #a__and(mark(X1),mark(X2))
   #47: #mark(and(X1,X2)) -> #mark(X1)
   #48: #mark(and(X1,X2)) -> #mark(X2)
Number of SCCs: 1, DPs: 45
	SCC { #1..7 #10..18 #20..48 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (23611 + x2)
  #a__uTake2(x1,x2,x3,x4)		w: (36229 + x3)
  isNatList(x1)		w: (0)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (0)
  #a__isNat(x1)		w: (23611)
  take(x1,x2)		w: (12620 + x2 + x1)
  and(x1,x2)		w: (x2 + x1)
  isNatIList(x1)		w: (0)
  zeros()		w: (12457)
  #a__take(x1,x2)		w: (36230 + x2)
  uTake2(x1,x2,x3,x4)		w: (12620 + x4 + x3 + x2 + x1)
  a__isNatList(x1)		w: (0)
  #a__isNatIList(x1)		w: (23611)
  uLength(x1,x2)		w: (x2 + x1)
  #mark(x1)		w: (23611 + x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (0)
  a__uTake2(x1,x2,x3,x4)		w: (12620 + x4 + x3 + x2 + x1)
  #a__and(x1,x2)		w: (23611 + x2)
  #a__zeros()		w: (0)
  nil()		w: (1)
  mark(x1)		w: (x1)
  #a__length(x1)		w: (23611 + x1)
  isNat(x1)		w: (0)
  a__uLength(x1,x2)		w: (x2 + x1)
  a__uTake1(x1)		w: (12620 + x1)
  #a__isNatList(x1)		w: (23611)
  cons(x1,x2)		w: (x2 + x1)
  a__take(x1,x2)		w: (12620 + x2 + x1)
  tt()		w: (0)
  uTake1(x1)		w: (12620 + x1)
  a__isNat(x1)		w: (0)
  a__and(x1,x2)		w: (x2 + x1)
  length(x1)		w: (x1)
  a__zeros()		w: (12457)
  a__length(x1)		w: (x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #5..7 #10 #12..17 #20 #36 #37 #44
Number of SCCs: 1, DPs: 31
	SCC { #1..4 #11 #18 #21..35 #38..43 #45..48 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405 + x2)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (0)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (0)
  #a__isNat(x1)		w: (77404)
  take(x1,x2)		w: (12619 + x2 + x1)
  and(x1,x2)		w: (x2 + x1)
  isNatIList(x1)		w: (0)
  zeros()		w: (13506)
  #a__take(x1,x2)		w: (36230 + x2)
  uTake2(x1,x2,x3,x4)		w: (12619 + x4 + x3 + x2 + x1)
  a__isNatList(x1)		w: (0)
  #a__isNatIList(x1)		w: (77404)
  uLength(x1,x2)		w: (12281 + x2 + x1)
  #mark(x1)		w: (77404 + x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (0)
  a__uTake2(x1,x2,x3,x4)		w: (12619 + x4 + x3 + x2 + x1)
  #a__and(x1,x2)		w: (77404 + x2)
  #a__zeros()		w: (0)
  nil()		w: (1)
  mark(x1)		w: (x1)
  #a__length(x1)		w: (77405 + x1)
  isNat(x1)		w: (0)
  a__uLength(x1,x2)		w: (12281 + x2 + x1)
  a__uTake1(x1)		w: (1)
  #a__isNatList(x1)		w: (77404)
  cons(x1,x2)		w: (x2 + x1)
  a__take(x1,x2)		w: (12619 + x2 + x1)
  tt()		w: (0)
  uTake1(x1)		w: (1)
  a__isNat(x1)		w: (0)
  a__and(x1,x2)		w: (x2 + x1)
  length(x1)		w: (12281 + x1)
  a__zeros()		w: (13506)
  a__length(x1)		w: (12281 + x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #29..32 #34 #40..42
Number of SCCs: 2, DPs: 23
	SCC { #33 #39 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... succeeded.
  #a__uLength(x1,x2)		w: (x2_2 + x1_1, 0)
  #a__uTake2(x1,x2,x3,x4)		w: (0, 0)
  isNatList(x1)		w: (8510, 8511 + x1_1)
  s(x1)		w: (7522 + x1_1, 7523 + x1_2)
  a__isNatIList(x1)		w: (16035 + x1_1, 16034 + x1_1)
  #a__isNat(x1)		w: (0, 0)
  take(x1,x2)		w: (7523 + x2_1, 32017 + x2_2 + x1_2)
  and(x1,x2)		w: (0, x2_2)
  isNatIList(x1)		w: (16035, 16034 + x1_1)
  zeros()		w: (0, 355)
  #a__take(x1,x2)		w: (0, 0)
  uTake2(x1,x2,x3,x4)		w: (39539, 39540 + x4_1 + x4_2 + x2_2)
  a__isNatList(x1)		w: (8512 + x1_1, 8511 + x1_1)
  #a__isNatIList(x1)		w: (0, 0)
  uLength(x1,x2)		w: (1, 15505 + x2_2 + x1_2)
  #mark(x1)		w: (0, 0)
  #a__uTake1(x1)		w: (0, 0)
  0()		w: (16034, 16033)
  a__uTake2(x1,x2,x3,x4)		w: (39540 + x4_1 + x4_2 + x2_2, 39540 + x4_1 + x4_2 + x2_2)
  #a__and(x1,x2)		w: (0, 0)
  #a__zeros()		w: (0, 0)
  nil()		w: (7523, 7522)
  mark(x1)		w: (1 + x1_2, x1_2)
  #a__length(x1)		w: (8513 + x1_2, 0)
  isNat(x1)		w: (1, x1_1 + x1_2)
  a__uLength(x1,x2)		w: (15504 + x2_2 + x1_1, 15505 + x2_2 + x1_2)
  a__uTake1(x1)		w: (7523, 7522)
  #a__isNatList(x1)		w: (0, 0)
  cons(x1,x2)		w: (x2_1 + x2_2, x2_1 + x2_2)
  a__take(x1,x2)		w: (32017 + x2_1 + x1_2, 32017 + x2_2 + x1_2)
  tt()		w: (16035, 16034)
  uTake1(x1)		w: (7523, 7522)
  a__isNat(x1)		w: (1 + x1_1, x1_1 + x1_2)
  a__and(x1,x2)		w: (1 + x2_2, x2_2)
  length(x1)		w: (8511 + x1_1, 24016 + x1_2)
  a__zeros()		w: (355, 355)
  a__length(x1)		w: (24016 + x1_1, 24016 + x1_2)
    USABLE RULES: { 1..42 }
    Removed DPs: #33 #39
Number of SCCs: 1, DPs: 21
	SCC { #1..4 #11 #18 #21..28 #35 #38 #43 #45..48 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (1 + x1)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (2 + x1)
  #a__isNat(x1)		w: (77401 + x1)
  take(x1,x2)		w: (7 + x2 + x1)
  and(x1,x2)		w: (x2 + x1)
  isNatIList(x1)		w: (2 + x1)
  zeros()		w: (1)
  #a__take(x1,x2)		w: (36230)
  uTake2(x1,x2,x3,x4)		w: (7 + x4 + x3 + x2)
  a__isNatList(x1)		w: (1 + x1)
  #a__isNatIList(x1)		w: (77404 + x1)
  uLength(x1,x2)		w: (3 + x2)
  #mark(x1)		w: (77402 + x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (0)
  a__uTake2(x1,x2,x3,x4)		w: (7 + x4 + x3 + x2)
  #a__and(x1,x2)		w: (77402 + x2)
  #a__zeros()		w: (0)
  nil()		w: (1)
  mark(x1)		w: (x1)
  #a__length(x1)		w: (77404)
  isNat(x1)		w: (x1)
  a__uLength(x1,x2)		w: (3 + x2)
  a__uTake1(x1)		w: (1)
  #a__isNatList(x1)		w: (77403 + x1)
  cons(x1,x2)		w: (x2 + x1)
  a__take(x1,x2)		w: (7 + x2 + x1)
  tt()		w: (0)
  uTake1(x1)		w: (1)
  a__isNat(x1)		w: (x1)
  a__and(x1,x2)		w: (x2 + x1)
  length(x1)		w: (3 + x1)
  a__zeros()		w: (1)
  a__length(x1)		w: (3 + x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #1 #3 #23 #25..28 #38
Number of SCCs: 2, DPs: 13
	SCC { #45 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (2 + x1)
  s(x1)		w: (1 + x1)
  a__isNatIList(x1)		w: (1 + x1)
  #a__isNat(x1)		w: (77401 + x1)
  take(x1,x2)		w: (3 + x2 + x1)
  and(x1,x2)		w: (x2)
  isNatIList(x1)		w: (1 + x1)
  zeros()		w: (0)
  #a__take(x1,x2)		w: (36230)
  uTake2(x1,x2,x3,x4)		w: (3 + x3 + x2)
  a__isNatList(x1)		w: (1)
  #a__isNatIList(x1)		w: (77404)
  uLength(x1,x2)		w: (21097 + x2)
  #mark(x1)		w: (77402)
  #a__uTake1(x1)		w: (0)
  0()		w: (0)
  a__uTake2(x1,x2,x3,x4)		w: (2 + x2)
  #a__and(x1,x2)		w: (77402)
  #a__zeros()		w: (0)
  nil()		w: (3)
  mark(x1)		w: (0)
  #a__length(x1)		w: (77404)
  isNat(x1)		w: (1)
  a__uLength(x1,x2)		w: (21096 + x1)
  a__uTake1(x1)		w: (x1)
  #a__isNatList(x1)		w: (77403)
  cons(x1,x2)		w: (x2 + x1)
  a__take(x1,x2)		w: (x1)
  tt()		w: (2)
  uTake1(x1)		w: (0)
  a__isNat(x1)		w: (2)
  a__and(x1,x2)		w: (x2)
  length(x1)		w: (1 + x1)
  a__zeros()		w: (0)
  a__length(x1)		w: (21097)
    USABLE RULES: { 3 11 23 29 33 34 36 38 40 }
    Removed DPs: #45
Number of SCCs: 1, DPs: 12
	SCC { #2 #4 #11 #18 #21 #22 #24 #35 #43 #46..48 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (0)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (0)
  #a__isNat(x1)		w: (77401)
  take(x1,x2)		w: (1 + x2)
  and(x1,x2)		w: (x2 + x1)
  isNatIList(x1)		w: (0)
  zeros()		w: (2)
  #a__take(x1,x2)		w: (36230)
  uTake2(x1,x2,x3,x4)		w: (2 + x3)
  a__isNatList(x1)		w: (0)
  #a__isNatIList(x1)		w: (28466)
  uLength(x1,x2)		w: (2561)
  #mark(x1)		w: (28466 + x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (1)
  a__uTake2(x1,x2,x3,x4)		w: (2 + x3)
  #a__and(x1,x2)		w: (28466 + x2)
  #a__zeros()		w: (0)
  nil()		w: (1)
  mark(x1)		w: (x1)
  #a__length(x1)		w: (77404)
  isNat(x1)		w: (0)
  a__uLength(x1,x2)		w: (2561)
  a__uTake1(x1)		w: (1)
  #a__isNatList(x1)		w: (28466)
  cons(x1,x2)		w: (1 + x1)
  a__take(x1,x2)		w: (1 + x2)
  tt()		w: (0)
  uTake1(x1)		w: (1)
  a__isNat(x1)		w: (0)
  a__and(x1,x2)		w: (x2 + x1)
  length(x1)		w: (2561)
  a__zeros()		w: (2)
  a__length(x1)		w: (2561)
    USABLE RULES: { 1..42 }
    Removed DPs: #11
Number of SCCs: 1, DPs: 11
	SCC { #2 #4 #18 #21 #22 #24 #35 #43 #46..48 }
Sum... Max... succeeded.
  #a__uLength(x1,x2)		w: (0)
  #a__uTake2(x1,x2,x3,x4)		w: (0)
  isNatList(x1)		w: (1 + x1)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (2 + x1)
  #a__isNat(x1)		w: (0)
  take(x1,x2)		w: (max{4 + x2, 4 + x1})
  and(x1,x2)		w: (max{x2, 1 + x1})
  isNatIList(x1)		w: (2 + x1)
  zeros()		w: (5)
  #a__take(x1,x2)		w: (0)
  uTake2(x1,x2,x3,x4)		w: (max{4 + x4, 4 + x3, 4 + x2, x1})
  a__isNatList(x1)		w: (1 + x1)
  #a__isNatIList(x1)		w: (13983 + x1)
  uLength(x1,x2)		w: (max{1 + x2, 0})
  #mark(x1)		w: (13981 + x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (4)
  a__uTake2(x1,x2,x3,x4)		w: (max{4 + x4, 4 + x3, 4 + x2, x1})
  #a__and(x1,x2)		w: (max{13981 + x2, 0})
  #a__zeros()		w: (0)
  nil()		w: (4)
  mark(x1)		w: (x1)
  #a__length(x1)		w: (1)
  isNat(x1)		w: (1 + x1)
  a__uLength(x1,x2)		w: (max{1 + x2, 0})
  a__uTake1(x1)		w: (4)
  #a__isNatList(x1)		w: (13982 + x1)
  cons(x1,x2)		w: (max{x2, 1 + x1})
  a__take(x1,x2)		w: (max{4 + x2, 4 + x1})
  tt()		w: (5)
  uTake1(x1)		w: (4)
  a__isNat(x1)		w: (1 + x1)
  a__and(x1,x2)		w: (max{x2, 1 + x1})
  length(x1)		w: (1 + x1)
  a__zeros()		w: (5)
  a__length(x1)		w: (1 + x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #47
Number of SCCs: 1, DPs: 10
	SCC { #2 #4 #18 #21 #22 #24 #35 #43 #46 #48 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (6920 + x1)
  s(x1)		w: (x1)
  a__isNatIList(x1)		w: (12002 + x1)
  #a__isNat(x1)		w: (77401)
  take(x1,x2)		w: (38982 + x2)
  and(x1,x2)		w: (3 + x2)
  isNatIList(x1)		w: (12001 + x1)
  zeros()		w: (32662)
  #a__take(x1,x2)		w: (36230)
  uTake2(x1,x2,x3,x4)		w: (38982 + x4)
  a__isNatList(x1)		w: (6920 + x1)
  #a__isNatIList(x1)		w: (12000 + x1)
  uLength(x1,x2)		w: (24897 + x2)
  #mark(x1)		w: (x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (32661)
  a__uTake2(x1,x2,x3,x4)		w: (38985 + x4)
  #a__and(x1,x2)		w: (x2)
  #a__zeros()		w: (0)
  nil()		w: (2)
  mark(x1)		w: (3 + x1)
  #a__length(x1)		w: (77404)
  isNat(x1)		w: (1 + x1)
  a__uLength(x1,x2)		w: (24900 + x2)
  a__uTake1(x1)		w: (26980 + x1)
  #a__isNatList(x1)		w: (6919 + x1)
  cons(x1,x2)		w: (3 + x2)
  a__take(x1,x2)		w: (38982 + x2)
  tt()		w: (1)
  uTake1(x1)		w: (26980 + x1)
  a__isNat(x1)		w: (1 + x1)
  a__and(x1,x2)		w: (3 + x2)
  length(x1)		w: (24897 + x1)
  a__zeros()		w: (32665)
  a__length(x1)		w: (24897 + x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #2 #4 #21 #22 #24 #35 #48
Number of SCCs: 1, DPs: 3
	SCC { #18 #43 #46 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... succeeded.
  #a__uLength(x1,x2)	0[]	w: (0)
  #a__uTake2(x1,x2,x3,x4)	0[x3]	w: (x3)
  isNatList(x1)	3[x1]	w: (29137 + x1)
  s(x1)	x1	w: (x1)
  a__isNatIList(x1)	5[x1]	w: (102132 + x1)
  #a__isNat(x1)	0[]	w: (x1)
  take(x1,x2)	0[x2]	w: (max{138633 + x2, 36498 + x1})
  and(x1,x2)	2[x2,x1]	w: (max{x2, 29135 + x1})
  isNatIList(x1)	5[x1]	w: (102132 + x1)
  zeros()	0	w: (204265)
  #a__take(x1,x2)	0[x2,x1]	w: (1 + x2 + x1)
  uTake2(x1,x2,x3,x4)	0[]	w: (max{138633 + x4, 240764 + x3, 36498 + x2, 0})
  a__isNatList(x1)	3[x1]	w: (29137 + x1)
  #a__isNatIList(x1)	0[]	w: (x1)
  uLength(x1,x2)	5[]	w: (max{65633 + x2, 36496 + x1})
  #mark(x1)	0[x1]	w: (x1)
  #a__uTake1(x1)	0[]	w: (1)
  0()	0	w: (102133)
  a__uTake2(x1,x2,x3,x4)	2[x4]	w: (max{138633 + x4, 240764 + x3, 36498 + x2, 0})
  #a__and(x1,x2)	1[x2]	w: (max{x2, 0})
  #a__zeros()	0	w: (0)
  nil()	4	w: (102135)
  mark(x1)	2[x1]	w: (x1)
  #a__length(x1)	0[]	w: (1)
  isNat(x1)	4[]	w: (36499 + x1)
  a__uLength(x1,x2)	5[]	w: (max{65633 + x2, 36496 + x1})
  a__uTake1(x1)	1[]	w: (138632)
  #a__isNatList(x1)	0[]	w: (x1)
  cons(x1,x2)	1[x2]	w: (max{x2, 102131 + x1})
  a__take(x1,x2)	2[x2]	w: (max{138633 + x2, 36498 + x1})
  tt()	3	w: (102134)
  uTake1(x1)	0[]	w: (138632)
  a__isNat(x1)	4[]	w: (36499 + x1)
  a__and(x1,x2)	2[x2,x1]	w: (max{x2, 29135 + x1})
  length(x1)	5[]	w: (65633 + x1)
  a__zeros()	2	w: (204265)
  a__length(x1)	5[]	w: (65633 + x1)
    USABLE RULES: { 1..42 }
    Removed DPs: #43 #46
Number of SCCs: 1, DPs: 1
	SCC { #18 }
Sum... succeeded.
  #a__uLength(x1,x2)		w: (77405)
  #a__uTake2(x1,x2,x3,x4)		w: (36229)
  isNatList(x1)		w: (11406)
  s(x1)		w: (2 + x1)
  a__isNatIList(x1)		w: (11404)
  #a__isNat(x1)		w: (77401)
  take(x1,x2)		w: (11405)
  and(x1,x2)		w: (11407)
  isNatIList(x1)		w: (11405)
  zeros()		w: (11405)
  #a__take(x1,x2)		w: (36230)
  uTake2(x1,x2,x3,x4)		w: (2)
  a__isNatList(x1)		w: (11405)
  #a__isNatIList(x1)		w: (12000)
  uLength(x1,x2)		w: (11406 + x2 + x1)
  #mark(x1)		w: (x1)
  #a__uTake1(x1)		w: (0)
  0()		w: (11404)
  a__uTake2(x1,x2,x3,x4)		w: (1 + x4 + x1)
  #a__and(x1,x2)		w: (0)
  #a__zeros()		w: (0)
  nil()		w: (11408)
  mark(x1)		w: (11403)
  #a__length(x1)		w: (77404)
  isNat(x1)		w: (11405 + x1)
  a__uLength(x1,x2)		w: (11405)
  a__uTake1(x1)		w: (1 + x1)
  #a__isNatList(x1)		w: (6919)
  cons(x1,x2)		w: (11408)
  a__take(x1,x2)		w: (11404)
  tt()		w: (11406)
  uTake1(x1)		w: (2)
  a__isNat(x1)		w: (11404)
  a__and(x1,x2)		w: (11406)
  length(x1)		w: (11405)
  a__zeros()		w: (11404)
  a__length(x1)		w: (11404)
    USABLE RULES: { }
    Removed DPs: #18
Number of SCCs: 0, DPs: 0