Input TRS: 1: U11(tt,V1,V2) -> U12(isNatKind(activate(V1)),activate(V1),activate(V2)) 2: U12(tt,V1,V2) -> U13(isNatKind(activate(V2)),activate(V1),activate(V2)) 3: U13(tt,V1,V2) -> U14(isNatKind(activate(V2)),activate(V1),activate(V2)) 4: U14(tt,V1,V2) -> U15(isNat(activate(V1)),activate(V2)) 5: U15(tt,V2) -> U16(isNat(activate(V2))) 6: U16(tt) -> tt 7: U21(tt,V1) -> U22(isNatKind(activate(V1)),activate(V1)) 8: U22(tt,V1) -> U23(isNat(activate(V1))) 9: U23(tt) -> tt 10: U31(tt,V2) -> U32(isNatKind(activate(V2))) 11: U32(tt) -> tt 12: U41(tt) -> tt 13: U51(tt,N) -> U52(isNatKind(activate(N)),activate(N)) 14: U52(tt,N) -> activate(N) 15: U61(tt,M,N) -> U62(isNatKind(activate(M)),activate(M),activate(N)) 16: U62(tt,M,N) -> U63(isNat(activate(N)),activate(M),activate(N)) 17: U63(tt,M,N) -> U64(isNatKind(activate(N)),activate(M),activate(N)) 18: U64(tt,M,N) -> s(plus(activate(N),activate(M))) 19: isNat(n__0) -> tt 20: isNat(n__plus(V1,V2)) -> U11(isNatKind(activate(V1)),activate(V1),activate(V2)) 21: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 22: isNatKind(n__0) -> tt 23: isNatKind(n__plus(V1,V2)) -> U31(isNatKind(activate(V1)),activate(V2)) 24: isNatKind(n__s(V1)) -> U41(isNatKind(activate(V1))) 25: plus(N,0) -> U51(isNat(N),N) 26: plus(N,s(M)) -> U61(isNat(M),M,N) 27: 0 -> n__0 28: plus(X1,X2) -> n__plus(X1,X2) 29: s(X) -> n__s(X) 30: activate(n__0) -> 0 31: activate(n__plus(X1,X2)) -> plus(X1,X2) 32: activate(n__s(X)) -> s(X) 33: activate(X) -> X Dependency Pairs: #1: #U11(tt,V1,V2) -> #U12(isNatKind(activate(V1)),activate(V1),activate(V2)) #2: #U11(tt,V1,V2) -> #isNatKind(activate(V1)) #3: #U11(tt,V1,V2) -> #activate(V1) #4: #U11(tt,V1,V2) -> #activate(V1) #5: #U11(tt,V1,V2) -> #activate(V2) #6: #U12(tt,V1,V2) -> #U13(isNatKind(activate(V2)),activate(V1),activate(V2)) #7: #U12(tt,V1,V2) -> #isNatKind(activate(V2)) #8: #U12(tt,V1,V2) -> #activate(V2) #9: #U12(tt,V1,V2) -> #activate(V1) #10: #U12(tt,V1,V2) -> #activate(V2) #11: #U13(tt,V1,V2) -> #U14(isNatKind(activate(V2)),activate(V1),activate(V2)) #12: #U13(tt,V1,V2) -> #isNatKind(activate(V2)) #13: #U13(tt,V1,V2) -> #activate(V2) #14: #U13(tt,V1,V2) -> #activate(V1) #15: #U13(tt,V1,V2) -> #activate(V2) #16: #U14(tt,V1,V2) -> #U15(isNat(activate(V1)),activate(V2)) #17: #U14(tt,V1,V2) -> #isNat(activate(V1)) #18: #U14(tt,V1,V2) -> #activate(V1) #19: #U14(tt,V1,V2) -> #activate(V2) #20: #U15(tt,V2) -> #U16(isNat(activate(V2))) #21: #U15(tt,V2) -> #isNat(activate(V2)) #22: #U15(tt,V2) -> #activate(V2) #23: #U21(tt,V1) -> #U22(isNatKind(activate(V1)),activate(V1)) #24: #U21(tt,V1) -> #isNatKind(activate(V1)) #25: #U21(tt,V1) -> #activate(V1) #26: #U21(tt,V1) -> #activate(V1) #27: #U22(tt,V1) -> #U23(isNat(activate(V1))) #28: #U22(tt,V1) -> #isNat(activate(V1)) #29: #U22(tt,V1) -> #activate(V1) #30: #U31(tt,V2) -> #U32(isNatKind(activate(V2))) #31: #U31(tt,V2) -> #isNatKind(activate(V2)) #32: #U31(tt,V2) -> #activate(V2) #33: #U51(tt,N) -> #U52(isNatKind(activate(N)),activate(N)) #34: #U51(tt,N) -> #isNatKind(activate(N)) #35: #U51(tt,N) -> #activate(N) #36: #U51(tt,N) -> #activate(N) #37: #U52(tt,N) -> #activate(N) #38: #U61(tt,M,N) -> #U62(isNatKind(activate(M)),activate(M),activate(N)) #39: #U61(tt,M,N) -> #isNatKind(activate(M)) #40: #U61(tt,M,N) -> #activate(M) #41: #U61(tt,M,N) -> #activate(M) #42: #U61(tt,M,N) -> #activate(N) #43: #U62(tt,M,N) -> #U63(isNat(activate(N)),activate(M),activate(N)) #44: #U62(tt,M,N) -> #isNat(activate(N)) #45: #U62(tt,M,N) -> #activate(N) #46: #U62(tt,M,N) -> #activate(M) #47: #U62(tt,M,N) -> #activate(N) #48: #U63(tt,M,N) -> #U64(isNatKind(activate(N)),activate(M),activate(N)) #49: #U63(tt,M,N) -> #isNatKind(activate(N)) #50: #U63(tt,M,N) -> #activate(N) #51: #U63(tt,M,N) -> #activate(M) #52: #U63(tt,M,N) -> #activate(N) #53: #U64(tt,M,N) -> #s(plus(activate(N),activate(M))) #54: #U64(tt,M,N) -> #plus(activate(N),activate(M)) #55: #U64(tt,M,N) -> #activate(N) #56: #U64(tt,M,N) -> #activate(M) #57: #isNat(n__plus(V1,V2)) -> #U11(isNatKind(activate(V1)),activate(V1),activate(V2)) #58: #isNat(n__plus(V1,V2)) -> #isNatKind(activate(V1)) #59: #isNat(n__plus(V1,V2)) -> #activate(V1) #60: #isNat(n__plus(V1,V2)) -> #activate(V1) #61: #isNat(n__plus(V1,V2)) -> #activate(V2) #62: #isNat(n__s(V1)) -> #U21(isNatKind(activate(V1)),activate(V1)) #63: #isNat(n__s(V1)) -> #isNatKind(activate(V1)) #64: #isNat(n__s(V1)) -> #activate(V1) #65: #isNat(n__s(V1)) -> #activate(V1) #66: #isNatKind(n__plus(V1,V2)) -> #U31(isNatKind(activate(V1)),activate(V2)) #67: #isNatKind(n__plus(V1,V2)) -> #isNatKind(activate(V1)) #68: #isNatKind(n__plus(V1,V2)) -> #activate(V1) #69: #isNatKind(n__plus(V1,V2)) -> #activate(V2) #70: #isNatKind(n__s(V1)) -> #U41(isNatKind(activate(V1))) #71: #isNatKind(n__s(V1)) -> #isNatKind(activate(V1)) #72: #isNatKind(n__s(V1)) -> #activate(V1) #73: #plus(N,0) -> #U51(isNat(N),N) #74: #plus(N,0) -> #isNat(N) #75: #plus(N,s(M)) -> #U61(isNat(M),M,N) #76: #plus(N,s(M)) -> #isNat(M) #77: #activate(n__0) -> #0 #78: #activate(n__plus(X1,X2)) -> #plus(X1,X2) #79: #activate(n__s(X)) -> #s(X) Number of SCCs: 1 SCC { #1 #2 #3 #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14 #15 #16 #17 #18 #19 #21 #22 #23 #24 #25 #26 #28 #29 #31 #32 #33 #34 #35 #36 #37 #38 #39 #40 #41 #42 #43 #44 #45 #46 #47 #48 #49 #50 #51 #52 #54 #55 #56 #57 #58 #59 #60 #61 #62 #63 #64 #65 #66 #67 #68 #69 #71 #72 #73 #74 #75 #76 #78 } QKBOPS(sum)... removes: #1 #2 #3 #4 #5 #7 #8 #9 #10 #11 #12 #13 #14 #15 #17 #18 #19 #21 #22 #23 #24 #25 #26 #28 #29 #31 #32 #33 #34 #35 #36 #37 #38 #39 #40 #41 #42 #43 #44 #45 #46 #47 #48 #49 #50 #51 #52 #54 #55 #56 #57 #58 #59 #60 #61 #62 #63 #64 #65 #66 #67 #68 #69 #71 #72 #73 #74 #76 #78 I(U21) = x1 \pi(U21) = 1 I(#U21) = 9 + x2 \pi(#U21) = [2] I(U22) = 8 \pi(U22) = [] I(#U22) = 8 + x2 \pi(#U22) = [2] I(U23) = 6 + x1 \pi(U23) = [] I(n__plus) = 8 + x1 + x2 \pi(n__plus) = [] I(U41) = 11 \pi(U41) = [] I(n__0) = 5 I(isNat) = x1 \pi(isNat) = 1 I(#isNatKind) = x1 \pi(#isNatKind) = 1 I(tt) = 6 I(U61) = 17 + x2 + x3 \pi(U61) = [] I(0) = 5 I(#U61) = 14 + x2 + x3 \pi(#U61) = [] I(#plus) = 5 + x1 + x2 \pi(#plus) = [] I(U62) = 17 + x2 + x3 \pi(U62) = [] I(U11) = 8 + x1 + x2 + x3 \pi(U11) = [3,2,1] I(n__s) = 9 + x1 \pi(n__s) = [] I(#U62) = 6 + x2 + x3 \pi(#U62) = [] I(#U11) = 6 + x2 + x3 \pi(#U11) = [] I(U12) = x3 \pi(U12) = 3 I(U63) = 17 + x2 + x3 \pi(U63) = [] I(#U12) = 6 + x2 + x3 \pi(#U12) = [] I(#U63) = 6 + x2 + x3 \pi(#U63) = [] I(U13) = 1 \pi(U13) = [] I(U64) = 17 + x2 + x3 \pi(U64) = [] I(s) = 9 + x1 \pi(s) = [] I(#U13) = 6 + x2 + x3 \pi(#U13) = [] I(#U64) = 6 + x2 + x3 \pi(#U64) = [3] I(U14) = x2 \pi(U14) = 2 I(#U14) = 6 + x2 + x3 \pi(#U14) = [3] I(U15) = 2 \pi(U15) = [] I(#U15) = 7 + x2 \pi(#U15) = [2] I(U16) = 3 \pi(U16) = [] I(U31) = 10 + x2 \pi(U31) = [] I(isNatKind) = x1 \pi(isNatKind) = [] I(activate) = x1 \pi(activate) = 1 I(#U31) = 8 + x2 \pi(#U31) = [] I(#isNat) = 7 + x1 \pi(#isNat) = [] I(U32) = 2 \pi(U32) = [] I(#activate) = 7 + x1 \pi(#activate) = [] I(U51) = 7 + x2 \pi(U51) = [] I(#U51) = 9 + x2 \pi(#U51) = [2] I(U52) = 6 + x2 \pi(U52) = [2] I(plus) = 8 + x1 + x2 \pi(plus) = [] I(#U52) = 8 + x2 \pi(#U52) = [] PREC: U16 > U22 = #U11 > U23 = #U12 = #U13 = U31 = U32 > #U21 = tt = #U61 = #plus = #U62 = U13 > #U22 = U11 = #U63 = #U14 = U15 = #U15 = #isNat > n__plus = U41 = U61 = isNatKind = #U31 = plus > U62 = U63 > U64 = #U52 > n__s = s = #U64 = #activate = #U51 > n__0 = 0 > U51 = U52 USABLE RULES: { 33..25 18..13 } Number of SCCs: 0