Input TRS:
    1: active(zeros()) -> mark(cons(0(),zeros()))
    2: active(U11(tt())) -> mark(tt())
    3: active(U21(tt())) -> mark(tt())
    4: active(U31(tt())) -> mark(tt())
    5: active(U41(tt(),V2)) -> mark(U42(isNatIList(V2)))
    6: active(U42(tt())) -> mark(tt())
    7: active(U51(tt(),V2)) -> mark(U52(isNatList(V2)))
    8: active(U52(tt())) -> mark(tt())
    9: active(U61(tt(),L,N)) -> mark(U62(isNat(N),L))
    10: active(U62(tt(),L)) -> mark(s(length(L)))
    11: active(isNat(0())) -> mark(tt())
    12: active(isNat(length(V1))) -> mark(U11(isNatList(V1)))
    13: active(isNat(s(V1))) -> mark(U21(isNat(V1)))
    14: active(isNatIList(V)) -> mark(U31(isNatList(V)))
    15: active(isNatIList(zeros())) -> mark(tt())
    16: active(isNatIList(cons(V1,V2))) -> mark(U41(isNat(V1),V2))
    17: active(isNatList(nil())) -> mark(tt())
    18: active(isNatList(cons(V1,V2))) -> mark(U51(isNat(V1),V2))
    19: active(length(nil())) -> mark(0())
    20: active(length(cons(N,L))) -> mark(U61(isNatList(L),L,N))
    21: active(cons(X1,X2)) -> cons(active(X1),X2)
    22: active(U11(X)) -> U11(active(X))
    23: active(U21(X)) -> U21(active(X))
    24: active(U31(X)) -> U31(active(X))
    25: active(U41(X1,X2)) -> U41(active(X1),X2)
    26: active(U42(X)) -> U42(active(X))
    27: active(U51(X1,X2)) -> U51(active(X1),X2)
    28: active(U52(X)) -> U52(active(X))
    29: active(U61(X1,X2,X3)) -> U61(active(X1),X2,X3)
    30: active(U62(X1,X2)) -> U62(active(X1),X2)
    31: active(s(X)) -> s(active(X))
    32: active(length(X)) -> length(active(X))
    33: cons(mark(X1),X2) -> mark(cons(X1,X2))
    34: U11(mark(X)) -> mark(U11(X))
    35: U21(mark(X)) -> mark(U21(X))
    36: U31(mark(X)) -> mark(U31(X))
    37: U41(mark(X1),X2) -> mark(U41(X1,X2))
    38: U42(mark(X)) -> mark(U42(X))
    39: U51(mark(X1),X2) -> mark(U51(X1,X2))
    40: U52(mark(X)) -> mark(U52(X))
    41: U61(mark(X1),X2,X3) -> mark(U61(X1,X2,X3))
    42: U62(mark(X1),X2) -> mark(U62(X1,X2))
    43: s(mark(X)) -> mark(s(X))
    44: length(mark(X)) -> mark(length(X))
    45: proper(zeros()) -> ok(zeros())
    46: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
    47: proper(0()) -> ok(0())
    48: proper(U11(X)) -> U11(proper(X))
    49: proper(tt()) -> ok(tt())
    50: proper(U21(X)) -> U21(proper(X))
    51: proper(U31(X)) -> U31(proper(X))
    52: proper(U41(X1,X2)) -> U41(proper(X1),proper(X2))
    53: proper(U42(X)) -> U42(proper(X))
    54: proper(isNatIList(X)) -> isNatIList(proper(X))
    55: proper(U51(X1,X2)) -> U51(proper(X1),proper(X2))
    56: proper(U52(X)) -> U52(proper(X))
    57: proper(isNatList(X)) -> isNatList(proper(X))
    58: proper(U61(X1,X2,X3)) -> U61(proper(X1),proper(X2),proper(X3))
    59: proper(U62(X1,X2)) -> U62(proper(X1),proper(X2))
    60: proper(isNat(X)) -> isNat(proper(X))
    61: proper(s(X)) -> s(proper(X))
    62: proper(length(X)) -> length(proper(X))
    63: proper(nil()) -> ok(nil())
    64: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
    65: U11(ok(X)) -> ok(U11(X))
    66: U21(ok(X)) -> ok(U21(X))
    67: U31(ok(X)) -> ok(U31(X))
    68: U41(ok(X1),ok(X2)) -> ok(U41(X1,X2))
    69: U42(ok(X)) -> ok(U42(X))
    70: isNatIList(ok(X)) -> ok(isNatIList(X))
    71: U51(ok(X1),ok(X2)) -> ok(U51(X1,X2))
    72: U52(ok(X)) -> ok(U52(X))
    73: isNatList(ok(X)) -> ok(isNatList(X))
    74: U61(ok(X1),ok(X2),ok(X3)) -> ok(U61(X1,X2,X3))
    75: U62(ok(X1),ok(X2)) -> ok(U62(X1,X2))
    76: isNat(ok(X)) -> ok(isNat(X))
    77: s(ok(X)) -> ok(s(X))
    78: length(ok(X)) -> ok(length(X))
    79: top(mark(X)) -> top(proper(X))
    80: top(ok(X)) -> top(active(X))
Number of strict rules: 80
Direct Order(PosReal,>,Poly) ... removes: 4 15 19 14 12 2
   U21(x1)	weight: x1
isNatList(x1)	weight: x1
   U11(x1)	weight: (/ 29845 2) + x1
     s(x1)	weight: x1
   U42(x1)	weight: x1
   top(x1)	weight: x1
isNatIList(x1)	weight: 24324 + x1
 zeros()	weight: 0
proper(x1)	weight: x1
    ok(x1)	weight: x1
     0()	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 27623 + x1 + x2
  mark(x1)	weight: x1
 isNat(x1)	weight: x1
   U52(x1)	weight: x1
   U61(x1,x2,x3)	weight: 27623 + x1 + x2 + x3
active(x1)	weight: x1
   U31(x1)	weight: (/ 48647 2) + x1
  cons(x1,x2)	weight: x1 + 2 * x2
    tt()	weight: 0
   U51(x1,x2)	weight: x1 + x2
length(x1)	weight: 27623 + x1
   U41(x1,x2)	weight: 24324 + x1 + x2
Number of strict rules: 74
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #s(mark(X)) -> #s(X)
   #2: #active(U61(X1,X2,X3)) -> #U61(active(X1),X2,X3)
   #3: #active(U61(X1,X2,X3)) -> #active(X1)
   #4: #U21(mark(X)) -> #U21(X)
   #5: #U21(ok(X)) -> #U21(X)
   #6: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2))
   #7: #proper(cons(X1,X2)) -> #proper(X1)
   #8: #proper(cons(X1,X2)) -> #proper(X2)
   #9: #U62(mark(X1),X2) -> #U62(X1,X2)
   #10: #U61(mark(X1),X2,X3) -> #U61(X1,X2,X3)
   #11: #U41(mark(X1),X2) -> #U41(X1,X2)
   #12: #isNatList(ok(X)) -> #isNatList(X)
   #13: #proper(U42(X)) -> #U42(proper(X))
   #14: #proper(U42(X)) -> #proper(X)
   #15: #U51(ok(X1),ok(X2)) -> #U51(X1,X2)
   #16: #proper(U11(X)) -> #U11(proper(X))
   #17: #proper(U11(X)) -> #proper(X)
   #18: #U62(ok(X1),ok(X2)) -> #U62(X1,X2)
   #19: #U61(ok(X1),ok(X2),ok(X3)) -> #U61(X1,X2,X3)
   #20: #proper(U61(X1,X2,X3)) -> #U61(proper(X1),proper(X2),proper(X3))
   #21: #proper(U61(X1,X2,X3)) -> #proper(X1)
   #22: #proper(U61(X1,X2,X3)) -> #proper(X2)
   #23: #proper(U61(X1,X2,X3)) -> #proper(X3)
   #24: #proper(s(X)) -> #s(proper(X))
   #25: #proper(s(X)) -> #proper(X)
   #26: #U42(mark(X)) -> #U42(X)
   #27: #proper(U62(X1,X2)) -> #U62(proper(X1),proper(X2))
   #28: #proper(U62(X1,X2)) -> #proper(X1)
   #29: #proper(U62(X1,X2)) -> #proper(X2)
   #30: #proper(U51(X1,X2)) -> #U51(proper(X1),proper(X2))
   #31: #proper(U51(X1,X2)) -> #proper(X1)
   #32: #proper(U51(X1,X2)) -> #proper(X2)
   #33: #U31(ok(X)) -> #U31(X)
   #34: #U52(mark(X)) -> #U52(X)
   #35: #proper(U31(X)) -> #U31(proper(X))
   #36: #proper(U31(X)) -> #proper(X)
   #37: #active(isNat(s(V1))) -> #U21(isNat(V1))
   #38: #active(isNat(s(V1))) -> #isNat(V1)
   #39: #active(U61(tt(),L,N)) -> #U62(isNat(N),L)
   #40: #active(U61(tt(),L,N)) -> #isNat(N)
   #41: #proper(isNatList(X)) -> #isNatList(proper(X))
   #42: #proper(isNatList(X)) -> #proper(X)
   #43: #isNat(ok(X)) -> #isNat(X)
   #44: #active(U31(X)) -> #U31(active(X))
   #45: #active(U31(X)) -> #active(X)
   #46: #isNatIList(ok(X)) -> #isNatIList(X)
   #47: #active(U21(X)) -> #U21(active(X))
   #48: #active(U21(X)) -> #active(X)
   #49: #length(ok(X)) -> #length(X)
   #50: #U42(ok(X)) -> #U42(X)
   #51: #active(s(X)) -> #s(active(X))
   #52: #active(s(X)) -> #active(X)
   #53: #top(mark(X)) -> #top(proper(X))
   #54: #top(mark(X)) -> #proper(X)
   #55: #proper(U52(X)) -> #U52(proper(X))
   #56: #proper(U52(X)) -> #proper(X)
   #57: #proper(length(X)) -> #length(proper(X))
   #58: #proper(length(X)) -> #proper(X)
   #59: #active(U62(X1,X2)) -> #U62(active(X1),X2)
   #60: #active(U62(X1,X2)) -> #active(X1)
   #61: #proper(U41(X1,X2)) -> #U41(proper(X1),proper(X2))
   #62: #proper(U41(X1,X2)) -> #proper(X1)
   #63: #proper(U41(X1,X2)) -> #proper(X2)
   #64: #active(U41(X1,X2)) -> #U41(active(X1),X2)
   #65: #active(U41(X1,X2)) -> #active(X1)
   #66: #active(length(cons(N,L))) -> #U61(isNatList(L),L,N)
   #67: #active(length(cons(N,L))) -> #isNatList(L)
   #68: #active(U51(tt(),V2)) -> #U52(isNatList(V2))
   #69: #active(U51(tt(),V2)) -> #isNatList(V2)
   #70: #U51(mark(X1),X2) -> #U51(X1,X2)
   #71: #active(U62(tt(),L)) -> #s(length(L))
   #72: #active(U62(tt(),L)) -> #length(L)
   #73: #cons(ok(X1),ok(X2)) -> #cons(X1,X2)
   #74: #cons(mark(X1),X2) -> #cons(X1,X2)
   #75: #U52(ok(X)) -> #U52(X)
   #76: #active(U41(tt(),V2)) -> #U42(isNatIList(V2))
   #77: #active(U41(tt(),V2)) -> #isNatIList(V2)
   #78: #length(mark(X)) -> #length(X)
   #79: #U11(ok(X)) -> #U11(X)
   #80: #active(U52(X)) -> #U52(active(X))
   #81: #active(U52(X)) -> #active(X)
   #82: #active(U11(X)) -> #U11(active(X))
   #83: #active(U11(X)) -> #active(X)
   #84: #U11(mark(X)) -> #U11(X)
   #85: #active(U51(X1,X2)) -> #U51(active(X1),X2)
   #86: #active(U51(X1,X2)) -> #active(X1)
   #87: #proper(isNat(X)) -> #isNat(proper(X))
   #88: #proper(isNat(X)) -> #proper(X)
   #89: #active(length(X)) -> #length(active(X))
   #90: #active(length(X)) -> #active(X)
   #91: #active(U42(X)) -> #U42(active(X))
   #92: #active(U42(X)) -> #active(X)
   #93: #U41(ok(X1),ok(X2)) -> #U41(X1,X2)
   #94: #U31(mark(X)) -> #U31(X)
   #95: #active(cons(X1,X2)) -> #cons(active(X1),X2)
   #96: #active(cons(X1,X2)) -> #active(X1)
   #97: #active(isNatIList(cons(V1,V2))) -> #U41(isNat(V1),V2)
   #98: #active(isNatIList(cons(V1,V2))) -> #isNat(V1)
   #99: #s(ok(X)) -> #s(X)
   #100: #active(zeros()) -> #cons(0(),zeros())
   #101: #proper(isNatIList(X)) -> #isNatIList(proper(X))
   #102: #proper(isNatIList(X)) -> #proper(X)
   #103: #top(ok(X)) -> #top(active(X))
   #104: #top(ok(X)) -> #active(X)
   #105: #proper(U21(X)) -> #U21(proper(X))
   #106: #proper(U21(X)) -> #proper(X)
   #107: #active(isNatList(cons(V1,V2))) -> #U51(isNat(V1),V2)
   #108: #active(isNatList(cons(V1,V2))) -> #isNat(V1)
Number of SCCs: 18, DPs: 62, edges: 640
	SCC { #43 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: x1
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: 0
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #43
Number of SCCs: 17, DPs: 61, edges: 639
	SCC { #46 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: 0
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: x1
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #46
Number of SCCs: 16, DPs: 60, edges: 638
	SCC { #12 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: x1
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: 0
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #12
Number of SCCs: 15, DPs: 59, edges: 637
	SCC { #26 #50 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: x1
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #26 #50
Number of SCCs: 14, DPs: 57, edges: 633
	SCC { #49 #78 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: x1
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #49 #78
Number of SCCs: 13, DPs: 55, edges: 629
	SCC { #79 #84 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: x1
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #79 #84
Number of SCCs: 12, DPs: 53, edges: 625
	SCC { #34 #75 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: x1
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #34 #75
Number of SCCs: 11, DPs: 51, edges: 621
	SCC { #1 #99 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: x1
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #1 #99
Number of SCCs: 10, DPs: 49, edges: 617
	SCC { #4 #5 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: x1
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: 0
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #4 #5
Number of SCCs: 9, DPs: 47, edges: 613
	SCC { #33 #94 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   U21(x1)	weight: 0
isNatList(x1)	weight: 0
   U11(x1)	weight: 0
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
#isNat(x1)	weight: 0
   U42(x1)	weight: 0
   top(x1)	weight: 0
isNatIList(x1)	weight: 0
 #top(x1)	weight: 0
 zeros()	weight: 0
 #U52(x1)	weight: 0
 #U42(x1)	weight: 0
proper(x1)	weight: 0
 #U62(x1,x2)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
     0()	weight: 0
#isNatList(x1)	weight: 0
   #s(x1)	weight: 0
   nil()	weight: 0
   U62(x1,x2)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#proper(x1)	weight: 0
 isNat(x1)	weight: 0
   U52(x1)	weight: 0
   U61(x1,x2,x3)	weight: 0
 #U51(x1,x2)	weight: 0
 #U11(x1)	weight: 0
active(x1)	weight: 0
   U31(x1)	weight: 0
 #U41(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
#isNatIList(x1)	weight: 0
 #U21(x1)	weight: 0
    tt()	weight: 0
   U51(x1,x2)	weight: 0
length(x1)	weight: 0
#length(x1)	weight: 0
   U41(x1,x2)	weight: 0
 #U31(x1)	weight: x1
 #U61(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #33 #94
Number of SCCs: 8, DPs: 45, edges: 609
	SCC { #53 #103 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE