for (const TNode& t : itt->second)
{
if (!options::sygusSymBreakLazy()
- || d_active_terms.find(t) != d_active_terms.end()
- && !it->second.empty())
+ || (d_active_terms.find(t) != d_active_terms.end()
+ && !it->second.empty()))
{
Node rlv = getRelevancyCondition(t);
std::unordered_map<TNode, TNode, TNodeHashFunction> cache;
// also, treat it as clause if possible
if (cln.getNumChildren() > 0
- & (bcp_kinds.empty()
- || bcp_kinds.find(cln.getKind()) != bcp_kinds.end()))
+ && (bcp_kinds.empty()
+ || bcp_kinds.find(cln.getKind()) != bcp_kinds.end()))
{
if (std::find(clauses.begin(), clauses.end(), cn) == clauses.end()
&& prop_clauses.find(cn) == prop_clauses.end())