500
Condition CTM:
Let Condsi be Conds(Q) & §(Conds(V)), and Conds2 be Conds(Q) &-4(Conds(V)). Then,
1. Condsi must be satisfiable.
2. There exists a Boolean combination of built-in predicates, Conds' such that:
(a) Conds 1 is equivalent to (Conds(V)) & Conds',
(b) Conds' involves only the columns in
<KSel(V)) u (Cols(Q) - (j)(Cols(V))),
(c) Group( Q)(CondSi) &
GrouP(Q)(Conds2) is FALSE.