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)) Dependency Pairs: #1: #active(zeros) -> #cons(0,zeros) #2: #active(U41(tt,V2)) -> #U42(isNatIList(V2)) #3: #active(U41(tt,V2)) -> #isNatIList(V2) #4: #active(U51(tt,V2)) -> #U52(isNatList(V2)) #5: #active(U51(tt,V2)) -> #isNatList(V2) #6: #active(U61(tt,L,N)) -> #U62(isNat(N),L) #7: #active(U61(tt,L,N)) -> #isNat(N) #8: #active(U62(tt,L)) -> #s(length(L)) #9: #active(U62(tt,L)) -> #length(L) #10: #active(isNat(length(V1))) -> #U11(isNatList(V1)) #11: #active(isNat(length(V1))) -> #isNatList(V1) #12: #active(isNat(s(V1))) -> #U21(isNat(V1)) #13: #active(isNat(s(V1))) -> #isNat(V1) #14: #active(isNatIList(V)) -> #U31(isNatList(V)) #15: #active(isNatIList(V)) -> #isNatList(V) #16: #active(isNatIList(cons(V1,V2))) -> #U41(isNat(V1),V2) #17: #active(isNatIList(cons(V1,V2))) -> #isNat(V1) #18: #active(isNatList(cons(V1,V2))) -> #U51(isNat(V1),V2) #19: #active(isNatList(cons(V1,V2))) -> #isNat(V1) #20: #active(length(cons(N,L))) -> #U61(isNatList(L),L,N) #21: #active(length(cons(N,L))) -> #isNatList(L) #22: #active(cons(X1,X2)) -> #cons(active(X1),X2) #23: #active(cons(X1,X2)) -> #active(X1) #24: #active(U11(X)) -> #U11(active(X)) #25: #active(U11(X)) -> #active(X) #26: #active(U21(X)) -> #U21(active(X)) #27: #active(U21(X)) -> #active(X) #28: #active(U31(X)) -> #U31(active(X)) #29: #active(U31(X)) -> #active(X) #30: #active(U41(X1,X2)) -> #U41(active(X1),X2) #31: #active(U41(X1,X2)) -> #active(X1) #32: #active(U42(X)) -> #U42(active(X)) #33: #active(U42(X)) -> #active(X) #34: #active(U51(X1,X2)) -> #U51(active(X1),X2) #35: #active(U51(X1,X2)) -> #active(X1) #36: #active(U52(X)) -> #U52(active(X)) #37: #active(U52(X)) -> #active(X) #38: #active(U61(X1,X2,X3)) -> #U61(active(X1),X2,X3) #39: #active(U61(X1,X2,X3)) -> #active(X1) #40: #active(U62(X1,X2)) -> #U62(active(X1),X2) #41: #active(U62(X1,X2)) -> #active(X1) #42: #active(s(X)) -> #s(active(X)) #43: #active(s(X)) -> #active(X) #44: #active(length(X)) -> #length(active(X)) #45: #active(length(X)) -> #active(X) #46: #cons(mark(X1),X2) -> #cons(X1,X2) #47: #U11(mark(X)) -> #U11(X) #48: #U21(mark(X)) -> #U21(X) #49: #U31(mark(X)) -> #U31(X) #50: #U41(mark(X1),X2) -> #U41(X1,X2) #51: #U42(mark(X)) -> #U42(X) #52: #U51(mark(X1),X2) -> #U51(X1,X2) #53: #U52(mark(X)) -> #U52(X) #54: #U61(mark(X1),X2,X3) -> #U61(X1,X2,X3) #55: #U62(mark(X1),X2) -> #U62(X1,X2) #56: #s(mark(X)) -> #s(X) #57: #length(mark(X)) -> #length(X) #58: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #59: #proper(cons(X1,X2)) -> #proper(X1) #60: #proper(cons(X1,X2)) -> #proper(X2) #61: #proper(U11(X)) -> #U11(proper(X)) #62: #proper(U11(X)) -> #proper(X) #63: #proper(U21(X)) -> #U21(proper(X)) #64: #proper(U21(X)) -> #proper(X) #65: #proper(U31(X)) -> #U31(proper(X)) #66: #proper(U31(X)) -> #proper(X) #67: #proper(U41(X1,X2)) -> #U41(proper(X1),proper(X2)) #68: #proper(U41(X1,X2)) -> #proper(X1) #69: #proper(U41(X1,X2)) -> #proper(X2) #70: #proper(U42(X)) -> #U42(proper(X)) #71: #proper(U42(X)) -> #proper(X) #72: #proper(isNatIList(X)) -> #isNatIList(proper(X)) #73: #proper(isNatIList(X)) -> #proper(X) #74: #proper(U51(X1,X2)) -> #U51(proper(X1),proper(X2)) #75: #proper(U51(X1,X2)) -> #proper(X1) #76: #proper(U51(X1,X2)) -> #proper(X2) #77: #proper(U52(X)) -> #U52(proper(X)) #78: #proper(U52(X)) -> #proper(X) #79: #proper(isNatList(X)) -> #isNatList(proper(X)) #80: #proper(isNatList(X)) -> #proper(X) #81: #proper(U61(X1,X2,X3)) -> #U61(proper(X1),proper(X2),proper(X3)) #82: #proper(U61(X1,X2,X3)) -> #proper(X1) #83: #proper(U61(X1,X2,X3)) -> #proper(X2) #84: #proper(U61(X1,X2,X3)) -> #proper(X3) #85: #proper(U62(X1,X2)) -> #U62(proper(X1),proper(X2)) #86: #proper(U62(X1,X2)) -> #proper(X1) #87: #proper(U62(X1,X2)) -> #proper(X2) #88: #proper(isNat(X)) -> #isNat(proper(X)) #89: #proper(isNat(X)) -> #proper(X) #90: #proper(s(X)) -> #s(proper(X)) #91: #proper(s(X)) -> #proper(X) #92: #proper(length(X)) -> #length(proper(X)) #93: #proper(length(X)) -> #proper(X) #94: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #95: #U11(ok(X)) -> #U11(X) #96: #U21(ok(X)) -> #U21(X) #97: #U31(ok(X)) -> #U31(X) #98: #U41(ok(X1),ok(X2)) -> #U41(X1,X2) #99: #U42(ok(X)) -> #U42(X) #100: #isNatIList(ok(X)) -> #isNatIList(X) #101: #U51(ok(X1),ok(X2)) -> #U51(X1,X2) #102: #U52(ok(X)) -> #U52(X) #103: #isNatList(ok(X)) -> #isNatList(X) #104: #U61(ok(X1),ok(X2),ok(X3)) -> #U61(X1,X2,X3) #105: #U62(ok(X1),ok(X2)) -> #U62(X1,X2) #106: #isNat(ok(X)) -> #isNat(X) #107: #s(ok(X)) -> #s(X) #108: #length(ok(X)) -> #length(X) #109: #top(mark(X)) -> #top(proper(X)) #110: #top(mark(X)) -> #proper(X) #111: #top(ok(X)) -> #top(active(X)) #112: #top(ok(X)) -> #active(X) Number of SCCs: 18 SCC { #100 } QKBOPS(sum)... removes: #100 I(ok) = 1 + x1 \pi(ok) = [] I(#isNatIList) = x1 \pi(#isNatIList) = [] PREC: ok = #isNatIList USABLE RULES: { } Number of SCCs: 17 SCC { #103 } QKBOPS(sum)... removes: #103 I(ok) = 1 + x1 \pi(ok) = [] I(#isNatList) = x1 \pi(#isNatList) = [] PREC: ok = #isNatList USABLE RULES: { } Number of SCCs: 16 SCC { #106 } QKBOPS(sum)... removes: #106 I(ok) = 1 + x1 \pi(ok) = [] I(#isNat) = x1 \pi(#isNat) = [] PREC: ok = #isNat USABLE RULES: { } Number of SCCs: 15 SCC { #49 #97 } QKBOPS(sum)... removes: #49 #97 I(ok) = x1 \pi(ok) = [1] I(#U31) = x1 \pi(#U31) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = #U31 = mark USABLE RULES: { } Number of SCCs: 14 SCC { #50 #98 } QKBOPS(sum)... removes: #98 I(ok) = 1 + x1 \pi(ok) = [] I(#U41) = x2 \pi(#U41) = 2 I(mark) = 2 \pi(mark) = [] PREC: ok > mark USABLE RULES: { } Number of SCCs: 14 SCC { #50 } QKBOPS(sum)... removes: #50 I(#U41) = x1 + x2 \pi(#U41) = [] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #U41 > mark USABLE RULES: { } Number of SCCs: 13 SCC { #51 #99 } QKBOPS(sum)... removes: #51 #99 I(ok) = x1 \pi(ok) = [1] I(#U42) = x1 \pi(#U42) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = #U42 = mark USABLE RULES: { } Number of SCCs: 12 SCC { #52 #101 } QKBOPS(sum)... removes: #101 I(ok) = x1 \pi(ok) = [1] I(mark) = 2 \pi(mark) = [] I(#U51) = x2 \pi(#U51) = 2 PREC: ok = mark USABLE RULES: { } Number of SCCs: 12 SCC { #52 } QKBOPS(sum)... removes: #52 I(mark) = 1 + x1 \pi(mark) = [1] I(#U51) = x1 + x2 \pi(#U51) = [] PREC: #U51 > mark USABLE RULES: { } Number of SCCs: 11 SCC { #53 #102 } QKBOPS(sum)... removes: #53 #102 I(ok) = x1 \pi(ok) = [1] I(mark) = 1 + x1 \pi(mark) = [] I(#U52) = x1 \pi(#U52) = [1] PREC: ok = mark = #U52 USABLE RULES: { } Number of SCCs: 10 SCC { #55 #105 } QKBOPS(sum)... removes: #105 I(ok) = 1 + x1 \pi(ok) = [] I(#U62) = x2 \pi(#U62) = 2 I(mark) = 2 \pi(mark) = [] PREC: ok > mark USABLE RULES: { } Number of SCCs: 10 SCC { #55 } QKBOPS(sum)... removes: #55 I(#U62) = x1 + x2 \pi(#U62) = [] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #U62 > mark USABLE RULES: { } Number of SCCs: 9 SCC { #54 #104 } QKBOPS(sum)... removes: #54 #104 I(ok) = 1 + x1 \pi(ok) = [1] I(#U61) = x1 + x2 + x3 \pi(#U61) = [] I(mark) = 1 + x1 \pi(mark) = [] PREC: #U61 > mark > ok USABLE RULES: { } Number of SCCs: 8 SCC { #56 #107 } QKBOPS(sum)... removes: #56 #107 I(ok) = x1 \pi(ok) = [1] I(#s) = x1 \pi(#s) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = #s = mark USABLE RULES: { } Number of SCCs: 7 SCC { #57 #108 } QKBOPS(sum)... removes: #57 #108 I(#length) = x1 \pi(#length) = 1 I(ok) = x1 \pi(ok) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = mark USABLE RULES: { } Number of SCCs: 6 SCC { #47 #95 } QKBOPS(sum)... removes: #47 #95 I(ok) = x1 \pi(ok) = [1] I(#U11) = x1 \pi(#U11) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = #U11 = mark USABLE RULES: { } Number of SCCs: 5 SCC { #46 #94 } QKBOPS(sum)... removes: #94 I(ok) = 1 + x1 \pi(ok) = [] I(#cons) = x2 \pi(#cons) = 2 I(mark) = 2 \pi(mark) = [] PREC: ok > mark USABLE RULES: { } Number of SCCs: 5 SCC { #46 } QKBOPS(sum)... removes: #46 I(#cons) = x1 + x2 \pi(#cons) = [] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #cons > mark USABLE RULES: { } Number of SCCs: 4 SCC { #48 #96 } QKBOPS(sum)... removes: #48 #96 I(#U21) = x1 \pi(#U21) = 1 I(ok) = x1 \pi(ok) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: ok = mark USABLE RULES: { } Number of SCCs: 3 SCC { #109 #111 } QKBOPS(sum)... failed.