- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) [2] a____(X,nil) -> mark(X) [3] a____(nil,X) -> mark(X) [4] a__U11(tt,V) -> a__U12(a__isNeList(V)) [5] a__U12(tt) -> tt [6] a__U21(tt,V1,V2) -> a__U22(a__isList(V1),V2) [7] a__U22(tt,V2) -> a__U23(a__isList(V2)) [8] a__U23(tt) -> tt [9] a__U31(tt,V) -> a__U32(a__isQid(V)) [10] a__U32(tt) -> tt [11] a__U41(tt,V1,V2) -> a__U42(a__isList(V1),V2) [12] a__U42(tt,V2) -> a__U43(a__isNeList(V2)) [13] a__U43(tt) -> tt [14] a__U51(tt,V1,V2) -> a__U52(a__isNeList(V1),V2) [15] a__U52(tt,V2) -> a__U53(a__isList(V2)) [16] a__U53(tt) -> tt [17] a__U61(tt,V) -> a__U62(a__isQid(V)) [18] a__U62(tt) -> tt [19] a__U71(tt,V) -> a__U72(a__isNePal(V)) [20] a__U72(tt) -> tt [21] a__and(tt,X) -> mark(X) [22] a__isList(V) -> a__U11(a__isPalListKind(V),V) [23] a__isList(nil) -> tt [24] a__isList(__(V1,V2)) -> a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [25] a__isNeList(V) -> a__U31(a__isPalListKind(V),V) [26] a__isNeList(__(V1,V2)) -> a__U41(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [27] a__isNeList(__(V1,V2)) -> a__U51(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [28] a__isNePal(V) -> a__U61(a__isPalListKind(V),V) [29] a__isNePal(__(I,__(P,I))) -> a__and(a__and(a__isQid(I),isPalListKind(I)),and(isPal(P),isPalListKind(P))) [30] a__isPal(V) -> a__U71(a__isPalListKind(V),V) [31] a__isPal(nil) -> tt [32] a__isPalListKind(a) -> tt [33] a__isPalListKind(e) -> tt [34] a__isPalListKind(i) -> tt [35] a__isPalListKind(nil) -> tt [36] a__isPalListKind(o) -> tt [37] a__isPalListKind(u) -> tt [38] a__isPalListKind(__(V1,V2)) -> a__and(a__isPalListKind(V1),isPalListKind(V2)) [39] a__isQid(a) -> tt [40] a__isQid(e) -> tt [41] a__isQid(i) -> tt [42] a__isQid(o) -> tt [43] a__isQid(u) -> tt [44] mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) [45] mark(U11(X1,X2)) -> a__U11(mark(X1),X2) [46] mark(U12(X)) -> a__U12(mark(X)) [47] mark(isNeList(X)) -> a__isNeList(X) [48] mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) [49] mark(U22(X1,X2)) -> a__U22(mark(X1),X2) [50] mark(isList(X)) -> a__isList(X) [51] mark(U23(X)) -> a__U23(mark(X)) [52] mark(U31(X1,X2)) -> a__U31(mark(X1),X2) [53] mark(U32(X)) -> a__U32(mark(X)) [54] mark(isQid(X)) -> a__isQid(X) [55] mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) [56] mark(U42(X1,X2)) -> a__U42(mark(X1),X2) [57] mark(U43(X)) -> a__U43(mark(X)) [58] mark(U51(X1,X2,X3)) -> a__U51(mark(X1),X2,X3) [59] mark(U52(X1,X2)) -> a__U52(mark(X1),X2) [60] mark(U53(X)) -> a__U53(mark(X)) [61] mark(U61(X1,X2)) -> a__U61(mark(X1),X2) [62] mark(U62(X)) -> a__U62(mark(X)) [63] mark(U71(X1,X2)) -> a__U71(mark(X1),X2) [64] mark(U72(X)) -> a__U72(mark(X)) [65] mark(isNePal(X)) -> a__isNePal(X) [66] mark(and(X1,X2)) -> a__and(mark(X1),X2) [67] mark(isPalListKind(X)) -> a__isPalListKind(X) [68] mark(isPal(X)) -> a__isPal(X) [69] mark(nil) -> nil [70] mark(tt) -> tt [71] mark(a) -> a [72] mark(e) -> e [73] mark(i) -> i [74] mark(o) -> o [75] mark(u) -> u [76] a____(X1,X2) -> __(X1,X2) [77] a__U11(X1,X2) -> U11(X1,X2) [78] a__U12(X) -> U12(X) [79] a__isNeList(X) -> isNeList(X) [80] a__U21(X1,X2,X3) -> U21(X1,X2,X3) [81] a__U22(X1,X2) -> U22(X1,X2) [82] a__isList(X) -> isList(X) [83] a__U23(X) -> U23(X) [84] a__U31(X1,X2) -> U31(X1,X2) [85] a__U32(X) -> U32(X) [86] a__isQid(X) -> isQid(X) [87] a__U41(X1,X2,X3) -> U41(X1,X2,X3) [88] a__U42(X1,X2) -> U42(X1,X2) [89] a__U43(X) -> U43(X) [90] a__U51(X1,X2,X3) -> U51(X1,X2,X3) [91] a__U52(X1,X2) -> U52(X1,X2) [92] a__U53(X) -> U53(X) [93] a__U61(X1,X2) -> U61(X1,X2) [94] a__U62(X) -> U62(X) [95] a__U71(X1,X2) -> U71(X1,X2) [96] a__U72(X) -> U72(X) [97] a__isNePal(X) -> isNePal(X) [98] a__and(X1,X2) -> and(X1,X2) [99] a__isPalListKind(X) -> isPalListKind(X) [100] a__isPal(X) -> isPal(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPal(V) >= Marked_a__isPalListKind(V) ; Marked_a__isPal(V) >= Marked_a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__isQid(I), isPalListKind(I)) ; Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U52(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(Y),mark(Z)) ; Marked_a____(__(X,Y),Z) >= Marked_mark(X) ; Marked_a____(__(X,Y),Z) >= Marked_mark(Y) ; Marked_a____(__(X,Y),Z) >= Marked_mark(Z) ; Marked_a____(nil,X) >= Marked_mark(X) ; Marked_a____(X,nil) >= Marked_mark(X) ; Marked_mark(__(X1,X2)) >= Marked_a____(mark(X1),mark(X2)) ; Marked_mark(__(X1,X2)) >= Marked_mark(X1) ; Marked_mark(__(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isPal(X)) >= Marked_a__isPal(X) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U51(X1,X2,X3)) >= Marked_a__U51(mark(X1),X2,X3) ; Marked_mark(U51(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U52(X1,X2)) >= Marked_a__U52(mark(X1),X2) ; Marked_mark(U52(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U53(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isPal(V) > Marked_a__U71(a__isPalListKind(V),V) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(__(I,__(P,I))) > Marked_a__and(a__isQid(I), isPalListKind(I)) ; } { Marked_a__isNePal(__(I,__(P,I))) > Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U52(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__U52(a__isNeList(V1),V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__isNeList(V1) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_a____(__(X,Y),Z) > Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } { Marked_a____(__(X,Y),Z) > Marked_a____(mark(Y),mark(Z)) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(X) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(Y) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(Z) ; } { Marked_a____(nil,X) > Marked_mark(X) ; } { Marked_a____(X,nil) > Marked_mark(X) ; } { Marked_mark(__(X1,X2)) > Marked_a____(mark(X1),mark(X2)) ; } { Marked_mark(__(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(__(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isPal(X)) > Marked_a__isPal(X) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U51(X1,X2,X3)) > Marked_a__U51(mark(X1),X2,X3) ; } { Marked_mark(U51(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U52(X1,X2)) > Marked_a__U52(mark(X1),X2) ; } { Marked_mark(U52(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U53(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isPal(V) >= Marked_a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__isQid(I), isPalListKind(I)) constraint: Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and( a__isQid( I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U52(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X), a____(mark(Y),mark(Z))) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(Y),mark(Z)) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(X) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(Y) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(Z) constraint: Marked_a____(nil,X) >= Marked_mark(X) constraint: Marked_a____(X,nil) >= Marked_mark(X) constraint: Marked_mark(__(X1,X2)) >= Marked_a____(mark(X1),mark(X2)) constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isPal(X)) >= Marked_a__isPal(X) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U51(X1,X2,X3)) >= Marked_a__U51(mark(X1),X2,X3) constraint: Marked_mark(U51(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U52(X1,X2)) >= Marked_a__U52(mark(X1),X2) constraint: Marked_mark(U52(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U53(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } + Disjunctions:{ { Marked_a____(__(X,Y),Z) > Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X), a____(mark(Y),mark(Z))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPal(V) >= Marked_a__isPalListKind(V) ; Marked_a__isPal(V) >= Marked_a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__isQid(I), isPalListKind(I)) ; Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U52(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isPal(X)) >= Marked_a__isPal(X) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U53(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isPal(V) > Marked_a__U71(a__isPalListKind(V),V) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(__(I,__(P,I))) > Marked_a__and(a__isQid(I), isPalListKind(I)) ; } { Marked_a__isNePal(__(I,__(P,I))) > Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U52(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__U52(a__isNeList(V1),V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__isNeList(V1) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isPal(X)) > Marked_a__isPal(X) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U53(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isPal(V) >= Marked_a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__isQid(I), isPalListKind(I)) constraint: Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and( a__isQid( I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U52(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isPal(X)) >= Marked_a__isPal(X) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U53(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U52(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U53(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(__(I,__(P,I))) > Marked_a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U52(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__U52(a__isNeList(V1),V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__isNeList(V1) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U53(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(__(I,__(P,I))) >= Marked_a__and(a__and( a__isQid( I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U52(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U53(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U52(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) ; Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1,V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U53(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U52(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__U52(a__isNeList(V1),V2) ; } { Marked_a__U51(tt,V1,V2) > Marked_a__isNeList(V1) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isList(__(V1,V2)) > Marked_a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(__(V1,V2)) > Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1, V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U53(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U52(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__U52(a__isNeList(V1),V2) constraint: Marked_a__U51(tt,V1,V2) >= Marked_a__isNeList(V1) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isList(__(V1,V2)) >= Marked_a__U21(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U51(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(__(V1,V2)) >= Marked_a__U41(a__and(a__isPalListKind( V1), isPalListKind(V2)), V1,V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U53(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U53(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U53(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U53(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) ; Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__U21(tt,V1,V2) > Marked_a__U22(a__isList(V1),V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_a__U21(mark(X1),X2,X3) ; } { Marked_mark(U21(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__U21(tt,V1,V2) >= Marked_a__U22(a__isList(V1),V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_a__U21(mark(X1),X2,X3) constraint: Marked_mark(U21(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) ; Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) ; Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__U42(a__isList(V1),V2) ; } { Marked_a__U41(tt,V1,V2) > Marked_a__isList(V1) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_a__U41(mark(X1),X2,X3) ; } { Marked_mark(U41(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__U42(a__isList(V1),V2) constraint: Marked_a__U41(tt,V1,V2) >= Marked_a__isList(V1) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_a__U41(mark(X1),X2,X3) constraint: Marked_mark(U41(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) ; Marked_a__U71(tt,V) >= Marked_a__isNePal(V) ; Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) ; Marked_a__isList(V) >= Marked_a__isPalListKind(V) ; Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) ; Marked_a__U22(tt,V2) >= Marked_a__isList(V2) ; Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) ; Marked_a__U11(tt,V) >= Marked_a__isNeList(V) ; Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) ; Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(isList(X)) >= Marked_a__isList(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__and(a__isPalListKind(V1), isPalListKind(V2)) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__isNePal(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U71(tt,V) > Marked_a__isNePal(V) ; } { Marked_a__U42(tt,V2) > Marked_a__isNeList(V2) ; } { Marked_a__isList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__isList(V) > Marked_a__U11(a__isPalListKind(V),V) ; } { Marked_a__U22(tt,V2) > Marked_a__isList(V2) ; } { Marked_a__isNeList(V) > Marked_a__isPalListKind(V) ; } { Marked_a__U11(tt,V) > Marked_a__isNeList(V) ; } { Marked_mark(isPalListKind(X)) > Marked_a__isPalListKind(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(isNeList(X)) > Marked_a__isNeList(X) ; } { Marked_mark(U22(X1,X2)) > Marked_a__U22(mark(X1),X2) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(isList(X)) > Marked_a__isList(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U42(X1,X2)) > Marked_a__U42(mark(X1),X2) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_a__U71(mark(X1),X2) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(isNePal(X)) > Marked_a__isNePal(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__and(a__isPalListKind( V1), isPalListKind(V2)) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__isNePal(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U71(tt,V) >= Marked_a__isNePal(V) constraint: Marked_a__U42(tt,V2) >= Marked_a__isNeList(V2) constraint: Marked_a__isList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__isList(V) >= Marked_a__U11(a__isPalListKind(V),V) constraint: Marked_a__U22(tt,V2) >= Marked_a__isList(V2) constraint: Marked_a__isNeList(V) >= Marked_a__isPalListKind(V) constraint: Marked_a__U11(tt,V) >= Marked_a__isNeList(V) constraint: Marked_mark(isPalListKind(X)) >= Marked_a__isPalListKind(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(isNeList(X)) >= Marked_a__isNeList(X) constraint: Marked_mark(U22(X1,X2)) >= Marked_a__U22(mark(X1),X2) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(isList(X)) >= Marked_a__isList(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U42(X1,X2)) >= Marked_a__U42(mark(X1),X2) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_a__U71(mark(X1),X2) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(isNePal(X)) >= Marked_a__isNePal(X) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U42(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U42(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U42(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) ; } + Disjunctions:{ { Marked_a__isPalListKind(__(V1,V2)) > Marked_a__isPalListKind(V1) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_a__isPalListKind(__(V1,V2)) >= Marked_a__isPalListKind(V1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U22(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U22(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U22(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U23(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U23(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U23(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U61(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U61(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U43(X)) >= Marked_mark(X) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U43(X)) > Marked_mark(X) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U43(X)) >= Marked_mark(X) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U12(X)) >= Marked_mark(X) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U12(X)) > Marked_mark(X) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U12(X)) >= Marked_mark(X) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U32(X)) >= Marked_mark(X) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U32(X)) > Marked_mark(X) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U32(X)) >= Marked_mark(X) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; Marked_mark(U72(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) constraint: Marked_mark(U72(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U62(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U62(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U62(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(isPalListKind(X)) >= a__isPalListKind(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(isPal(X)) >= a__isPal(X) ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U12(X)) >= a__U12(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) ; mark(U22(X1,X2)) >= a__U22(mark(X1),X2) ; mark(isList(X)) >= a__isList(X) ; mark(U23(X)) >= a__U23(mark(X)) ; mark(U31(X1,X2)) >= a__U31(mark(X1),X2) ; mark(U32(X)) >= a__U32(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) ; mark(U42(X1,X2)) >= a__U42(mark(X1),X2) ; mark(U43(X)) >= a__U43(mark(X)) ; mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) ; mark(U52(X1,X2)) >= a__U52(mark(X1),X2) ; mark(U53(X)) >= a__U53(mark(X)) ; mark(U61(X1,X2)) >= a__U61(mark(X1),X2) ; mark(U62(X)) >= a__U62(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U12(tt) >= tt ; a__U12(X) >= U12(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isPalListKind(V),V) ; a__U11(tt,V) >= a__U12(a__isNeList(V)) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U22(tt,V2) >= a__U23(a__isList(V2)) ; a__U22(X1,X2) >= U22(X1,X2) ; a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)), V1,V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isPalListKind(V),V) ; a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) ; a__U21(X1,X2,X3) >= U21(X1,X2,X3) ; a__U23(tt) >= tt ; a__U23(X) >= U23(X) ; a__U32(tt) >= tt ; a__U32(X) >= U32(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__U31(tt,V) >= a__U32(a__isQid(V)) ; a__U31(X1,X2) >= U31(X1,X2) ; a__U42(tt,V2) >= a__U43(a__isNeList(V2)) ; a__U42(X1,X2) >= U42(X1,X2) ; a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) ; a__U41(X1,X2,X3) >= U41(X1,X2,X3) ; a__U43(tt) >= tt ; a__U43(X) >= U43(X) ; a__U52(tt,V2) >= a__U53(a__isList(V2)) ; a__U52(X1,X2) >= U52(X1,X2) ; a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) ; a__U51(X1,X2,X3) >= U51(X1,X2,X3) ; a__U53(tt) >= tt ; a__U53(X) >= U53(X) ; a__U62(tt) >= tt ; a__U62(X) >= U62(X) ; a__U61(tt,V) >= a__U62(a__isQid(V)) ; a__U61(X1,X2) >= U61(X1,X2) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I),isPalListKind(I)), and(isPal(P),isPalListKind(P))) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isPalListKind(V),V) ; a__U71(tt,V) >= a__U72(a__isNePal(V)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1),isPalListKind(V2)) ; a__isPalListKind(nil) >= tt ; a__isPalListKind(a) >= tt ; a__isPalListKind(e) >= tt ; a__isPalListKind(i) >= tt ; a__isPalListKind(o) >= tt ; a__isPalListKind(u) >= tt ; a__isPalListKind(X) >= isPalListKind(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U71(a__isPalListKind(V),V) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(isPalListKind(X)) >= a__isPalListKind(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U12(X)) >= a__U12(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U21(X1,X2,X3)) >= a__U21(mark(X1),X2,X3) constraint: mark(U22(X1,X2)) >= a__U22(mark(X1),X2) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U23(X)) >= a__U23(mark(X)) constraint: mark(U31(X1,X2)) >= a__U31(mark(X1),X2) constraint: mark(U32(X)) >= a__U32(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(U41(X1,X2,X3)) >= a__U41(mark(X1),X2,X3) constraint: mark(U42(X1,X2)) >= a__U42(mark(X1),X2) constraint: mark(U43(X)) >= a__U43(mark(X)) constraint: mark(U51(X1,X2,X3)) >= a__U51(mark(X1),X2,X3) constraint: mark(U52(X1,X2)) >= a__U52(mark(X1),X2) constraint: mark(U53(X)) >= a__U53(mark(X)) constraint: mark(U61(X1,X2)) >= a__U61(mark(X1),X2) constraint: mark(U62(X)) >= a__U62(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U12(tt) >= tt constraint: a__U12(X) >= U12(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isPalListKind(V),V) constraint: a__U11(tt,V) >= a__U12(a__isNeList(V)) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U22(tt,V2) >= a__U23(a__isList(V2)) constraint: a__U22(X1,X2) >= U22(X1,X2) constraint: a__isList(__(V1,V2)) >= a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isPalListKind(V),V) constraint: a__U21(tt,V1,V2) >= a__U22(a__isList(V1),V2) constraint: a__U21(X1,X2,X3) >= U21(X1,X2,X3) constraint: a__U23(tt) >= tt constraint: a__U23(X) >= U23(X) constraint: a__U32(tt) >= tt constraint: a__U32(X) >= U32(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__U31(tt,V) >= a__U32(a__isQid(V)) constraint: a__U31(X1,X2) >= U31(X1,X2) constraint: a__U42(tt,V2) >= a__U43(a__isNeList(V2)) constraint: a__U42(X1,X2) >= U42(X1,X2) constraint: a__U41(tt,V1,V2) >= a__U42(a__isList(V1),V2) constraint: a__U41(X1,X2,X3) >= U41(X1,X2,X3) constraint: a__U43(tt) >= tt constraint: a__U43(X) >= U43(X) constraint: a__U52(tt,V2) >= a__U53(a__isList(V2)) constraint: a__U52(X1,X2) >= U52(X1,X2) constraint: a__U51(tt,V1,V2) >= a__U52(a__isNeList(V1),V2) constraint: a__U51(X1,X2,X3) >= U51(X1,X2,X3) constraint: a__U53(tt) >= tt constraint: a__U53(X) >= U53(X) constraint: a__U62(tt) >= tt constraint: a__U62(X) >= U62(X) constraint: a__U61(tt,V) >= a__U62(a__isQid(V)) constraint: a__U61(X1,X2) >= U61(X1,X2) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isNePal(__(I,__(P,I))) >= a__and(a__and(a__isQid(I), isPalListKind(I)), and(isPal(P),isPalListKind(P))) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isPalListKind(V),V) constraint: a__U71(tt,V) >= a__U72(a__isNePal(V)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isPalListKind(__(V1,V2)) >= a__and(a__isPalListKind(V1), isPalListKind(V2)) constraint: a__isPalListKind(nil) >= tt constraint: a__isPalListKind(a) >= tt constraint: a__isPalListKind(e) >= tt constraint: a__isPalListKind(i) >= tt constraint: a__isPalListKind(o) >= tt constraint: a__isPalListKind(u) >= tt constraint: a__isPalListKind(X) >= isPalListKind(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U71(a__isPalListKind(V),V) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) [2] a____(X,nil) -> mark(X) [3] a____(nil,X) -> mark(X) [4] a__U11(tt,V) -> a__U12(a__isNeList(V)) [5] a__U12(tt) -> tt [6] a__U21(tt,V1,V2) -> a__U22(a__isList(V1),V2) [7] a__U22(tt,V2) -> a__U23(a__isList(V2)) [8] a__U23(tt) -> tt [9] a__U31(tt,V) -> a__U32(a__isQid(V)) [10] a__U32(tt) -> tt [11] a__U41(tt,V1,V2) -> a__U42(a__isList(V1),V2) [12] a__U42(tt,V2) -> a__U43(a__isNeList(V2)) [13] a__U43(tt) -> tt [14] a__U51(tt,V1,V2) -> a__U52(a__isNeList(V1),V2) [15] a__U52(tt,V2) -> a__U53(a__isList(V2)) [16] a__U53(tt) -> tt [17] a__U61(tt,V) -> a__U62(a__isQid(V)) [18] a__U62(tt) -> tt [19] a__U71(tt,V) -> a__U72(a__isNePal(V)) [20] a__U72(tt) -> tt [21] a__and(tt,X) -> mark(X) [22] a__isList(V) -> a__U11(a__isPalListKind(V),V) [23] a__isList(nil) -> tt [24] a__isList(__(V1,V2)) -> a__U21(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [25] a__isNeList(V) -> a__U31(a__isPalListKind(V),V) [26] a__isNeList(__(V1,V2)) -> a__U41(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [27] a__isNeList(__(V1,V2)) -> a__U51(a__and(a__isPalListKind(V1),isPalListKind(V2)),V1,V2) [28] a__isNePal(V) -> a__U61(a__isPalListKind(V),V) [29] a__isNePal(__(I,__(P,I))) -> a__and(a__and(a__isQid(I),isPalListKind(I)),and(isPal(P),isPalListKind(P))) [30] a__isPal(V) -> a__U71(a__isPalListKind(V),V) [31] a__isPal(nil) -> tt [32] a__isPalListKind(a) -> tt [33] a__isPalListKind(e) -> tt [34] a__isPalListKind(i) -> tt [35] a__isPalListKind(nil) -> tt [36] a__isPalListKind(o) -> tt [37] a__isPalListKind(u) -> tt [38] a__isPalListKind(__(V1,V2)) -> a__and(a__isPalListKind(V1),isPalListKind(V2)) [39] a__isQid(a) -> tt [40] a__isQid(e) -> tt [41] a__isQid(i) -> tt [42] a__isQid(o) -> tt [43] a__isQid(u) -> tt [44] mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) [45] mark(U11(X1,X2)) -> a__U11(mark(X1),X2) [46] mark(U12(X)) -> a__U12(mark(X)) [47] mark(isNeList(X)) -> a__isNeList(X) [48] mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) [49] mark(U22(X1,X2)) -> a__U22(mark(X1),X2) [50] mark(isList(X)) -> a__isList(X) [51] mark(U23(X)) -> a__U23(mark(X)) [52] mark(U31(X1,X2)) -> a__U31(mark(X1),X2) [53] mark(U32(X)) -> a__U32(mark(X)) [54] mark(isQid(X)) -> a__isQid(X) [55] mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) [56] mark(U42(X1,X2)) -> a__U42(mark(X1),X2) [57] mark(U43(X)) -> a__U43(mark(X)) [58] mark(U51(X1,X2,X3)) -> a__U51(mark(X1),X2,X3) [59] mark(U52(X1,X2)) -> a__U52(mark(X1),X2) [60] mark(U53(X)) -> a__U53(mark(X)) [61] mark(U61(X1,X2)) -> a__U61(mark(X1),X2) [62] mark(U62(X)) -> a__U62(mark(X)) [63] mark(U71(X1,X2)) -> a__U71(mark(X1),X2) [64] mark(U72(X)) -> a__U72(mark(X)) [65] mark(isNePal(X)) -> a__isNePal(X) [66] mark(and(X1,X2)) -> a__and(mark(X1),X2) [67] mark(isPalListKind(X)) -> a__isPalListKind(X) [68] mark(isPal(X)) -> a__isPal(X) [69] mark(nil) -> nil [70] mark(tt) -> tt [71] mark(a) -> a [72] mark(e) -> e [73] mark(i) -> i [74] mark(o) -> o [75] mark(u) -> u [76] a____(X1,X2) -> __(X1,X2) [77] a__U11(X1,X2) -> U11(X1,X2) [78] a__U12(X) -> U12(X) [79] a__isNeList(X) -> isNeList(X) [80] a__U21(X1,X2,X3) -> U21(X1,X2,X3) [81] a__U22(X1,X2) -> U22(X1,X2) [82] a__isList(X) -> isList(X) [83] a__U23(X) -> U23(X) [84] a__U31(X1,X2) -> U31(X1,X2) [85] a__U32(X) -> U32(X) [86] a__isQid(X) -> isQid(X) [87] a__U41(X1,X2,X3) -> U41(X1,X2,X3) [88] a__U42(X1,X2) -> U42(X1,X2) [89] a__U43(X) -> U43(X) [90] a__U51(X1,X2,X3) -> U51(X1,X2,X3) [91] a__U52(X1,X2) -> U52(X1,X2) [92] a__U53(X) -> U53(X) [93] a__U61(X1,X2) -> U61(X1,X2) [94] a__U62(X) -> U62(X) [95] a__U71(X1,X2) -> U71(X1,X2) [96] a__U72(X) -> U72(X) [97] a__isNePal(X) -> isNePal(X) [98] a__and(X1,X2) -> and(X1,X2) [99] a__isPalListKind(X) -> isPalListKind(X) [100] a__isPal(X) -> isPal(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0; [ U42 ] (X0,X1) = 1*X1 + 1*X0; [ a__U22 ] (X0,X1) = 1*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ Marked_a__U51 ] (X0,X1,X2) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 1*X0; [ U53 ] (X0) = 1*X0; [ a__U32 ] (X0) = 2*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1; [ __ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 1*X1 + 1*X0 + 1; [ Marked_a____ ] (X0,X1) = 2*X1 + 2*X0; [ U51 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0 + 2; [ a__U21 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0; [ isList ] (X0) = 1*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isPal ] (X0) = 0; [ a__U11 ] (X0,X1) = 1*X1 + 2*X0; [ Marked_a__U42 ] (X0,X1) = 0; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X0; [ Marked_a__U21 ] (X0,X1,X2) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 1*X0; [ U22 ] (X0,X1) = 1*X1 + 1*X0; [ a__U71 ] (X0,X1) = 1*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 1*X1 + 2*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isNePal ] (X0) = 0; [ nil ] () = 0; [ Marked_a__U52 ] (X0,X1) = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0 + 2; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 1*X1 + 1*X0 + 1; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 0; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X0; [ a__U42 ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X2 + 1*X1 + 2*X0; [ a__isPal ] (X0) = 0; [ Marked_a__U71 ] (X0,X1) = 0; removing < Marked_a____(__(X,Y),Z),Marked_mark(Z)>< Marked_mark(__(X1,X2)),Marked_mark(X1)>< Marked_mark(U51(X1,X2,X3)),Marked_a__U51(mark(X1),X2,X3)>< Marked_mark(U52(X1,X2)),Marked_a__U52(mark(X1),X2)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ a____ ] (X0,X1) = 1 + 1*X0 + 1*X1 + 0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 1 + 0; [ U21 ] (X0,X1,X2) = 1 + 0; [ a__isNePal ] (X0) = 3*X0 + 0; [ U72 ] (X0) = 0; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 0; [ U31 ] (X0,X1) = 0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1 + 1*X0 + 1*X1 + 0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ Marked_a____ ] (X0,X1) = 1*X0 + 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 1 + 0; [ isList ] (X0) = 2*X0 + 0; [ a__and ] (X0,X1) = 1*X1 + 0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 0; [ a__U31 ] (X0,X1) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0 + 0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 2*X0 + 0; [ U22 ] (X0,X1) = 1 + 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 3*X0 + 0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X0; [ U42 ] (X0,X1) = 1*X0; [ a__U22 ] (X0,X1) = 2*X0; [ U21 ] (X0,X1,X2) = 1*X0; [ a__isNePal ] (X0) = 1*X0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ Marked_a__U51 ] (X0,X1,X2) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 2*X0; [ U53 ] (X0) = 2*X0; [ a__U32 ] (X0) = 1*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 1*X0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__isPal ] (X0) = 2*X0; [ a__U11 ] (X0,X1) = 1*X0; [ Marked_a__U42 ] (X0,X1) = 0; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 2*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X0; [ Marked_a__U21 ] (X0,X1,X2) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 1*X0 + 1; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 2*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 2*X0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 2*X0; [ a__U71 ] (X0,X1) = 1*X1 + 1*X0; [ isNePal ] (X0) = 1*X0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 1*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 2*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 0; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__isNePal ] (X0) = 1*X0; [ nil ] () = 0; [ Marked_a__U52 ] (X0,X1) = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 2*X0; [ U23 ] (X0) = 2*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X1 + 1*X0; [ a__U42 ] (X0,X1) = 1*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X0; [ a__isPal ] (X0) = 1*X0 + 1; [ Marked_a__U71 ] (X0,X1) = 1*X1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X0; [ U42 ] (X0,X1) = 2*X0; [ a__U22 ] (X0,X1) = 1*X0; [ U21 ] (X0,X1,X2) = 2*X0; [ a__isNePal ] (X0) = 1*X0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ Marked_a__U51 ] (X0,X1,X2) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 1*X0; [ U53 ] (X0) = 1*X0; [ a__U32 ] (X0) = 1*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 3*X1; [ __ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 2*X0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 2*X1 + 1*X0; [ a__U11 ] (X0,X1) = 1*X0; [ Marked_a__U42 ] (X0,X1) = 0; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 1*X0; [ Marked_a__U21 ] (X0,X1,X2) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 1*X0 + 1; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 1*X0; [ a__U71 ] (X0,X1) = 1*X1 + 2*X0; [ isNePal ] (X0) = 1*X0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 1*X0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 0; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__isNePal ] (X0) = 1*X0; [ nil ] () = 0; [ Marked_a__U52 ] (X0,X1) = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X1 + 2*X0; [ a__U42 ] (X0,X1) = 2*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X0; [ a__isPal ] (X0) = 1*X0 + 1; [ Marked_a__U71 ] (X0,X1) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0; [ U42 ] (X0,X1) = 1*X1 + 1*X0; [ a__U22 ] (X0,X1) = 1*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ Marked_a__U51 ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ u ] () = 0; [ a__U53 ] (X0) = 1*X0; [ U53 ] (X0) = 1*X0; [ a__U32 ] (X0) = 1*X0; [ Marked_a__isList ] (X0) = 2*X0 + 1; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1 + 1; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ i ] () = 0; [ a__U52 ] (X0,X1) = 1*X1; [ U51 ] (X0,X1,X2) = 1*X2; [ a__U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0; [ isList ] (X0) = 1*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 1*X1 + 2*X0; [ Marked_a__U42 ] (X0,X1) = 2*X1 + 1; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X0; [ Marked_a__U21 ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 2*X1 + 1; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 1*X0; [ U22 ] (X0,X1) = 1*X1 + 1*X0; [ a__U71 ] (X0,X1) = 1*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 1*X1 + 2*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 2*X1 + 1; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isNePal ] (X0) = 1; [ nil ] () = 0; [ Marked_a__U52 ] (X0,X1) = 2*X1 + 1; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2; [ Marked_mark ] (X0) = 2*X0 + 1; [ U52 ] (X0,X1) = 1*X1; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 1; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X0; [ a__U42 ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 2*X0 + 1; [ U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0; [ a__isPal ] (X0) = 0; [ Marked_a__U71 ] (X0,X1) = 1; removing < Marked_a__isNeList(__(V1,V2)),Marked_a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2)>< Marked_a__isNeList(__(V1,V2)),Marked_a__and(a__isPalListKind(V1), isPalListKind(V2))>< Marked_a__isNeList(__(V1,V2)),Marked_a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)),V1,V2)>< Marked_a__isNeList(__(V1,V2)),Marked_a__and(a__isPalListKind(V1), isPalListKind(V2))> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0; [ U42 ] (X0,X1) = 1*X1 + 1*X0; [ a__U22 ] (X0,X1) = 1*X1 + 2*X0; [ U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ u ] () = 0; [ a__U53 ] (X0) = 1*X0 + 1; [ U53 ] (X0) = 1*X0 + 1; [ a__U32 ] (X0) = 1*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 1*X1 + 2; [ U51 ] (X0,X1,X2) = 1*X2 + 2; [ a__U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0; [ isList ] (X0) = 1*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 1*X1 + 2*X0; [ Marked_a__U42 ] (X0,X1) = 2*X1; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 2*X0; [ Marked_a__U21 ] (X0,X1,X2) = 2*X2; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 1*X0; [ U22 ] (X0,X1) = 1*X1 + 2*X0; [ a__U71 ] (X0,X1) = 2*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 1*X1 + 2*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 0; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isNePal ] (X0) = 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2 + 2; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 1*X1 + 2; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 2*X2; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 2*X0; [ a__U42 ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0; [ a__isPal ] (X0) = 0; [ Marked_a__U71 ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 3*X0 + 1; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0; [ U42 ] (X0,X1) = 1*X1 + 1*X0; [ a__U22 ] (X0,X1) = 2*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0 + 1; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1; [ __ ] (X0,X1) = 1*X1 + 3*X0 + 1; [ i ] () = 0; [ a__U52 ] (X0,X1) = 1; [ U51 ] (X0,X1,X2) = 1; [ a__U21 ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0 + 1; [ isList ] (X0) = 2*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__U42 ] (X0,X1) = 2*X1; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X0; [ Marked_a__U21 ] (X0,X1,X2) = 3*X2 + 2; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 2*X0; [ U22 ] (X0,X1) = 2*X1 + 1*X0; [ a__U71 ] (X0,X1) = 2*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 2*X1 + 2*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 2*X1; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isNePal ] (X0) = 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 1; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 2*X2; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 2*X0; [ a__U42 ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0; [ a__isPal ] (X0) = 0; [ Marked_a__U71 ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0 + 1; [ U42 ] (X0,X1) = 1*X1 + 1*X0; [ a__U22 ] (X0,X1) = 2*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 2*X2 + 2*X1; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ Marked_a__isList ] (X0) = 0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ Marked_a__and ] (X0,X1) = 2*X1; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 1*X2 + 2; [ a__U21 ] (X0,X1,X2) = 2*X2 + 2*X1; [ isList ] (X0) = 2*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__U42 ] (X0,X1) = 0; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 2*X0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 2*X0; [ U22 ] (X0,X1) = 2*X1 + 1*X0; [ a__U71 ] (X0,X1) = 1*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 2*X1 + 1*X0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 2*X0; [ a__isQid ] (X0) = 0; [ Marked_a__U22 ] (X0,X1) = 3*X1; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ Marked_a__isNePal ] (X0) = 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2 + 2; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ Marked_a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U41 ] (X0,X1,X2) = 2*X2 + 2*X0; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X0; [ a__U42 ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 0; [ U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0 + 1; [ a__isPal ] (X0) = 0; [ Marked_a__U71 ] (X0,X1) = 0; removing < Marked_mark(U41(X1,X2,X3)),Marked_mark(X1)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0; [ a ] () = 2; [ a__U41 ] (X0,X1,X2) = 2*X2 + 3*X1; [ U42 ] (X0,X1) = 2*X1 + 1*X0; [ a__U22 ] (X0,X1) = 3*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 3*X2 + 3*X1; [ a__isNePal ] (X0) = 2*X0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0; [ u ] () = 2; [ a__U53 ] (X0) = 2; [ U53 ] (X0) = 2; [ a__U32 ] (X0) = 1*X0; [ Marked_a__isList ] (X0) = 2*X0; [ U31 ] (X0,X1) = 1*X1 + 1*X0; [ isPalListKind ] (X0) = 1*X0; [ Marked_a__and ] (X0,X1) = 2*X1 + 2*X0; [ __ ] (X0,X1) = 1*X1 + 2*X0; [ i ] () = 2; [ a__U52 ] (X0,X1) = 1*X0; [ U51 ] (X0,X1,X2) = 2*X1; [ a__U21 ] (X0,X1,X2) = 3*X2 + 3*X1; [ isList ] (X0) = 3*X0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__U42 ] (X0,X1) = 3*X1; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X1 + 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X1 + 1*X0; [ isQid ] (X0) = 1*X0; [ isPal ] (X0) = 3*X0; [ mark ] (X0) = 1*X0; [ e ] () = 2; [ a__U43 ] (X0) = 1*X0; [ Marked_a__U11 ] (X0,X1) = 2*X1; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 3*X0; [ U22 ] (X0,X1) = 3*X1 + 1*X0; [ a__U71 ] (X0,X1) = 2*X1 + 1*X0; [ isNePal ] (X0) = 2*X0; [ a__isNeList ] (X0) = 2*X0; [ U11 ] (X0,X1) = 2*X1 + 1*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X1 + 1*X0; [ a__isQid ] (X0) = 1*X0; [ Marked_a__U22 ] (X0,X1) = 3*X1; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ Marked_a__isNePal ] (X0) = 2*X0; [ nil ] () = 3; [ o ] () = 2; [ a__U51 ] (X0,X1,X2) = 2*X1; [ Marked_mark ] (X0) = 2*X0; [ U52 ] (X0,X1) = 1*X0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 1*X0; [ Marked_a__isPalListKind ] (X0) = 2*X0; [ tt ] () = 2; [ isNeList ] (X0) = 2*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 2*X1 + 1*X0; [ a__U42 ] (X0,X1) = 2*X1 + 1*X0; [ Marked_a__isNeList ] (X0) = 2*X0; [ U41 ] (X0,X1,X2) = 2*X2 + 3*X1; [ a__isPal ] (X0) = 3*X0; [ Marked_a__U71 ] (X0,X1) = 3*X1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1; [ U42 ] (X0,X1) = 1*X1 + 2*X0 + 1; [ a__U22 ] (X0,X1) = 1*X1 + 1*X0; [ U21 ] (X0,X1,X2) = 1*X2 + 1*X1 + 1; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 1*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 1; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 1*X2; [ a__U21 ] (X0,X1,X2) = 1*X2 + 1*X1 + 1; [ isList ] (X0) = 1*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 1*X1 + 2*X0; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 1*X0; [ U22 ] (X0,X1) = 1*X1 + 1*X0; [ a__U71 ] (X0,X1) = 2*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 1*X1 + 2*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 2*X0; [ a__U42 ] (X0,X1) = 1*X1 + 2*X0 + 1; [ U41 ] (X0,X1,X2) = 1*X2 + 2*X1 + 1; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 1*X1 + 2*X0 + 1; [ U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2; [ isList ] (X0) = 1*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 2*X0; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 2*X0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 2*X0; [ U43 ] (X0) = 2*X0; [ a__isList ] (X0) = 1*X0; [ U22 ] (X0,X1) = 1*X1 + 2*X0 + 1; [ a__U71 ] (X0,X1) = 1*X0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 2*X0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 2*X0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0 + 3; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2; [ U42 ] (X0,X1) = 1*X1; [ a__U22 ] (X0,X1) = 2*X1; [ U21 ] (X0,X1,X2) = 2*X2 + 2*X1; [ a__isNePal ] (X0) = 1*X0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0 + 3; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 1*X2; [ a__U21 ] (X0,X1,X2) = 2*X2 + 2*X1; [ isList ] (X0) = 2*X0; [ a__and ] (X0,X1) = 1*X1 + 2*X0; [ a__U11 ] (X0,X1) = 2*X1 + 2*X0; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 1*X0 + 3; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 2*X0; [ U22 ] (X0,X1) = 2*X1; [ a__U71 ] (X0,X1) = 1*X1 + 1*X0 + 2; [ isNePal ] (X0) = 1*X0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 2*X1 + 2*X0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 2*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0; [ U23 ] (X0) = 1*X0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X1 + 1*X0 + 2; [ a__U42 ] (X0,X1) = 1*X1; [ U41 ] (X0,X1,X2) = 1*X2; [ a__isPal ] (X0) = 1*X0 + 3; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 3*X0 + 1; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 2*X1 + 1; [ U21 ] (X0,X1,X2) = 2*X2 + 2; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 1*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 3*X0 + 1; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 2*X2 + 2; [ isList ] (X0) = 2*X0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 1*X0; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 1*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 2*X0; [ U43 ] (X0) = 2*X0; [ a__isList ] (X0) = 2*X0; [ U22 ] (X0,X1) = 2*X1 + 1; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 1*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 1*X0 + 1; [ U23 ] (X0) = 1*X0 + 1; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 1; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 1*X0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 1; [ isList ] (X0) = 3*X0 + 1; [ a__and ] (X0,X1) = 2*X1 + 1*X0; [ a__U11 ] (X0,X1) = 1*X0 + 1; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 3*X0 + 1; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 1*X0 + 1; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 1*X0; [ and ] (X0,X1) = 2*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 1; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 1*X0 + 1; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 1*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 1; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 2*X0; [ U43 ] (X0) = 2*X0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 1; [ isNePal ] (X0) = 1; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 1*X0 + 1; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1*X2 + 2; [ U42 ] (X0,X1) = 1*X1 + 1; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 2*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 1*X0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 1*X2 + 1*X1; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 2*X0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 2*X1; [ U12 ] (X0) = 2*X0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 1*X0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 1*X0 + 1; [ U43 ] (X0) = 1*X0 + 1; [ a__isList ] (X0) = 2*X0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 1*X0; [ U11 ] (X0,X1) = 2*X1; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 1*X2 + 1*X1; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 1*X0; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 1*X1 + 1; [ U41 ] (X0,X1,X2) = 1*X2 + 2; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 1*X0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 1; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 1*X0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 1*X0 + 2; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 1*X0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 2; [ a__and ] (X0,X1) = 2*X1 + 1*X0; [ a__U11 ] (X0,X1) = 2; [ U12 ] (X0) = 1*X0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 1*X0 + 2; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 2; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 2; [ U11 ] (X0,X1) = 2; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 2; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 1; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ a ] () = 2; [ a__U41 ] (X0,X1,X2) = 2*X2; [ U42 ] (X0,X1) = 2*X1; [ a__U22 ] (X0,X1) = 1*X0; [ U21 ] (X0,X1,X2) = 3*X1; [ a__isNePal ] (X0) = 1*X0; [ U72 ] (X0) = 1*X0; [ a__U12 ] (X0) = 1*X0 + 2; [ u ] () = 2; [ a__U53 ] (X0) = 2; [ U53 ] (X0) = 2; [ a__U32 ] (X0) = 2*X0; [ U31 ] (X0,X1) = 2*X0; [ isPalListKind ] (X0) = 1*X0; [ __ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ i ] () = 2; [ a__U52 ] (X0,X1) = 1*X0 + 1; [ U51 ] (X0,X1,X2) = 2*X1 + 1; [ a__U21 ] (X0,X1,X2) = 3*X1; [ isList ] (X0) = 3*X0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 2*X1 + 1*X0; [ U12 ] (X0) = 1*X0 + 2; [ a__U61 ] (X0,X1) = 1*X0; [ U62 ] (X0) = 1*X0; [ a__U31 ] (X0,X1) = 2*X0; [ isQid ] (X0) = 2; [ isPal ] (X0) = 2*X0; [ mark ] (X0) = 1*X0; [ e ] () = 2; [ a__U43 ] (X0) = 1*X0; [ U43 ] (X0) = 1*X0; [ a__isList ] (X0) = 3*X0; [ U22 ] (X0,X1) = 1*X0; [ a__U71 ] (X0,X1) = 1*X1 + 1*X0; [ isNePal ] (X0) = 1*X0; [ a__isNeList ] (X0) = 2*X0; [ U11 ] (X0,X1) = 2*X1 + 1*X0; [ a__U62 ] (X0) = 1*X0; [ U61 ] (X0,X1) = 1*X0; [ a__isQid ] (X0) = 2; [ U32 ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 2; [ o ] () = 2; [ a__U51 ] (X0,X1,X2) = 2*X1 + 1; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 1*X0 + 1; [ a__U23 ] (X0) = 2; [ U23 ] (X0) = 2; [ a__isPalListKind ] (X0) = 1*X0; [ tt ] () = 2; [ isNeList ] (X0) = 2*X0; [ a__U72 ] (X0) = 1*X0; [ U71 ] (X0,X1) = 1*X1 + 1*X0; [ a__U42 ] (X0,X1) = 2*X1; [ U41 ] (X0,X1,X2) = 2*X2; [ a__isPal ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 1*X0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 2*X0 + 2; [ U31 ] (X0,X1) = 2; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 1*X0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 2*X1 + 2*X0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 2; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 0; [ a__isNeList ] (X0) = 2; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 2*X0 + 2; [ and ] (X0,X1) = 2*X1 + 2*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 2; [ a__U72 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 1*X0; [ U72 ] (X0) = 2*X0 + 1; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 0; [ U31 ] (X0,X1) = 0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 3*X0 + 2; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 2*X0; [ a__U31 ] (X0,X1) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 2*X0 + 1; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 2*X1 + 1; [ isNePal ] (X0) = 1*X0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 2*X0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 2*X0 + 1; [ U71 ] (X0,X1) = 2*X1 + 1; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 2*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 2*X0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 1; [ U72 ] (X0) = 0; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 0; [ U31 ] (X0,X1) = 0; [ isPalListKind ] (X0) = 0; [ __ ] (X0,X1) = 1*X1 + 2*X0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 1*X1 + 1*X0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 1; [ U62 ] (X0) = 2*X0 + 1; [ a__U31 ] (X0,X1) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 1; [ mark ] (X0) = 1*X0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 1; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 2*X0 + 1; [ U61 ] (X0,X1) = 1; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ a____ ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 0; [ a__isNePal ] (X0) = 2*X0 + 0; [ U72 ] (X0) = 0; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 0; [ U31 ] (X0,X1) = 0; [ isPalListKind ] (X0) = 1 + 2*X0 + 0; [ __ ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 0; [ isList ] (X0) = 0; [ a__and ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 0; [ a__U31 ] (X0,X1) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 0; [ mark ] (X0) = 1*X0 + 0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 0; [ isNePal ] (X0) = 2*X0 + 0; [ a__isNeList ] (X0) = 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 0; [ and ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0 + 0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 1 + 2*X0 + 0; [ tt ] () = 0; [ isNeList ] (X0) = 0; [ a__U72 ] (X0) = 0; [ U71 ] (X0,X1) = 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ a____ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ a ] () = 0; [ a__U41 ] (X0,X1,X2) = 0; [ U42 ] (X0,X1) = 0; [ a__U22 ] (X0,X1) = 0; [ U21 ] (X0,X1,X2) = 2 + 0; [ a__isNePal ] (X0) = 1*X0 + 0; [ U72 ] (X0) = 0; [ a__U12 ] (X0) = 0; [ u ] () = 0; [ a__U53 ] (X0) = 0; [ U53 ] (X0) = 0; [ a__U32 ] (X0) = 0; [ U31 ] (X0,X1) = 0; [ isPalListKind ] (X0) = 1*X0 + 0; [ __ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ i ] () = 0; [ a__U52 ] (X0,X1) = 0; [ U51 ] (X0,X1,X2) = 0; [ a__U21 ] (X0,X1,X2) = 2 + 0; [ isList ] (X0) = 2*X0 + 0; [ a__and ] (X0,X1) = 1*X1 + 0; [ a__U11 ] (X0,X1) = 0; [ U12 ] (X0) = 0; [ a__U61 ] (X0,X1) = 0; [ U62 ] (X0) = 0; [ a__U31 ] (X0,X1) = 0; [ isQid ] (X0) = 0; [ isPal ] (X0) = 2 + 0; [ mark ] (X0) = 1*X0 + 0; [ e ] () = 0; [ a__U43 ] (X0) = 0; [ U43 ] (X0) = 0; [ a__isList ] (X0) = 2*X0 + 0; [ U22 ] (X0,X1) = 0; [ a__U71 ] (X0,X1) = 1 + 0; [ isNePal ] (X0) = 1*X0 + 0; [ a__isNeList ] (X0) = 3*X0 + 0; [ U11 ] (X0,X1) = 0; [ a__U62 ] (X0) = 0; [ U61 ] (X0,X1) = 0; [ a__isQid ] (X0) = 0; [ U32 ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 0; [ nil ] () = 0; [ o ] () = 0; [ a__U51 ] (X0,X1,X2) = 0; [ U52 ] (X0,X1) = 0; [ a__U23 ] (X0) = 0; [ U23 ] (X0) = 0; [ a__isPalListKind ] (X0) = 1*X0 + 0; [ Marked_a__isPalListKind ] (X0) = 3*X0 + 0; [ tt ] () = 0; [ isNeList ] (X0) = 3*X0 + 0; [ a__U72 ] (X0) = 0; [ U71 ] (X0,X1) = 1 + 0; [ a__U42 ] (X0,X1) = 0; [ U41 ] (X0,X1,X2) = 0; [ a__isPal ] (X0) = 2 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} Cime worked for 10.165445 seconds (real time) Cime Exit Status: 0