1 /********************* */
2 /*! \file quantifiers_engine.cpp
4 ** Top contributors (to current version):
5 ** Andrew Reynolds, Morgan Deters, Tim King
6 ** This file is part of the CVC4 project.
7 ** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
8 ** in the top-level source directory) and their institutional affiliations.
9 ** All rights reserved. See the file COPYING in the top-level source
10 ** directory for licensing information.\endverbatim
12 ** \brief Implementation of quantifiers engine class
15 #include "theory/quantifiers_engine.h"
17 #include "options/quantifiers_options.h"
18 #include "options/uf_options.h"
19 #include "smt/smt_statistics_registry.h"
20 #include "theory/quantifiers/alpha_equivalence.h"
21 #include "theory/quantifiers/anti_skolem.h"
22 #include "theory/quantifiers/conjecture_generator.h"
23 #include "theory/quantifiers/ematching/instantiation_engine.h"
24 #include "theory/quantifiers/fmf/bounded_integers.h"
25 #include "theory/quantifiers/fmf/full_model_check.h"
26 #include "theory/quantifiers/fmf/model_engine.h"
27 #include "theory/quantifiers/inst_strategy_enumerative.h"
28 #include "theory/quantifiers/local_theory_ext.h"
29 #include "theory/quantifiers/quant_conflict_find.h"
30 #include "theory/quantifiers/quant_split.h"
31 #include "theory/quantifiers/quantifiers_rewriter.h"
32 #include "theory/quantifiers/sygus/synth_engine.h"
33 #include "theory/sep/theory_sep.h"
34 #include "theory/theory_engine.h"
35 #include "theory/uf/equality_engine.h"
38 using namespace CVC4::kind
;
43 class QuantifiersEnginePrivate
46 QuantifiersEnginePrivate()
48 d_alpha_equiv(nullptr),
49 d_inst_engine(nullptr),
50 d_model_engine(nullptr),
55 d_lte_part_inst(nullptr),
59 d_anti_skolem(nullptr)
62 ~QuantifiersEnginePrivate() {}
63 //------------------------------ private quantifier utilities
64 /** relevant domain */
65 std::unique_ptr
<quantifiers::RelevantDomain
> d_rel_dom
;
66 //------------------------------ end private quantifier utilities
67 //------------------------------ quantifiers modules
68 /** alpha equivalence */
69 std::unique_ptr
<quantifiers::AlphaEquivalence
> d_alpha_equiv
;
70 /** instantiation engine */
71 std::unique_ptr
<quantifiers::InstantiationEngine
> d_inst_engine
;
73 std::unique_ptr
<quantifiers::ModelEngine
> d_model_engine
;
74 /** bounded integers utility */
75 std::unique_ptr
<quantifiers::BoundedIntegers
> d_bint
;
76 /** Conflict find mechanism for quantifiers */
77 std::unique_ptr
<quantifiers::QuantConflictFind
> d_qcf
;
78 /** subgoal generator */
79 std::unique_ptr
<quantifiers::ConjectureGenerator
> d_sg_gen
;
80 /** ceg instantiation */
81 std::unique_ptr
<quantifiers::SynthEngine
> d_synth_e
;
82 /** lte partial instantiation */
83 std::unique_ptr
<quantifiers::LtePartialInst
> d_lte_part_inst
;
84 /** full saturation */
85 std::unique_ptr
<quantifiers::InstStrategyEnum
> d_fs
;
86 /** counterexample-based quantifier instantiation */
87 std::unique_ptr
<quantifiers::InstStrategyCegqi
> d_i_cbqi
;
88 /** quantifiers splitting */
89 std::unique_ptr
<quantifiers::QuantDSplit
> d_qsplit
;
90 /** quantifiers anti-skolemization */
91 std::unique_ptr
<quantifiers::QuantAntiSkolem
> d_anti_skolem
;
92 //------------------------------ end quantifiers modules
95 * This constructs the above modules based on the current options. It adds
96 * a pointer to each module it constructs to modules. This method sets
97 * needsBuilder to true if we require a strategy-specific model builder
100 void initialize(QuantifiersEngine
* qe
,
102 std::vector
<QuantifiersModule
*>& modules
,
105 // add quantifiers modules
106 if (options::quantConflictFind())
108 d_qcf
.reset(new quantifiers::QuantConflictFind(qe
, c
));
109 modules
.push_back(d_qcf
.get());
111 if (options::conjectureGen())
113 d_sg_gen
.reset(new quantifiers::ConjectureGenerator(qe
, c
));
114 modules
.push_back(d_sg_gen
.get());
116 if (!options::finiteModelFind() || options::fmfInstEngine())
118 d_inst_engine
.reset(new quantifiers::InstantiationEngine(qe
));
119 modules
.push_back(d_inst_engine
.get());
123 d_i_cbqi
.reset(new quantifiers::InstStrategyCegqi(qe
));
124 modules
.push_back(d_i_cbqi
.get());
125 qe
->getInstantiate()->addRewriter(d_i_cbqi
->getInstRewriter());
127 if (options::sygus())
129 d_synth_e
.reset(new quantifiers::SynthEngine(qe
, c
));
130 modules
.push_back(d_synth_e
.get());
132 // finite model finding
133 if (options::fmfBound())
135 d_bint
.reset(new quantifiers::BoundedIntegers(c
, qe
));
136 modules
.push_back(d_bint
.get());
138 if (options::finiteModelFind() || options::fmfBound())
140 d_model_engine
.reset(new quantifiers::ModelEngine(c
, qe
));
141 modules
.push_back(d_model_engine
.get());
142 // finite model finder has special ways of building the model
145 if (options::ltePartialInst())
147 d_lte_part_inst
.reset(new quantifiers::LtePartialInst(qe
, c
));
148 modules
.push_back(d_lte_part_inst
.get());
150 if (options::quantDynamicSplit() != options::QuantDSplitMode::NONE
)
152 d_qsplit
.reset(new quantifiers::QuantDSplit(qe
, c
));
153 modules
.push_back(d_qsplit
.get());
155 if (options::quantAntiSkolem())
157 d_anti_skolem
.reset(new quantifiers::QuantAntiSkolem(qe
));
158 modules
.push_back(d_anti_skolem
.get());
160 if (options::quantAlphaEquiv())
162 d_alpha_equiv
.reset(new quantifiers::AlphaEquivalence(qe
));
164 // full saturation : instantiate from relevant domain, then arbitrary terms
165 if (options::fullSaturateQuant() || options::fullSaturateInterleave())
167 d_rel_dom
.reset(new quantifiers::RelevantDomain(qe
));
168 d_fs
.reset(new quantifiers::InstStrategyEnum(qe
, d_rel_dom
.get()));
169 modules
.push_back(d_fs
.get());
174 QuantifiersEngine::QuantifiersEngine(context::Context
* c
,
175 context::UserContext
* u
,
178 d_eq_query(new quantifiers::EqualityQueryQuantifiersEngine(c
, this)),
179 d_tr_trie(new inst::TriggerTrie
),
183 d_term_util(new quantifiers::TermUtil(this)),
184 d_term_canon(new expr::TermCanonize
),
185 d_term_db(new quantifiers::TermDb(c
, u
, this)),
186 d_sygus_tdb(nullptr),
187 d_quant_attr(new quantifiers::QuantAttributes(this)),
188 d_instantiate(new quantifiers::Instantiate(this, u
)),
189 d_skolemize(new quantifiers::Skolemize(this, u
)),
190 d_term_enum(new quantifiers::TermEnumeration
),
191 d_conflict_c(c
, false),
195 d_lemmas_produced_c(u
),
198 // d_ierCounter_lc(c),
199 // d_ierCounterLastLc(c),
203 d_presolve_cache_wq(u
),
204 d_presolve_cache_wic(u
)
206 // initialize the private utility
207 d_private
.reset(new QuantifiersEnginePrivate
);
210 d_util
.push_back(d_eq_query
.get());
211 // term util must come before the other utilities
212 d_util
.push_back(d_term_util
.get());
213 d_util
.push_back(d_term_db
.get());
215 if (options::sygus())
217 d_sygus_tdb
.reset(new quantifiers::TermDbSygus(c
, this));
220 d_util
.push_back(d_instantiate
.get());
222 d_curr_effort_level
= QuantifiersModule::QEFFORT_NONE
;
224 d_hasAddedLemma
= false;
225 d_useModelEe
= false;
226 //don't add true lemma
227 d_lemmas_produced_c
[d_term_util
->d_true
] = true;
229 Trace("quant-engine-debug") << "Initialize quantifiers engine." << std::endl
;
230 Trace("quant-engine-debug") << "Initialize model, mbqi : " << options::mbqiMode() << std::endl
;
232 if( options::quantEpr() ){
233 Assert(!options::incrementalSolving());
234 d_qepr
.reset(new quantifiers::QuantEPR
);
238 //allow theory combination to go first, once initially
239 d_ierCounter
= options::instWhenTcFirst() ? 0 : 1;
240 d_ierCounter_c
= d_ierCounter
;
242 d_ierCounterLastLc
= 0;
243 d_inst_when_phase
= 1 + ( options::instWhenPhase()<1 ? 1 : options::instWhenPhase() );
245 bool needsBuilder
= false;
246 d_private
->initialize(this, c
, d_modules
, needsBuilder
);
248 if (d_private
->d_rel_dom
.get())
250 d_util
.push_back(d_private
->d_rel_dom
.get());
253 // if we require specialized ways of building the model
255 Trace("quant-engine-debug") << "Initialize model engine, mbqi : " << options::mbqiMode() << " " << options::fmfBound() << std::endl
;
256 if (options::mbqiMode() == options::MbqiMode::FMC
257 || options::mbqiMode() == options::MbqiMode::TRUST
258 || options::fmfBound())
260 Trace("quant-engine-debug") << "...make fmc builder." << std::endl
;
261 d_model
.reset(new quantifiers::fmcheck::FirstOrderModelFmc(
262 this, c
, "FirstOrderModelFmc"));
263 d_builder
.reset(new quantifiers::fmcheck::FullModelChecker(c
, this));
265 Trace("quant-engine-debug") << "...make default model builder." << std::endl
;
267 new quantifiers::FirstOrderModel(this, c
, "FirstOrderModel"));
268 d_builder
.reset(new quantifiers::QModelBuilder(c
, this));
271 d_model
.reset(new quantifiers::FirstOrderModel(this, c
, "FirstOrderModel"));
275 QuantifiersEngine::~QuantifiersEngine() {}
277 context::Context
* QuantifiersEngine::getSatContext()
279 return d_te
->theoryOf(THEORY_QUANTIFIERS
)->getSatContext();
282 context::UserContext
* QuantifiersEngine::getUserContext()
284 return d_te
->theoryOf(THEORY_QUANTIFIERS
)->getUserContext();
287 OutputChannel
& QuantifiersEngine::getOutputChannel()
289 return d_te
->theoryOf(THEORY_QUANTIFIERS
)->getOutputChannel();
291 /** get default valuation for the quantifiers engine */
292 Valuation
& QuantifiersEngine::getValuation()
294 return d_te
->theoryOf(THEORY_QUANTIFIERS
)->getValuation();
297 const LogicInfo
& QuantifiersEngine::getLogicInfo() const
299 return d_te
->getLogicInfo();
302 EqualityQuery
* QuantifiersEngine::getEqualityQuery() const
304 return d_eq_query
.get();
306 quantifiers::QModelBuilder
* QuantifiersEngine::getModelBuilder() const
308 return d_builder
.get();
310 quantifiers::QuantEPR
* QuantifiersEngine::getQuantEPR() const
314 quantifiers::FirstOrderModel
* QuantifiersEngine::getModel() const
316 return d_model
.get();
318 quantifiers::TermDb
* QuantifiersEngine::getTermDatabase() const
320 return d_term_db
.get();
322 quantifiers::TermDbSygus
* QuantifiersEngine::getTermDatabaseSygus() const
324 return d_sygus_tdb
.get();
326 quantifiers::TermUtil
* QuantifiersEngine::getTermUtil() const
328 return d_term_util
.get();
330 expr::TermCanonize
* QuantifiersEngine::getTermCanonize() const
332 return d_term_canon
.get();
334 quantifiers::QuantAttributes
* QuantifiersEngine::getQuantAttributes() const
336 return d_quant_attr
.get();
338 quantifiers::Instantiate
* QuantifiersEngine::getInstantiate() const
340 return d_instantiate
.get();
342 quantifiers::Skolemize
* QuantifiersEngine::getSkolemize() const
344 return d_skolemize
.get();
346 quantifiers::TermEnumeration
* QuantifiersEngine::getTermEnumeration() const
348 return d_term_enum
.get();
350 inst::TriggerTrie
* QuantifiersEngine::getTriggerDatabase() const
352 return d_tr_trie
.get();
355 QuantifiersModule
* QuantifiersEngine::getOwner( Node q
) {
356 std::map
< Node
, QuantifiersModule
* >::iterator it
= d_owner
.find( q
);
357 if( it
==d_owner
.end() ){
364 void QuantifiersEngine::setOwner( Node q
, QuantifiersModule
* m
, int priority
) {
365 QuantifiersModule
* mo
= getOwner( q
);
368 if( priority
<=d_owner_priority
[q
] ){
369 Trace("quant-warn") << "WARNING: setting owner of " << q
<< " to " << ( m
? m
->identify() : "null" ) << ", but already has owner " << mo
->identify() << " with higher priority!" << std::endl
;
374 d_owner_priority
[q
] = priority
;
378 void QuantifiersEngine::setOwner(Node q
, quantifiers::QAttributes
& qa
)
380 if (qa
.d_sygus
|| (options::sygusRecFun() && !qa
.d_fundef_f
.isNull()))
382 if (d_private
->d_synth_e
.get() == nullptr)
384 Trace("quant-warn") << "WARNING : synth engine is null, and we have : "
387 // set synth engine as owner since this is either a conjecture or a function
388 // definition to be used by sygus
389 setOwner(q
, d_private
->d_synth_e
.get(), 2);
393 bool QuantifiersEngine::hasOwnership( Node q
, QuantifiersModule
* m
) {
394 QuantifiersModule
* mo
= getOwner( q
);
395 return mo
==m
|| mo
==NULL
;
398 bool QuantifiersEngine::isFiniteBound(Node q
, Node v
) const
400 quantifiers::BoundedIntegers
* bi
= d_private
->d_bint
.get();
401 if (bi
&& bi
->isBound(q
, v
))
405 TypeNode tn
= v
.getType();
406 if (tn
.isSort() && options::finiteModelFind())
410 else if (d_term_enum
->mayComplete(tn
))
417 BoundVarType
QuantifiersEngine::getBoundVarType(Node q
, Node v
) const
419 quantifiers::BoundedIntegers
* bi
= d_private
->d_bint
.get();
422 return bi
->getBoundVarType(q
, v
);
424 return isFiniteBound(q
, v
) ? BOUND_FINITE
: BOUND_NONE
;
427 void QuantifiersEngine::getBoundVarIndices(Node q
,
428 std::vector
<unsigned>& indices
) const
430 Assert(indices
.empty());
431 // we take the bounded variables first
432 quantifiers::BoundedIntegers
* bi
= d_private
->d_bint
.get();
435 bi
->getBoundVarIndices(q
, indices
);
437 // then get the remaining ones
438 for (unsigned i
= 0, nvars
= q
[0].getNumChildren(); i
< nvars
; i
++)
440 if (std::find(indices
.begin(), indices
.end(), i
) == indices
.end())
442 indices
.push_back(i
);
447 bool QuantifiersEngine::getBoundElements(RepSetIterator
* rsi
,
451 std::vector
<Node
>& elements
) const
453 quantifiers::BoundedIntegers
* bi
= d_private
->d_bint
.get();
456 return bi
->getBoundElements(rsi
, initial
, q
, v
, elements
);
461 void QuantifiersEngine::presolve() {
462 Trace("quant-engine-proc") << "QuantifiersEngine : presolve " << std::endl
;
463 for( unsigned i
=0; i
<d_modules
.size(); i
++ ){
464 d_modules
[i
]->presolve();
466 d_term_db
->presolve();
468 //add all terms to database
469 if( options::incrementalSolving() ){
470 Trace("quant-engine-proc") << "Add presolve cache " << d_presolve_cache
.size() << std::endl
;
471 for( unsigned i
=0; i
<d_presolve_cache
.size(); i
++ ){
472 addTermToDatabase( d_presolve_cache
[i
], d_presolve_cache_wq
[i
], d_presolve_cache_wic
[i
] );
474 Trace("quant-engine-proc") << "Done add presolve cache " << std::endl
;
478 void QuantifiersEngine::ppNotifyAssertions(
479 const std::vector
<Node
>& assertions
) {
480 Trace("quant-engine-proc")
481 << "ppNotifyAssertions in QE, #assertions = " << assertions
.size()
482 << " check epr = " << (d_qepr
!= NULL
) << std::endl
;
483 if (options::instLevelInputOnly() && options::instMaxLevel() != -1)
485 for (const Node
& a
: assertions
)
487 quantifiers::QuantAttributes::setInstantiationLevelAttr(a
, 0);
492 for (const Node
& a
: assertions
)
494 d_qepr
->registerAssertion(a
);
496 // must handle sources of other new constants e.g. separation logic
497 // FIXME (as part of project 3) : cleanup
498 sep::TheorySep
* theory_sep
=
499 static_cast<sep::TheorySep
*>(getTheoryEngine()->theoryOf(THEORY_SEP
));
500 theory_sep
->initializeBounds();
501 d_qepr
->finishInit();
503 if (options::sygus())
505 quantifiers::SynthEngine
* sye
= d_private
->d_synth_e
.get();
506 for (const Node
& a
: assertions
)
508 sye
->preregisterAssertion(a
);
513 void QuantifiersEngine::check( Theory::Effort e
){
514 CodeTimer
codeTimer(d_statistics
.d_time
);
515 d_useModelEe
= options::quantModelEe() && ( e
>=Theory::EFFORT_LAST_CALL
);
516 // if we want to use the model's equality engine, build the model now
517 if( d_useModelEe
&& !d_model
->isBuilt() ){
518 Trace("quant-engine-debug") << "Build the model." << std::endl
;
519 if (!d_te
->getModelBuilder()->buildModel(d_model
.get()))
521 //we are done if model building was unsuccessful
523 if( d_hasAddedLemma
){
524 Trace("quant-engine-debug") << "...failed." << std::endl
;
530 if( !getActiveEqualityEngine()->consistent() ){
531 Trace("quant-engine-debug") << "Master equality engine not consistent, return." << std::endl
;
534 if (d_conflict_c
.get())
536 if (e
< Theory::EFFORT_LAST_CALL
)
538 // this can happen in rare cases when quantifiers is the first to realize
539 // there is a quantifier-free conflict, for example, when it discovers
540 // disequal and congruent terms in the master equality engine during
541 // term indexing. In such cases, quantifiers reports a "conflicting lemma"
542 // that is, one that is entailed to be false by the current assignment.
543 // If this lemma is not a SAT conflict, we may get another call to full
544 // effort check and the quantifier-free solvers still haven't realized
545 // there is a conflict. In this case, we return, trusting that theory
546 // combination will do the right thing (split on equalities until there is
547 // a conflict at the quantifier-free level).
548 Trace("quant-engine-debug")
549 << "Conflicting lemma already reported by quantifiers, return."
553 // we reported what we thought was a conflicting lemma, but now we have
554 // gotten a check at LAST_CALL effort, indicating that the lemma we reported
555 // was not conflicting. This should never happen, but in production mode, we
556 // proceed with the check.
559 bool needsCheck
= !d_lemmas_waiting
.empty();
560 QuantifiersModule::QEffort needsModelE
= QuantifiersModule::QEFFORT_NONE
;
561 std::vector
< QuantifiersModule
* > qm
;
562 if( d_model
->checkNeeded() ){
563 needsCheck
= needsCheck
|| e
>=Theory::EFFORT_LAST_CALL
; //always need to check at or above last call
564 for (QuantifiersModule
*& mdl
: d_modules
)
566 if (mdl
->needsCheck(e
))
570 //can only request model at last call since theory combination can find inconsistencies
571 if( e
>=Theory::EFFORT_LAST_CALL
){
572 QuantifiersModule::QEffort me
= mdl
->needsModel(e
);
573 needsModelE
= me
<needsModelE
? me
: needsModelE
;
580 d_hasAddedLemma
= false;
581 bool setIncomplete
= false;
583 Trace("quant-engine-debug2") << "Quantifiers Engine call to check, level = " << e
<< ", needsCheck=" << needsCheck
<< std::endl
;
585 //flush previous lemmas (for instance, if was interupted), or other lemmas to process
587 if( d_hasAddedLemma
){
592 if( Trace
.isOn("quant-engine") ){
593 clSet
= double(clock())/double(CLOCKS_PER_SEC
);
594 Trace("quant-engine") << ">>>>> Quantifiers Engine Round, effort = " << e
<< " <<<<<" << std::endl
;
597 if( Trace
.isOn("quant-engine-debug") ){
598 Trace("quant-engine-debug") << "Quantifiers Engine check, level = " << e
<< std::endl
;
599 Trace("quant-engine-debug") << " depth : " << d_ierCounter_c
<< std::endl
;
600 Trace("quant-engine-debug") << " modules to check : ";
601 for( unsigned i
=0; i
<qm
.size(); i
++ ){
602 Trace("quant-engine-debug") << qm
[i
]->identify() << " ";
604 Trace("quant-engine-debug") << std::endl
;
605 Trace("quant-engine-debug") << " # quantified formulas = " << d_model
->getNumAssertedQuantifiers() << std::endl
;
606 if( !d_lemmas_waiting
.empty() ){
607 Trace("quant-engine-debug") << " lemmas waiting = " << d_lemmas_waiting
.size() << std::endl
;
609 Trace("quant-engine-debug")
610 << " Theory engine finished : " << !theoryEngineNeedsCheck()
612 Trace("quant-engine-debug") << " Needs model effort : " << needsModelE
<< std::endl
;
614 if( Trace
.isOn("quant-engine-ee-pre") ){
615 Trace("quant-engine-ee-pre") << "Equality engine (pre-inference): " << std::endl
;
616 debugPrintEqualityEngine( "quant-engine-ee-pre" );
618 if( Trace
.isOn("quant-engine-assert") ){
619 Trace("quant-engine-assert") << "Assertions : " << std::endl
;
620 getTheoryEngine()->printAssertions("quant-engine-assert");
624 Trace("quant-engine-debug") << "Resetting all utilities..." << std::endl
;
625 for (QuantifiersUtil
*& util
: d_util
)
627 Trace("quant-engine-debug2") << "Reset " << util
->identify().c_str()
628 << "..." << std::endl
;
632 if( d_hasAddedLemma
){
635 //should only fail reset if added a lemma
641 if( Trace
.isOn("quant-engine-ee") ){
642 Trace("quant-engine-ee") << "Equality engine : " << std::endl
;
643 debugPrintEqualityEngine( "quant-engine-ee" );
647 Trace("quant-engine-debug") << "Reset model..." << std::endl
;
648 d_model
->reset_round();
651 Trace("quant-engine-debug") << "Resetting all modules..." << std::endl
;
652 for (QuantifiersModule
*& mdl
: d_modules
)
654 Trace("quant-engine-debug2") << "Reset " << mdl
->identify().c_str()
658 Trace("quant-engine-debug") << "Done resetting all modules." << std::endl
;
659 //reset may have added lemmas
661 if( d_hasAddedLemma
){
665 if( e
==Theory::EFFORT_LAST_CALL
){
666 ++(d_statistics
.d_instantiation_rounds_lc
);
667 }else if( e
==Theory::EFFORT_FULL
){
668 ++(d_statistics
.d_instantiation_rounds
);
670 Trace("quant-engine-debug") << "Check modules that needed check..." << std::endl
;
671 for (unsigned qef
= QuantifiersModule::QEFFORT_CONFLICT
;
672 qef
<= QuantifiersModule::QEFFORT_LAST_CALL
;
675 QuantifiersModule::QEffort quant_e
=
676 static_cast<QuantifiersModule::QEffort
>(qef
);
677 d_curr_effort_level
= quant_e
;
678 //build the model if any module requested it
679 if (needsModelE
== quant_e
)
681 if (!d_model
->isBuilt())
683 // theory engine's model builder is quantifier engine's builder if it
685 Assert(!getModelBuilder()
686 || getModelBuilder() == d_te
->getModelBuilder());
687 Trace("quant-engine-debug") << "Build model..." << std::endl
;
688 if (!d_te
->getModelBuilder()->buildModel(d_model
.get()))
693 if (!d_model
->isBuiltSuccess())
698 if( !d_hasAddedLemma
){
700 for (QuantifiersModule
*& mdl
: qm
)
702 Trace("quant-engine-debug") << "Check " << mdl
->identify().c_str()
703 << " at effort " << quant_e
<< "..."
705 mdl
->check(e
, quant_e
);
707 Trace("quant-engine-debug") << "...conflict!" << std::endl
;
711 //flush all current lemmas
714 //if we have added one, stop
715 if( d_hasAddedLemma
){
719 if (quant_e
== QuantifiersModule::QEFFORT_CONFLICT
)
721 if( e
==Theory::EFFORT_FULL
){
722 //increment if a last call happened, we are not strictly enforcing interleaving, or already were in phase
723 if( d_ierCounterLastLc
!=d_ierCounter_lc
|| !options::instWhenStrictInterleave() || d_ierCounter
%d_inst_when_phase
!=0 ){
724 d_ierCounter
= d_ierCounter
+ 1;
725 d_ierCounterLastLc
= d_ierCounter_lc
;
726 d_ierCounter_c
= d_ierCounter_c
.get() + 1;
728 }else if( e
==Theory::EFFORT_LAST_CALL
){
729 d_ierCounter_lc
= d_ierCounter_lc
+ 1;
732 else if (quant_e
== QuantifiersModule::QEFFORT_MODEL
)
734 if( e
==Theory::EFFORT_LAST_CALL
){
735 //sources of incompleteness
736 for (QuantifiersUtil
*& util
: d_util
)
738 if (!util
->checkComplete())
740 Trace("quant-engine-debug") << "Set incomplete because utility "
741 << util
->identify().c_str()
742 << " was incomplete." << std::endl
;
743 setIncomplete
= true;
746 if (d_conflict_c
.get())
748 // we reported a conflicting lemma, should return
749 setIncomplete
= true;
751 //if we have a chance not to set incomplete
752 if( !setIncomplete
){
753 //check if we should set the incomplete flag
754 for (QuantifiersModule
*& mdl
: d_modules
)
756 if (!mdl
->checkComplete())
758 Trace("quant-engine-debug")
759 << "Set incomplete because module "
760 << mdl
->identify().c_str() << " was incomplete."
762 setIncomplete
= true;
766 if( !setIncomplete
){
767 //look at individual quantified formulas, one module must claim completeness for each one
768 for( unsigned i
=0; i
<d_model
->getNumAssertedQuantifiers(); i
++ ){
769 bool hasCompleteM
= false;
770 Node q
= d_model
->getAssertedQuantifier( i
);
771 QuantifiersModule
* qmd
= getOwner( q
);
773 hasCompleteM
= qmd
->checkCompleteFor( q
);
775 for( unsigned j
=0; j
<d_modules
.size(); j
++ ){
776 if( d_modules
[j
]->checkCompleteFor( q
) ){
784 Trace("quant-engine-debug") << "Set incomplete because " << q
<< " was not fully processed." << std::endl
;
785 setIncomplete
= true;
789 Trace("quant-engine-debug2") << "Complete for " << q
<< " due to " << qmd
->identify().c_str() << std::endl
;
794 //if setIncomplete = false, we will answer SAT, otherwise we will run at quant_e QEFFORT_LAST_CALL
795 if( !setIncomplete
){
802 d_curr_effort_level
= QuantifiersModule::QEFFORT_NONE
;
803 Trace("quant-engine-debug") << "Done check modules that needed check." << std::endl
;
804 if( d_hasAddedLemma
){
805 d_instantiate
->debugPrint();
807 if( Trace
.isOn("quant-engine") ){
808 double clSet2
= double(clock())/double(CLOCKS_PER_SEC
);
809 Trace("quant-engine") << "Finished quantifiers engine, total time = " << (clSet2
-clSet
);
810 Trace("quant-engine") << ", added lemma = " << d_hasAddedLemma
;
811 Trace("quant-engine") << std::endl
;
814 Trace("quant-engine-debug2") << "Finished quantifiers engine check." << std::endl
;
816 Trace("quant-engine-debug2") << "Quantifiers Engine does not need check." << std::endl
;
820 if( e
==Theory::EFFORT_LAST_CALL
&& !d_hasAddedLemma
){
822 Trace("quant-engine") << "Set incomplete flag." << std::endl
;
823 getOutputChannel().setIncomplete();
826 d_instantiate
->debugPrintModel();
830 void QuantifiersEngine::notifyCombineTheories() {
831 //if allowing theory combination to happen at most once between instantiation rounds
833 //d_ierCounterLastLc = -1;
836 bool QuantifiersEngine::reduceQuantifier( Node q
) {
837 //TODO: this can be unified with preregistration: AlphaEquivalence takes ownership of reducable quants
838 BoolMap::const_iterator it
= d_quants_red
.find( q
);
839 if( it
==d_quants_red
.end() ){
841 std::map
< Node
, Node
>::iterator itr
= d_quants_red_lem
.find( q
);
842 if( itr
==d_quants_red_lem
.end() ){
843 if (d_private
->d_alpha_equiv
)
845 Trace("quant-engine-red") << "Alpha equivalence " << q
<< "?" << std::endl
;
846 //add equivalence with another quantified formula
847 lem
= d_private
->d_alpha_equiv
->reduceQuantifier(q
);
849 Trace("quant-engine-red") << "...alpha equivalence success." << std::endl
;
850 ++(d_statistics
.d_red_alpha_equiv
);
853 d_quants_red_lem
[q
] = lem
;
858 getOutputChannel().lemma( lem
);
860 d_quants_red
[q
] = !lem
.isNull();
861 return !lem
.isNull();
867 void QuantifiersEngine::registerQuantifierInternal(Node f
)
869 std::map
< Node
, bool >::iterator it
= d_quants
.find( f
);
870 if( it
==d_quants
.end() ){
871 Trace("quant") << "QuantifiersEngine : Register quantifier ";
872 Trace("quant") << " : " << f
<< std::endl
;
873 unsigned prev_lemma_waiting
= d_lemmas_waiting
.size();
874 ++(d_statistics
.d_num_quant
);
875 Assert(f
.getKind() == FORALL
);
876 // register with utilities
877 for (unsigned i
= 0; i
< d_util
.size(); i
++)
879 d_util
[i
]->registerQuantifier(f
);
881 // compute attributes
882 d_quant_attr
->computeAttributes(f
);
884 for (QuantifiersModule
*& mdl
: d_modules
)
886 Trace("quant-debug") << "check ownership with " << mdl
->identify()
887 << "..." << std::endl
;
888 mdl
->checkOwnership(f
);
890 QuantifiersModule
* qm
= getOwner(f
);
891 Trace("quant") << " Owner : " << (qm
== nullptr ? "[none]" : qm
->identify())
893 // register with each module
894 for (QuantifiersModule
*& mdl
: d_modules
)
896 Trace("quant-debug") << "register with " << mdl
->identify() << "..."
898 mdl
->registerQuantifier(f
);
899 // since this is context-independent, we should not add any lemmas during
901 Assert(d_lemmas_waiting
.size() == prev_lemma_waiting
);
903 Trace("quant-debug") << "...finish." << std::endl
;
905 AlwaysAssert(d_lemmas_waiting
.size() == prev_lemma_waiting
);
909 void QuantifiersEngine::preRegisterQuantifier(Node q
)
911 NodeSet::const_iterator it
= d_quants_prereg
.find(q
);
912 if (it
!= d_quants_prereg
.end())
916 Trace("quant-debug") << "QuantifiersEngine : Pre-register " << q
<< std::endl
;
917 d_quants_prereg
.insert(q
);
919 if (reduceQuantifier(q
))
921 // if we can reduce it, nothing left to do
924 // ensure that it is registered
925 registerQuantifierInternal(q
);
926 // register with each module
927 for (QuantifiersModule
*& mdl
: d_modules
)
929 Trace("quant-debug") << "pre-register with " << mdl
->identify() << "..."
931 mdl
->preRegisterQuantifier(q
);
935 Trace("quant-debug") << "...finish pre-register " << q
<< "..." << std::endl
;
938 void QuantifiersEngine::registerPattern( std::vector
<Node
> & pattern
) {
939 for(std::vector
<Node
>::iterator p
= pattern
.begin(); p
!= pattern
.end(); ++p
){
940 std::set
< Node
> added
;
941 getTermDatabase()->addTerm( *p
, added
);
945 void QuantifiersEngine::assertQuantifier( Node f
, bool pol
){
946 if (reduceQuantifier(f
))
948 // if we can reduce it, nothing left to do
953 Node lem
= d_skolemize
->process(f
);
956 if (Trace
.isOn("quantifiers-sk-debug"))
958 Node slem
= Rewriter::rewrite(lem
);
959 Trace("quantifiers-sk-debug")
960 << "Skolemize lemma : " << slem
<< std::endl
;
962 getOutputChannel().lemma(lem
, false, true);
966 // ensure the quantified formula is registered
967 registerQuantifierInternal(f
);
968 // assert it to each module
969 d_model
->assertQuantifier(f
);
970 for (QuantifiersModule
*& mdl
: d_modules
)
974 addTermToDatabase(d_term_util
->getInstConstantBody(f
), true);
977 void QuantifiersEngine::addTermToDatabase( Node n
, bool withinQuant
, bool withinInstClosure
){
978 if( options::incrementalSolving() ){
979 if( d_presolve_in
.find( n
)==d_presolve_in
.end() ){
980 d_presolve_in
.insert( n
);
981 d_presolve_cache
.push_back( n
);
982 d_presolve_cache_wq
.push_back( withinQuant
);
983 d_presolve_cache_wic
.push_back( withinInstClosure
);
986 //only wait if we are doing incremental solving
987 if( !d_presolve
|| !options::incrementalSolving() ){
988 std::set
< Node
> added
;
989 d_term_db
->addTerm(n
, added
, withinQuant
, withinInstClosure
);
993 if (d_sygus_tdb
&& options::sygusEvalUnfold())
995 d_sygus_tdb
->getEvalUnfold()->registerEvalTerm(n
);
1001 void QuantifiersEngine::eqNotifyNewClass(TNode t
) {
1002 addTermToDatabase( t
);
1005 bool QuantifiersEngine::addLemma( Node lem
, bool doCache
, bool doRewrite
){
1008 lem
= Rewriter::rewrite(lem
);
1010 Trace("inst-add-debug") << "Adding lemma : " << lem
<< std::endl
;
1011 BoolMap::const_iterator itp
= d_lemmas_produced_c
.find( lem
);
1012 if( itp
==d_lemmas_produced_c
.end() || !(*itp
).second
){
1013 //d_curr_out->lemma( lem, false, true );
1014 d_lemmas_produced_c
[ lem
] = true;
1015 d_lemmas_waiting
.push_back( lem
);
1016 Trace("inst-add-debug") << "Added lemma" << std::endl
;
1019 Trace("inst-add-debug") << "Duplicate." << std::endl
;
1023 //do not need to rewrite, will be rewritten after sending
1024 d_lemmas_waiting
.push_back( lem
);
1029 bool QuantifiersEngine::removeLemma( Node lem
) {
1030 std::vector
< Node
>::iterator it
= std::find( d_lemmas_waiting
.begin(), d_lemmas_waiting
.end(), lem
);
1031 if( it
!=d_lemmas_waiting
.end() ){
1032 d_lemmas_waiting
.erase( it
, it
+ 1 );
1033 d_lemmas_produced_c
[ lem
] = false;
1040 void QuantifiersEngine::addRequirePhase( Node lit
, bool req
){
1041 d_phase_req_waiting
[lit
] = req
;
1044 void QuantifiersEngine::markRelevant( Node q
) {
1045 d_model
->markRelevant( q
);
1047 bool QuantifiersEngine::hasAddedLemma() const
1049 return !d_lemmas_waiting
.empty() || d_hasAddedLemma
;
1051 bool QuantifiersEngine::theoryEngineNeedsCheck() const
1053 return d_te
->needCheck();
1056 void QuantifiersEngine::setConflict() {
1058 d_conflict_c
= true;
1061 bool QuantifiersEngine::getInstWhenNeedsCheck( Theory::Effort e
) {
1062 Trace("quant-engine-debug2") << "Get inst when needs check, counts=" << d_ierCounter
<< ", " << d_ierCounter_lc
<< std::endl
;
1063 //determine if we should perform check, based on instWhenMode
1064 bool performCheck
= false;
1065 if (options::instWhenMode() == options::InstWhenMode::FULL
)
1067 performCheck
= ( e
>= Theory::EFFORT_FULL
);
1069 else if (options::instWhenMode() == options::InstWhenMode::FULL_DELAY
)
1071 performCheck
= (e
>= Theory::EFFORT_FULL
) && !theoryEngineNeedsCheck();
1073 else if (options::instWhenMode() == options::InstWhenMode::FULL_LAST_CALL
)
1075 performCheck
= ( ( e
==Theory::EFFORT_FULL
&& d_ierCounter
%d_inst_when_phase
!=0 ) || e
==Theory::EFFORT_LAST_CALL
);
1077 else if (options::instWhenMode()
1078 == options::InstWhenMode::FULL_DELAY_LAST_CALL
)
1080 performCheck
= ((e
== Theory::EFFORT_FULL
&& !theoryEngineNeedsCheck()
1081 && d_ierCounter
% d_inst_when_phase
!= 0)
1082 || e
== Theory::EFFORT_LAST_CALL
);
1084 else if (options::instWhenMode() == options::InstWhenMode::LAST_CALL
)
1086 performCheck
= ( e
>= Theory::EFFORT_LAST_CALL
);
1090 performCheck
= true;
1092 if( e
==Theory::EFFORT_LAST_CALL
){
1093 //with bounded integers, skip every other last call,
1094 // since matching loops may occur with infinite quantification
1095 if( d_ierCounter_lc
%2==0 && options::fmfBound() ){
1096 performCheck
= false;
1099 return performCheck
;
1102 options::UserPatMode
QuantifiersEngine::getInstUserPatMode()
1104 if (options::userPatternsQuant() == options::UserPatMode::INTERLEAVE
)
1106 return d_ierCounter
% 2 == 0 ? options::UserPatMode::USE
1107 : options::UserPatMode::RESORT
;
1111 return options::userPatternsQuant();
1115 void QuantifiersEngine::flushLemmas(){
1116 if( !d_lemmas_waiting
.empty() ){
1117 //take default output channel if none is provided
1118 d_hasAddedLemma
= true;
1119 for( unsigned i
=0; i
<d_lemmas_waiting
.size(); i
++ ){
1120 Trace("qe-lemma") << "Lemma : " << d_lemmas_waiting
[i
] << std::endl
;
1121 getOutputChannel().lemma( d_lemmas_waiting
[i
], false, true );
1123 d_lemmas_waiting
.clear();
1125 if( !d_phase_req_waiting
.empty() ){
1126 for( std::map
< Node
, bool >::iterator it
= d_phase_req_waiting
.begin(); it
!= d_phase_req_waiting
.end(); ++it
){
1127 Trace("qe-lemma") << "Require phase : " << it
->first
<< " -> " << it
->second
<< std::endl
;
1128 getOutputChannel().requirePhase( it
->first
, it
->second
);
1130 d_phase_req_waiting
.clear();
1134 bool QuantifiersEngine::getUnsatCoreLemmas( std::vector
< Node
>& active_lemmas
) {
1135 return d_instantiate
->getUnsatCoreLemmas(active_lemmas
);
1138 bool QuantifiersEngine::getUnsatCoreLemmas( std::vector
< Node
>& active_lemmas
, std::map
< Node
, Node
>& weak_imp
) {
1139 return d_instantiate
->getUnsatCoreLemmas(active_lemmas
, weak_imp
);
1142 void QuantifiersEngine::getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
) {
1143 d_instantiate
->getInstantiationTermVectors(q
, tvecs
);
1146 void QuantifiersEngine::getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
) {
1147 d_instantiate
->getInstantiationTermVectors(insts
);
1150 void QuantifiersEngine::getExplanationForInstLemmas(
1151 const std::vector
<Node
>& lems
,
1152 std::map
<Node
, Node
>& quant
,
1153 std::map
<Node
, std::vector
<Node
> >& tvec
)
1155 d_instantiate
->getExplanationForInstLemmas(lems
, quant
, tvec
);
1158 void QuantifiersEngine::printInstantiations( std::ostream
& out
) {
1159 bool printed
= false;
1160 // print the skolemizations
1161 if (d_skolemize
->printSkolemization(out
))
1165 // print the instantiations
1166 if (d_instantiate
->printInstantiations(out
))
1171 out
<< "No instantiations" << std::endl
;
1175 void QuantifiersEngine::printSynthSolution( std::ostream
& out
) {
1176 if (d_private
->d_synth_e
)
1178 d_private
->d_synth_e
->printSynthSolution(out
);
1180 out
<< "Internal error : module for synth solution not found." << std::endl
;
1184 void QuantifiersEngine::getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
) {
1185 d_instantiate
->getInstantiatedQuantifiedFormulas(qs
);
1188 void QuantifiersEngine::getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
) {
1189 d_instantiate
->getInstantiations(insts
);
1192 void QuantifiersEngine::getInstantiations( Node q
, std::vector
< Node
>& insts
) {
1193 d_instantiate
->getInstantiations(q
, insts
);
1196 Node
QuantifiersEngine::getInstantiatedConjunction( Node q
) {
1197 return d_instantiate
->getInstantiatedConjunction(q
);
1200 QuantifiersEngine::Statistics::Statistics()
1201 : d_time("theory::QuantifiersEngine::time"),
1202 d_qcf_time("theory::QuantifiersEngine::time_qcf"),
1203 d_ematching_time("theory::QuantifiersEngine::time_ematching"),
1204 d_num_quant("QuantifiersEngine::Num_Quantifiers", 0),
1205 d_instantiation_rounds("QuantifiersEngine::Rounds_Instantiation_Full", 0),
1206 d_instantiation_rounds_lc("QuantifiersEngine::Rounds_Instantiation_Last_Call", 0),
1207 d_triggers("QuantifiersEngine::Triggers", 0),
1208 d_simple_triggers("QuantifiersEngine::Triggers_Simple", 0),
1209 d_multi_triggers("QuantifiersEngine::Triggers_Multi", 0),
1210 d_multi_trigger_instantiations("QuantifiersEngine::Multi_Trigger_Instantiations", 0),
1211 d_red_alpha_equiv("QuantifiersEngine::Reductions_Alpha_Equivalence", 0),
1212 d_instantiations_user_patterns("QuantifiersEngine::Instantiations_User_Patterns", 0),
1213 d_instantiations_auto_gen("QuantifiersEngine::Instantiations_Auto_Gen", 0),
1214 d_instantiations_guess("QuantifiersEngine::Instantiations_Guess", 0),
1215 d_instantiations_qcf("QuantifiersEngine::Instantiations_Qcf_Conflict", 0),
1216 d_instantiations_qcf_prop("QuantifiersEngine::Instantiations_Qcf_Prop", 0),
1217 d_instantiations_fmf_exh("QuantifiersEngine::Instantiations_Fmf_Exh", 0),
1218 d_instantiations_fmf_mbqi("QuantifiersEngine::Instantiations_Fmf_Mbqi", 0),
1219 d_instantiations_cbqi("QuantifiersEngine::Instantiations_Cbqi", 0),
1220 d_instantiations_rr("QuantifiersEngine::Instantiations_Rewrite_Rules", 0)
1222 smtStatisticsRegistry()->registerStat(&d_time
);
1223 smtStatisticsRegistry()->registerStat(&d_qcf_time
);
1224 smtStatisticsRegistry()->registerStat(&d_ematching_time
);
1225 smtStatisticsRegistry()->registerStat(&d_num_quant
);
1226 smtStatisticsRegistry()->registerStat(&d_instantiation_rounds
);
1227 smtStatisticsRegistry()->registerStat(&d_instantiation_rounds_lc
);
1228 smtStatisticsRegistry()->registerStat(&d_triggers
);
1229 smtStatisticsRegistry()->registerStat(&d_simple_triggers
);
1230 smtStatisticsRegistry()->registerStat(&d_multi_triggers
);
1231 smtStatisticsRegistry()->registerStat(&d_multi_trigger_instantiations
);
1232 smtStatisticsRegistry()->registerStat(&d_red_alpha_equiv
);
1233 smtStatisticsRegistry()->registerStat(&d_instantiations_user_patterns
);
1234 smtStatisticsRegistry()->registerStat(&d_instantiations_auto_gen
);
1235 smtStatisticsRegistry()->registerStat(&d_instantiations_guess
);
1236 smtStatisticsRegistry()->registerStat(&d_instantiations_qcf
);
1237 smtStatisticsRegistry()->registerStat(&d_instantiations_qcf_prop
);
1238 smtStatisticsRegistry()->registerStat(&d_instantiations_fmf_exh
);
1239 smtStatisticsRegistry()->registerStat(&d_instantiations_fmf_mbqi
);
1240 smtStatisticsRegistry()->registerStat(&d_instantiations_cbqi
);
1241 smtStatisticsRegistry()->registerStat(&d_instantiations_rr
);
1244 QuantifiersEngine::Statistics::~Statistics(){
1245 smtStatisticsRegistry()->unregisterStat(&d_time
);
1246 smtStatisticsRegistry()->unregisterStat(&d_qcf_time
);
1247 smtStatisticsRegistry()->unregisterStat(&d_ematching_time
);
1248 smtStatisticsRegistry()->unregisterStat(&d_num_quant
);
1249 smtStatisticsRegistry()->unregisterStat(&d_instantiation_rounds
);
1250 smtStatisticsRegistry()->unregisterStat(&d_instantiation_rounds_lc
);
1251 smtStatisticsRegistry()->unregisterStat(&d_triggers
);
1252 smtStatisticsRegistry()->unregisterStat(&d_simple_triggers
);
1253 smtStatisticsRegistry()->unregisterStat(&d_multi_triggers
);
1254 smtStatisticsRegistry()->unregisterStat(&d_multi_trigger_instantiations
);
1255 smtStatisticsRegistry()->unregisterStat(&d_red_alpha_equiv
);
1256 smtStatisticsRegistry()->unregisterStat(&d_instantiations_user_patterns
);
1257 smtStatisticsRegistry()->unregisterStat(&d_instantiations_auto_gen
);
1258 smtStatisticsRegistry()->unregisterStat(&d_instantiations_guess
);
1259 smtStatisticsRegistry()->unregisterStat(&d_instantiations_qcf
);
1260 smtStatisticsRegistry()->unregisterStat(&d_instantiations_qcf_prop
);
1261 smtStatisticsRegistry()->unregisterStat(&d_instantiations_fmf_exh
);
1262 smtStatisticsRegistry()->unregisterStat(&d_instantiations_fmf_mbqi
);
1263 smtStatisticsRegistry()->unregisterStat(&d_instantiations_cbqi
);
1264 smtStatisticsRegistry()->unregisterStat(&d_instantiations_rr
);
1267 eq::EqualityEngine
* QuantifiersEngine::getMasterEqualityEngine() const
1269 return d_te
->getMasterEqualityEngine();
1272 eq::EqualityEngine
* QuantifiersEngine::getActiveEqualityEngine() const
1275 return d_model
->getEqualityEngine();
1277 return d_te
->getMasterEqualityEngine();
1280 Node
QuantifiersEngine::getInternalRepresentative( Node a
, Node q
, int index
){
1281 bool prevModelEe
= d_useModelEe
;
1282 d_useModelEe
= false;
1283 Node ret
= d_eq_query
->getInternalRepresentative( a
, q
, index
);
1284 d_useModelEe
= prevModelEe
;
1288 bool QuantifiersEngine::getSynthSolutions(
1289 std::map
<Node
, std::map
<Node
, Node
> >& sol_map
)
1291 return d_private
->d_synth_e
->getSynthSolutions(sol_map
);
1294 void QuantifiersEngine::debugPrintEqualityEngine( const char * c
) {
1295 eq::EqualityEngine
* ee
= getActiveEqualityEngine();
1296 eq::EqClassesIterator eqcs_i
= eq::EqClassesIterator( ee
);
1297 std::map
< TypeNode
, int > typ_num
;
1298 while( !eqcs_i
.isFinished() ){
1299 TNode r
= (*eqcs_i
);
1300 TypeNode tr
= r
.getType();
1301 if( typ_num
.find( tr
)==typ_num
.end() ){
1305 bool firstTime
= true;
1306 Trace(c
) << " " << r
;
1307 Trace(c
) << " : { ";
1308 eq::EqClassIterator eqc_i
= eq::EqClassIterator( r
, ee
);
1309 while( !eqc_i
.isFinished() ){
1313 Trace(c
) << std::endl
;
1316 Trace(c
) << " " << n
<< std::endl
;
1320 if( !firstTime
){ Trace(c
) << " "; }
1321 Trace(c
) << "}" << std::endl
;
1324 Trace(c
) << std::endl
;
1325 for( std::map
< TypeNode
, int >::iterator it
= typ_num
.begin(); it
!= typ_num
.end(); ++it
){
1326 Trace(c
) << "# eqc for " << it
->first
<< " : " << it
->second
<< std::endl
;
1330 } // namespace theory