frame.addFormula(cform(form), f);
// Given the above, we can be sure that every column is well-bounded (except possibly the first column).
// Thus, we need to add a bound that the first column is a subset of s.
if (s.isOne==null) {
Expression sr = a2k(s), fr = a2k(f);
for(int i=f.type().arity(); i>1; i--) fr=fr.join(Relation.UNIV);
frame.addFormula(fr.in(sr), f);
}
}
if (s.isOne==null && d.disjoint2!=null) for(ExprHasName f: d.names) {
Decl that = s.oneOf("that");