Input TRS: 1: __(__(X,Y),Z) -> __(X,__(Y,Z)) 2: __(X,nil()) -> X 3: __(nil(),X) -> X 4: U11(tt(),V) -> U12(isNeList(activate(V))) 5: U12(tt()) -> tt() 6: U21(tt(),V1,V2) -> U22(isList(activate(V1)),activate(V2)) 7: U22(tt(),V2) -> U23(isList(activate(V2))) 8: U23(tt()) -> tt() 9: U31(tt(),V) -> U32(isQid(activate(V))) 10: U32(tt()) -> tt() 11: U41(tt(),V1,V2) -> U42(isList(activate(V1)),activate(V2)) 12: U42(tt(),V2) -> U43(isNeList(activate(V2))) 13: U43(tt()) -> tt() 14: U51(tt(),V1,V2) -> U52(isNeList(activate(V1)),activate(V2)) 15: U52(tt(),V2) -> U53(isList(activate(V2))) 16: U53(tt()) -> tt() 17: U61(tt(),V) -> U62(isQid(activate(V))) 18: U62(tt()) -> tt() 19: U71(tt(),V) -> U72(isNePal(activate(V))) 20: U72(tt()) -> tt() 21: and(tt(),X) -> activate(X) 22: isList(V) -> U11(isPalListKind(activate(V)),activate(V)) 23: isList(n__nil()) -> tt() 24: isList(n____(V1,V2)) -> U21(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) 25: isNeList(V) -> U31(isPalListKind(activate(V)),activate(V)) 26: isNeList(n____(V1,V2)) -> U41(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) 27: isNeList(n____(V1,V2)) -> U51(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) 28: isNePal(V) -> U61(isPalListKind(activate(V)),activate(V)) 29: isNePal(n____(I,n____(P,I))) -> and(and(isQid(activate(I)),n__isPalListKind(activate(I))),n__and(n__isPal(activate(P)),n__isPalListKind(activate(P)))) 30: isPal(V) -> U71(isPalListKind(activate(V)),activate(V)) 31: isPal(n__nil()) -> tt() 32: isPalListKind(n__a()) -> tt() 33: isPalListKind(n__e()) -> tt() 34: isPalListKind(n__i()) -> tt() 35: isPalListKind(n__nil()) -> tt() 36: isPalListKind(n__o()) -> tt() 37: isPalListKind(n__u()) -> tt() 38: isPalListKind(n____(V1,V2)) -> and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) 39: isQid(n__a()) -> tt() 40: isQid(n__e()) -> tt() 41: isQid(n__i()) -> tt() 42: isQid(n__o()) -> tt() 43: isQid(n__u()) -> tt() 44: nil() -> n__nil() 45: __(X1,X2) -> n____(X1,X2) 46: isPalListKind(X) -> n__isPalListKind(X) 47: and(X1,X2) -> n__and(X1,X2) 48: isPal(X) -> n__isPal(X) 49: a() -> n__a() 50: e() -> n__e() 51: i() -> n__i() 52: o() -> n__o() 53: u() -> n__u() 54: activate(n__nil()) -> nil() 55: activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 56: activate(n__isPalListKind(X)) -> isPalListKind(X) 57: activate(n__and(X1,X2)) -> and(activate(X1),X2) 58: activate(n__isPal(X)) -> isPal(X) 59: activate(n__a()) -> a() 60: activate(n__e()) -> e() 61: activate(n__i()) -> i() 62: activate(n__o()) -> o() 63: activate(n__u()) -> u() 64: activate(X) -> X Number of strict rules: 64 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #isNePal(n____(I,n____(P,I))) -> #and(and(isQid(activate(I)),n__isPalListKind(activate(I))),n__and(n__isPal(activate(P)),n__isPalListKind(activate(P)))) #2: #isNePal(n____(I,n____(P,I))) -> #and(isQid(activate(I)),n__isPalListKind(activate(I))) #3: #isNePal(n____(I,n____(P,I))) -> #isQid(activate(I)) #4: #isNePal(n____(I,n____(P,I))) -> #activate(I) #5: #isNePal(n____(I,n____(P,I))) -> #activate(I) #6: #isNePal(n____(I,n____(P,I))) -> #activate(P) #7: #isNePal(n____(I,n____(P,I))) -> #activate(P) #8: #activate(n__isPal(X)) -> #isPal(X) #9: #activate(n__i()) -> #i() #10: #isPalListKind(n____(V1,V2)) -> #and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) #11: #isPalListKind(n____(V1,V2)) -> #isPalListKind(activate(V1)) #12: #isPalListKind(n____(V1,V2)) -> #activate(V1) #13: #isPalListKind(n____(V1,V2)) -> #activate(V2) #14: #U21(tt(),V1,V2) -> #U22(isList(activate(V1)),activate(V2)) #15: #U21(tt(),V1,V2) -> #isList(activate(V1)) #16: #U21(tt(),V1,V2) -> #activate(V1) #17: #U21(tt(),V1,V2) -> #activate(V2) #18: #activate(n__a()) -> #a() #19: #activate(n____(X1,X2)) -> #__(activate(X1),activate(X2)) #20: #activate(n____(X1,X2)) -> #activate(X1) #21: #activate(n____(X1,X2)) -> #activate(X2) #22: #U31(tt(),V) -> #U32(isQid(activate(V))) #23: #U31(tt(),V) -> #isQid(activate(V)) #24: #U31(tt(),V) -> #activate(V) #25: #U41(tt(),V1,V2) -> #U42(isList(activate(V1)),activate(V2)) #26: #U41(tt(),V1,V2) -> #isList(activate(V1)) #27: #U41(tt(),V1,V2) -> #activate(V1) #28: #U41(tt(),V1,V2) -> #activate(V2) #29: #activate(n__and(X1,X2)) -> #and(activate(X1),X2) #30: #activate(n__and(X1,X2)) -> #activate(X1) #31: #isList(n____(V1,V2)) -> #U21(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) #32: #isList(n____(V1,V2)) -> #and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) #33: #isList(n____(V1,V2)) -> #isPalListKind(activate(V1)) #34: #isList(n____(V1,V2)) -> #activate(V1) #35: #isList(n____(V1,V2)) -> #activate(V2) #36: #isList(n____(V1,V2)) -> #activate(V1) #37: #isList(n____(V1,V2)) -> #activate(V2) #38: #U42(tt(),V2) -> #U43(isNeList(activate(V2))) #39: #U42(tt(),V2) -> #isNeList(activate(V2)) #40: #U42(tt(),V2) -> #activate(V2) #41: #activate(n__isPalListKind(X)) -> #isPalListKind(X) #42: #U51(tt(),V1,V2) -> #U52(isNeList(activate(V1)),activate(V2)) #43: #U51(tt(),V1,V2) -> #isNeList(activate(V1)) #44: #U51(tt(),V1,V2) -> #activate(V1) #45: #U51(tt(),V1,V2) -> #activate(V2) #46: #activate(n__o()) -> #o() #47: #isPal(V) -> #U71(isPalListKind(activate(V)),activate(V)) #48: #isPal(V) -> #isPalListKind(activate(V)) #49: #isPal(V) -> #activate(V) #50: #isPal(V) -> #activate(V) #51: #isNeList(V) -> #U31(isPalListKind(activate(V)),activate(V)) #52: #isNeList(V) -> #isPalListKind(activate(V)) #53: #isNeList(V) -> #activate(V) #54: #isNeList(V) -> #activate(V) #55: #U22(tt(),V2) -> #U23(isList(activate(V2))) #56: #U22(tt(),V2) -> #isList(activate(V2)) #57: #U22(tt(),V2) -> #activate(V2) #58: #isNePal(V) -> #U61(isPalListKind(activate(V)),activate(V)) #59: #isNePal(V) -> #isPalListKind(activate(V)) #60: #isNePal(V) -> #activate(V) #61: #isNePal(V) -> #activate(V) #62: #isList(V) -> #U11(isPalListKind(activate(V)),activate(V)) #63: #isList(V) -> #isPalListKind(activate(V)) #64: #isList(V) -> #activate(V) #65: #isList(V) -> #activate(V) #66: #isNeList(n____(V1,V2)) -> #U51(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) #67: #isNeList(n____(V1,V2)) -> #and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) #68: #isNeList(n____(V1,V2)) -> #isPalListKind(activate(V1)) #69: #isNeList(n____(V1,V2)) -> #activate(V1) #70: #isNeList(n____(V1,V2)) -> #activate(V2) #71: #isNeList(n____(V1,V2)) -> #activate(V1) #72: #isNeList(n____(V1,V2)) -> #activate(V2) #73: #activate(n__e()) -> #e() #74: #U61(tt(),V) -> #U62(isQid(activate(V))) #75: #U61(tt(),V) -> #isQid(activate(V)) #76: #U61(tt(),V) -> #activate(V) #77: #U71(tt(),V) -> #U72(isNePal(activate(V))) #78: #U71(tt(),V) -> #isNePal(activate(V)) #79: #U71(tt(),V) -> #activate(V) #80: #activate(n__u()) -> #u() #81: #isNeList(n____(V1,V2)) -> #U41(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))),activate(V1),activate(V2)) #82: #isNeList(n____(V1,V2)) -> #and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) #83: #isNeList(n____(V1,V2)) -> #isPalListKind(activate(V1)) #84: #isNeList(n____(V1,V2)) -> #activate(V1) #85: #isNeList(n____(V1,V2)) -> #activate(V2) #86: #isNeList(n____(V1,V2)) -> #activate(V1) #87: #isNeList(n____(V1,V2)) -> #activate(V2) #88: #and(tt(),X) -> #activate(X) #89: #__(__(X,Y),Z) -> #__(X,__(Y,Z)) #90: #__(__(X,Y),Z) -> #__(Y,Z) #91: #activate(n__nil()) -> #nil() #92: #U52(tt(),V2) -> #U53(isList(activate(V2))) #93: #U52(tt(),V2) -> #isList(activate(V2)) #94: #U52(tt(),V2) -> #activate(V2) #95: #U11(tt(),V) -> #U12(isNeList(activate(V))) #96: #U11(tt(),V) -> #isNeList(activate(V)) #97: #U11(tt(),V) -> #activate(V) Number of SCCs: 3, DPs: 44, edges: 161 SCC { #89 #90 } Removing DPs: Order(PosReal,>,Sum)... succeeded. a() weight: 0 n__a() weight: 0 #U72(x1) weight: 0 #U32(x1) weight: 0 U21(x1,x2,x3) weight: 0 #isPalListKind(x1) weight: 0 U11(x1,x2) weight: 0 n__o() weight: 0 isNeList(x1) weight: 0 isPal(x1) weight: 0 U42(x1,x2) weight: 0 #e() weight: 0 u() weight: 0 activate(x1) weight: 0 U71(x1,x2) weight: 0 and(x1,x2) weight: 0 #u() weight: 0 #isNeList(x1) weight: 0 U43(x1) weight: 0 #activate(x1) weight: 0 n__i() weight: 0 #U23(x1) weight: 0 #U53(x1) weight: 0 #__(x1,x2) weight: x1 #U43(x1) weight: 0 U23(x1) weight: 0 isNePal(x1) weight: 0 U72(x1) weight: 0 #isQid(x1) weight: 0 #isPal(x1) weight: 0 n__isPal(x1) weight: 0 n__nil() weight: 0 #U52(x1,x2) weight: 0 U12(x1) weight: 0 isQid(x1) weight: 0 n____(x1,x2) weight: (/ 1 2) n__e() weight: 0 o() weight: 0 n__isPalListKind(x1) weight: 0 #U42(x1,x2) weight: 0 #U12(x1) weight: 0 #U62(x1) weight: 0 isList(x1) weight: 0 #isNePal(x1) weight: 0 nil() weight: 0 n__u() weight: 0 #o() weight: 0 U62(x1) weight: 0 #nil() weight: 0 #isList(x1) weight: 0 U32(x1) weight: 0 i() weight: 0 U52(x1,x2) weight: 0 U61(x1,x2) weight: 0 #U51(x1,x2,x3) weight: 0 e() weight: 0 #U11(x1,x2) weight: 0 U31(x1,x2) weight: 0 #U41(x1,x2,x3) weight: 0 #a() weight: 0 #U21(x1,x2,x3) weight: 0 #U22(x1,x2) weight: 0 tt() weight: 0 n__and(x1,x2) weight: 0 #U71(x1,x2) weight: 0 U22(x1,x2) weight: 0 U51(x1,x2,x3) weight: 0 isPalListKind(x1) weight: 0 U53(x1) weight: 0 U41(x1,x2,x3) weight: 0 #U31(x1,x2) weight: 0 #and(x1,x2) weight: 0 __(x1,x2) weight: (/ 1 4) + x1 + x2 #U61(x1,x2) weight: 0 #i() weight: 0 Usable rules: { } Removed DPs: #89 #90 Number of SCCs: 2, DPs: 42, edges: 157 SCC { #14 #15 #25 #26 #31 #39 #42 #43 #56 #62 #66 #81 #93 #96 } Removing DPs: Order(PosReal,>,Sum)... succeeded. a() weight: 0 n__a() weight: 0 #U72(x1) weight: 0 #U32(x1) weight: 0 U21(x1,x2,x3) weight: (/ 1 4) + x2 #isPalListKind(x1) weight: 0 U11(x1,x2) weight: (/ 1 4) n__o() weight: 0 isNeList(x1) weight: (/ 1 8) isPal(x1) weight: (/ 1 8) U42(x1,x2) weight: 0 #e() weight: 0 u() weight: 0 activate(x1) weight: x1 U71(x1,x2) weight: 0 and(x1,x2) weight: x2 #u() weight: 0 #isNeList(x1) weight: x1 U43(x1) weight: 0 #activate(x1) weight: 0 n__i() weight: 0 #U23(x1) weight: 0 #U53(x1) weight: 0 #__(x1,x2) weight: 0 #U43(x1) weight: 0 U23(x1) weight: (/ 1 2) isNePal(x1) weight: (/ 1 8) U72(x1) weight: 0 #isQid(x1) weight: 0 #isPal(x1) weight: 0 n__isPal(x1) weight: (/ 1 8) n__nil() weight: 0 #U52(x1,x2) weight: (/ 3 8) + x1 + x2 U12(x1) weight: (/ 1 4) + x1 isQid(x1) weight: (/ 1 8) n____(x1,x2) weight: (/ 3 4) + x1 + x2 n__e() weight: 0 o() weight: 0 n__isPalListKind(x1) weight: (/ 1 4) #U42(x1,x2) weight: (/ 1 8) + x2 #U12(x1) weight: 0 #U62(x1) weight: 0 isList(x1) weight: (/ 1 8) #isNePal(x1) weight: 0 nil() weight: 0 n__u() weight: 0 #o() weight: 0 U62(x1) weight: (/ 1 8) #nil() weight: 0 #isList(x1) weight: (/ 1 4) + x1 U32(x1) weight: 0 i() weight: 0 U52(x1,x2) weight: 0 U61(x1,x2) weight: x1 + x2 #U51(x1,x2,x3) weight: (/ 5 8) + x2 + x3 e() weight: 0 #U11(x1,x2) weight: (/ 1 8) + x2 U31(x1,x2) weight: 0 #U41(x1,x2,x3) weight: (/ 3 8) + x2 + x3 #a() weight: 0 #U21(x1,x2,x3) weight: (/ 1 2) + x2 + x3 #U22(x1,x2) weight: (/ 3 8) + x2 tt() weight: 0 n__and(x1,x2) weight: x2 #U71(x1,x2) weight: 0 U22(x1,x2) weight: (/ 3 8) U51(x1,x2,x3) weight: 0 isPalListKind(x1) weight: (/ 1 4) U53(x1) weight: 0 U41(x1,x2,x3) weight: 0 #U31(x1,x2) weight: 0 #and(x1,x2) weight: 0 __(x1,x2) weight: (/ 3 4) + x1 + x2 #U61(x1,x2) weight: 0 #i() weight: 0 Usable rules: { 1..3 9..16 19..21 25..27 30..64 } Removed DPs: #14 #15 #25 #26 #31 #39 #42 #43 #56 #62 #66 #81 #93 #96 Number of SCCs: 1, DPs: 28, edges: 133 SCC { #1 #2 #4..8 #10..13 #20 #21 #29 #30 #41 #47..50 #58..61 #76 #78 #79 #88 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded. a() weight: (/ 1 16) n__a() weight: (/ 1 16) #U72(x1) weight: 0 #U32(x1) weight: 0 U21(x1,x2,x3) weight: 0 #isPalListKind(x1) weight: (/ 3 16) + x1 U11(x1,x2) weight: 0 n__o() weight: (/ 1 16) isNeList(x1) weight: 0 isPal(x1) weight: (/ 7 16) + x1 U42(x1,x2) weight: 0 #e() weight: 0 u() weight: (/ 1 16) activate(x1) weight: x1 U71(x1,x2) weight: max{0, (/ 5 16) + x1} and(x1,x2) weight: max{x2, (/ 1 16) + x1} #u() weight: 0 #isNeList(x1) weight: 0 U43(x1) weight: 0 #activate(x1) weight: (/ 1 16) + x1 n__i() weight: (/ 1 16) #U23(x1) weight: 0 #U53(x1) weight: 0 #__(x1,x2) weight: 0 #U43(x1) weight: 0 U23(x1) weight: 0 isNePal(x1) weight: (/ 1 16) U72(x1) weight: (/ 1 16) #isQid(x1) weight: 0 #isPal(x1) weight: (/ 7 16) + x1 n__isPal(x1) weight: (/ 7 16) + x1 n__nil() weight: (/ 1 16) #U52(x1,x2) weight: 0 U12(x1) weight: 0 isQid(x1) weight: (/ 1 16) n____(x1,x2) weight: max{x2, (/ 5 16) + x1} n__e() weight: (/ 1 16) o() weight: (/ 1 16) n__isPalListKind(x1) weight: (/ 1 8) + x1 #U42(x1,x2) weight: 0 #U12(x1) weight: 0 #U62(x1) weight: 0 isList(x1) weight: 0 #isNePal(x1) weight: (/ 5 16) + x1 nil() weight: (/ 1 16) n__u() weight: (/ 1 16) #o() weight: 0 U62(x1) weight: x1 #nil() weight: 0 #isList(x1) weight: 0 U32(x1) weight: 0 i() weight: (/ 1 16) U52(x1,x2) weight: 0 U61(x1,x2) weight: max{0, (/ 1 8) + x2} #U51(x1,x2,x3) weight: 0 e() weight: (/ 1 16) #U11(x1,x2) weight: 0 U31(x1,x2) weight: 0 #U41(x1,x2,x3) weight: 0 #a() weight: 0 #U21(x1,x2,x3) weight: 0 #U22(x1,x2) weight: 0 tt() weight: (/ 1 16) n__and(x1,x2) weight: max{x2, (/ 1 16) + x1} #U71(x1,x2) weight: max{(/ 3 8) + x2, (/ 3 16) + x1} U22(x1,x2) weight: 0 U51(x1,x2,x3) weight: 0 isPalListKind(x1) weight: (/ 1 8) + x1 U53(x1) weight: 0 U41(x1,x2,x3) weight: 0 #U31(x1,x2) weight: 0 #and(x1,x2) weight: max{(/ 1 16) + x2, (/ 1 8) + x1} __(x1,x2) weight: max{x2, (/ 5 16) + x1} #U61(x1,x2) weight: max{0, (/ 1 8) + x2} #i() weight: 0 Usable rules: { 1..3 19..21 30..64 } Removed DPs: #1 #2 #4..8 #11..13 #20 #30 #47..50 #58..61 #76 #78 #79 Number of SCCs: 1, DPs: 5, edges: 9 SCC { #10 #21 #29 #41 #88 } Removing DPs: Order(PosReal,>,Sum)... succeeded. a() weight: 0 n__a() weight: 0 #U72(x1) weight: 0 #U32(x1) weight: 0 U21(x1,x2,x3) weight: x2 + x3 #isPalListKind(x1) weight: (/ 3 16) U11(x1,x2) weight: (/ 1 8) n__o() weight: 0 isNeList(x1) weight: (/ 3 16) isPal(x1) weight: (/ 1 8) U42(x1,x2) weight: x2 #e() weight: 0 u() weight: 0 activate(x1) weight: (/ 1 16) U71(x1,x2) weight: x1 + x2 and(x1,x2) weight: (/ 7 16) #u() weight: 0 #isNeList(x1) weight: 0 U43(x1) weight: 0 #activate(x1) weight: x1 n__i() weight: 0 #U23(x1) weight: 0 #U53(x1) weight: 0 #__(x1,x2) weight: 0 #U43(x1) weight: 0 U23(x1) weight: (/ 1 8) isNePal(x1) weight: x1 U72(x1) weight: (/ 1 16) #isQid(x1) weight: 0 #isPal(x1) weight: 0 n__isPal(x1) weight: (/ 3 16) n__nil() weight: 0 #U52(x1,x2) weight: (/ 3 16) U12(x1) weight: x1 isQid(x1) weight: x1 n____(x1,x2) weight: (/ 3 16) + x2 n__e() weight: 0 o() weight: 0 n__isPalListKind(x1) weight: (/ 3 16) #U42(x1,x2) weight: (/ 1 16) #U12(x1) weight: 0 #U62(x1) weight: 0 isList(x1) weight: (/ 1 16) #isNePal(x1) weight: 0 nil() weight: 0 n__u() weight: 0 #o() weight: 0 U62(x1) weight: (/ 1 16) #nil() weight: 0 #isList(x1) weight: (/ 1 8) U32(x1) weight: 0 i() weight: 0 U52(x1,x2) weight: 0 U61(x1,x2) weight: x1 #U51(x1,x2,x3) weight: (/ 5 16) e() weight: 0 #U11(x1,x2) weight: (/ 1 16) U31(x1,x2) weight: 0 #U41(x1,x2,x3) weight: (/ 3 16) #a() weight: 0 #U21(x1,x2,x3) weight: (/ 1 4) #U22(x1,x2) weight: (/ 3 16) tt() weight: 0 n__and(x1,x2) weight: (/ 1 2) + x2 #U71(x1,x2) weight: 0 U22(x1,x2) weight: (/ 1 16) U51(x1,x2,x3) weight: x2 isPalListKind(x1) weight: (/ 1 8) U53(x1) weight: 0 U41(x1,x2,x3) weight: (/ 1 16) + x2 + x3 #U31(x1,x2) weight: 0 #and(x1,x2) weight: x2 __(x1,x2) weight: (/ 1 8) #U61(x1,x2) weight: (/ 1 16) #i() weight: 0 Usable rules: { 39..43 } Removed DPs: #21 #29 Number of SCCs: 1, DPs: 3, edges: 3 SCC { #10 #41 #88 } Removing DPs: Order(PosReal,>,Sum)... succeeded. a() weight: 0 n__a() weight: 0 #U72(x1) weight: 0 #U32(x1) weight: 0 U21(x1,x2,x3) weight: (/ 1 8) #isPalListKind(x1) weight: (/ 7 16) + x1 U11(x1,x2) weight: (/ 1 8) n__o() weight: 0 isNeList(x1) weight: (/ 1 16) isPal(x1) weight: (/ 1 16) U42(x1,x2) weight: x2 #e() weight: 0 u() weight: 0 activate(x1) weight: x1 U71(x1,x2) weight: 0 and(x1,x2) weight: x2 #u() weight: 0 #isNeList(x1) weight: 0 U43(x1) weight: 0 #activate(x1) weight: x1 n__i() weight: 0 #U23(x1) weight: 0 #U53(x1) weight: 0 #__(x1,x2) weight: 0 #U43(x1) weight: 0 U23(x1) weight: (/ 1 4) isNePal(x1) weight: (/ 1 16) + x1 U72(x1) weight: 0 #isQid(x1) weight: 0 #isPal(x1) weight: 0 n__isPal(x1) weight: (/ 1 16) n__nil() weight: 0 #U52(x1,x2) weight: (/ 3 16) U12(x1) weight: (/ 1 8) + x1 isQid(x1) weight: (/ 1 16) + x1 n____(x1,x2) weight: (/ 3 16) + x1 + x2 n__e() weight: 0 o() weight: 0 n__isPalListKind(x1) weight: (/ 1 2) + x1 #U42(x1,x2) weight: (/ 1 16) #U12(x1) weight: 0 #U62(x1) weight: 0 isList(x1) weight: (/ 1 16) #isNePal(x1) weight: 0 nil() weight: 0 n__u() weight: 0 #o() weight: 0 U62(x1) weight: (/ 3 16) #nil() weight: 0 #isList(x1) weight: (/ 1 8) U32(x1) weight: 0 i() weight: 0 U52(x1,x2) weight: 0 U61(x1,x2) weight: (/ 1 8) #U51(x1,x2,x3) weight: (/ 5 16) e() weight: 0 #U11(x1,x2) weight: (/ 1 16) U31(x1,x2) weight: 0 #U41(x1,x2,x3) weight: (/ 3 16) #a() weight: 0 #U21(x1,x2,x3) weight: (/ 1 4) #U22(x1,x2) weight: (/ 3 16) tt() weight: 0 n__and(x1,x2) weight: x2 #U71(x1,x2) weight: 0 U22(x1,x2) weight: (/ 3 16) U51(x1,x2,x3) weight: x2 isPalListKind(x1) weight: (/ 1 2) + x1 U53(x1) weight: 0 U41(x1,x2,x3) weight: 0 #U31(x1,x2) weight: 0 #and(x1,x2) weight: (/ 1 16) + x2 __(x1,x2) weight: (/ 3 16) + x1 + x2 #U61(x1,x2) weight: (/ 1 16) #i() weight: 0 Usable rules: { 1..3 19..21 30..38 44..64 } Removed DPs: #10 #41 #88 Number of SCCs: 0, DPs: 0, edges: 0 YES