1 /********************* */
2 /*! \file theory_engine.h
4 ** Top contributors (to current version):
5 ** Dejan Jovanovic, Morgan Deters, Andrew Reynolds
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 The theory engine
17 #include "cvc4_private.h"
19 #ifndef CVC4__THEORY_ENGINE_H
20 #define CVC4__THEORY_ENGINE_H
25 #include <unordered_map>
29 #include "base/check.h"
30 #include "context/cdhashset.h"
31 #include "expr/node.h"
32 #include "options/options.h"
33 #include "options/smt_options.h"
34 #include "prop/prop_engine.h"
35 #include "smt/command.h"
36 #include "smt_util/lemma_channels.h"
37 #include "theory/atom_requests.h"
38 #include "theory/decision_manager.h"
39 #include "theory/interrupted.h"
40 #include "theory/rewriter.h"
41 #include "theory/shared_terms_database.h"
42 #include "theory/sort_inference.h"
43 #include "theory/substitutions.h"
44 #include "theory/term_registration_visitor.h"
45 #include "theory/theory.h"
46 #include "theory/uf/equality_engine.h"
47 #include "theory/valuation.h"
48 #include "util/hash.h"
49 #include "util/statistics_registry.h"
50 #include "util/unsafe_interrupt_exception.h"
54 class ResourceManager
;
55 class LemmaProofRecipe
;
58 * A pair of a theory and a node. This is used to mark the flow of
59 * propagations between theories.
61 struct NodeTheoryPair
{
63 theory::TheoryId theory
;
65 NodeTheoryPair(TNode node
, theory::TheoryId theory
, size_t timestamp
= 0)
66 : node(node
), theory(theory
), timestamp(timestamp
) {}
67 NodeTheoryPair() : theory(theory::THEORY_LAST
), timestamp() {}
68 // Comparison doesn't take into account the timestamp
69 bool operator == (const NodeTheoryPair
& pair
) const {
70 return node
== pair
.node
&& theory
== pair
.theory
;
72 };/* struct NodeTheoryPair */
74 struct NodeTheoryPairHashFunction
{
75 NodeHashFunction hashFunction
;
76 // Hash doesn't take into account the timestamp
77 size_t operator()(const NodeTheoryPair
& pair
) const {
78 uint64_t hash
= fnv1a::fnv1a_64(NodeHashFunction()(pair
.node
));
79 return static_cast<size_t>(fnv1a::fnv1a_64(pair
.theory
, hash
));
81 };/* struct NodeTheoryPairHashFunction */
84 /* Forward declarations */
87 class TheoryEngineModelBuilder
;
91 }/* CVC4::theory::eq namespace */
93 namespace quantifiers
{
97 class EntailmentCheckParameters
;
98 class EntailmentCheckSideEffects
;
99 }/* CVC4::theory namespace */
101 class DecisionEngine
;
102 class RemoveTermFormulas
;
105 * This is essentially an abstraction for a collection of theories. A
106 * TheoryEngine provides services to a PropEngine, making various
107 * T-solvers look like a single unit to the propositional part of
112 /** Shared terms database can use the internals notify the theories */
113 friend class SharedTermsDatabase
;
114 friend class theory::quantifiers::TermDb
;
116 /** Associated PropEngine engine */
117 prop::PropEngine
* d_propEngine
;
119 /** Access to decision engine */
120 DecisionEngine
* d_decisionEngine
;
123 context::Context
* d_context
;
125 /** Our user context */
126 context::UserContext
* d_userContext
;
129 * A table of from theory IDs to theory pointers. Never use this table
130 * directly, use theoryOf() instead.
132 theory::Theory
* d_theoryTable
[theory::THEORY_LAST
];
135 * A collection of theories that are "active" for the current run.
136 * This set is provided by the user (as a logic string, say, in SMT-LIBv2
137 * format input), or else by default it's all-inclusive. This is important
138 * because we can optimize for single-theory runs (no sharing), can reduce
139 * the cost of walking the DAG on registration, etc.
141 const LogicInfo
& d_logicInfo
;
144 * The database of shared terms.
146 SharedTermsDatabase d_sharedTerms
;
149 * Master equality engine, to share with theories.
151 theory::eq::EqualityEngine
* d_masterEqualityEngine
;
153 /** notify class for master equality engine */
154 class NotifyClass
: public theory::eq::EqualityEngineNotify
{
157 NotifyClass(TheoryEngine
& te
): d_te(te
) {}
158 bool eqNotifyTriggerEquality(TNode equality
, bool value
) override
162 bool eqNotifyTriggerPredicate(TNode predicate
, bool value
) override
166 bool eqNotifyTriggerTermEquality(theory::TheoryId tag
,
173 void eqNotifyConstantTermMerge(TNode t1
, TNode t2
) override
{}
174 void eqNotifyNewClass(TNode t
) override
{ d_te
.eqNotifyNewClass(t
); }
175 void eqNotifyPreMerge(TNode t1
, TNode t2
) override
178 void eqNotifyPostMerge(TNode t1
, TNode t2
) override
181 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
) override
184 };/* class TheoryEngine::NotifyClass */
185 NotifyClass d_masterEENotify
;
188 * notification methods
190 void eqNotifyNewClass(TNode t
);
191 void eqNotifyPreMerge(TNode t1
, TNode t2
);
192 void eqNotifyPostMerge(TNode t1
, TNode t2
);
193 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
);
196 * The quantifiers engine
198 theory::QuantifiersEngine
* d_quantEngine
;
200 * The decision manager
202 std::unique_ptr
<theory::DecisionManager
> d_decManager
;
205 * Default model object
207 theory::TheoryModel
* d_curr_model
;
208 bool d_aloc_curr_model
;
210 * Model builder object
212 theory::TheoryEngineModelBuilder
* d_curr_model_builder
;
213 bool d_aloc_curr_model_builder
;
214 /** are we in eager model building mode? (see setEagerModelBuilding). */
215 bool d_eager_model_building
;
217 typedef std::unordered_map
<Node
, Node
, NodeHashFunction
> NodeMap
;
218 typedef std::unordered_map
<TNode
, Node
, TNodeHashFunction
> TNodeMap
;
221 * Cache for theory-preprocessing of assertions
226 * Used for "missed-t-propagations" dumping mode only. A set of all
227 * theory-propagable literals.
229 context::CDList
<TNode
> d_possiblePropagations
;
232 * Used for "missed-t-propagations" dumping mode only. A
233 * context-dependent set of those theory-propagable literals that
234 * have been propagated.
236 context::CDHashSet
<Node
, NodeHashFunction
> d_hasPropagated
;
240 * Statistics for a particular theory.
244 static std::string
mkName(std::string prefix
,
245 theory::TheoryId theory
,
246 std::string suffix
) {
247 std::stringstream ss
;
248 ss
<< prefix
<< theory
<< suffix
;
253 IntStat conflicts
, propagations
, lemmas
, requirePhase
, restartDemands
;
255 Statistics(theory::TheoryId theory
);
257 };/* class TheoryEngine::Statistics */
260 * An output channel for Theory that passes messages
261 * back to a TheoryEngine.
263 class EngineOutputChannel
: public theory::OutputChannel
{
264 friend class TheoryEngine
;
267 * The theory engine we're communicating with.
269 TheoryEngine
* d_engine
;
272 * The statistics of the theory interractions.
274 Statistics d_statistics
;
276 /** The theory owning this channel. */
277 theory::TheoryId d_theory
;
280 EngineOutputChannel(TheoryEngine
* engine
, theory::TheoryId theory
)
281 : d_engine(engine
), d_statistics(theory
), d_theory(theory
) {}
283 void safePoint(uint64_t amount
) override
{
284 spendResource(amount
);
285 if (d_engine
->d_interrupted
) {
286 throw theory::Interrupted();
290 void conflict(TNode conflictNode
,
291 std::unique_ptr
<Proof
> pf
= nullptr) override
;
292 bool propagate(TNode literal
) override
;
294 theory::LemmaStatus
lemma(TNode lemma
, ProofRule rule
,
295 bool removable
= false, bool preprocess
= false,
296 bool sendAtoms
= false) override
;
298 theory::LemmaStatus
splitLemma(TNode lemma
,
299 bool removable
= false) override
;
301 void demandRestart() override
{
302 NodeManager
* curr
= NodeManager::currentNM();
303 Node restartVar
= curr
->mkSkolem(
304 "restartVar", curr
->booleanType(),
305 "A boolean variable asserted to be true to force a restart");
306 Trace("theory::restart")
307 << "EngineOutputChannel<" << d_theory
<< ">::restart(" << restartVar
309 ++d_statistics
.restartDemands
;
310 lemma(restartVar
, RULE_INVALID
, true);
313 void requirePhase(TNode n
, bool phase
) override
{
314 Debug("theory") << "EngineOutputChannel::requirePhase(" << n
<< ", "
315 << phase
<< ")" << std::endl
;
316 ++d_statistics
.requirePhase
;
317 d_engine
->d_propEngine
->requirePhase(n
, phase
);
320 void setIncomplete() override
{
321 Trace("theory") << "TheoryEngine::setIncomplete()" << std::endl
;
322 d_engine
->setIncomplete(d_theory
);
325 void spendResource(unsigned amount
) override
{
326 d_engine
->spendResource(amount
);
329 void handleUserAttribute(const char* attr
, theory::Theory
* t
) override
{
330 d_engine
->handleUserAttribute(attr
, t
);
335 * A helper function for registering lemma recipes with the proof engine
337 void registerLemmaRecipe(Node lemma
, Node originalLemma
, bool preprocess
,
338 theory::TheoryId theoryId
);
339 }; /* class TheoryEngine::EngineOutputChannel */
342 * Output channels for individual theories.
344 EngineOutputChannel
* d_theoryOut
[theory::THEORY_LAST
];
347 * Are we in conflict.
349 context::CDO
<bool> d_inConflict
;
352 * Are we in "SAT mode"? In this state, the user can query for the model.
353 * This corresponds to the state in Figure 4.1, page 52 of the SMT-LIB
354 * standard, version 2.6.
359 * Called by the theories to notify of a conflict.
361 void conflict(TNode conflict
, theory::TheoryId theoryId
);
364 * Debugging flag to ensure that shutdown() is called before the
370 * True if a theory has notified us of incompleteness (at this
371 * context level or below).
373 context::CDO
<bool> d_incomplete
;
376 * Called by the theories to notify that the current branch is incomplete.
378 void setIncomplete(theory::TheoryId theory
) {
384 * Mapping of propagations from recievers to senders.
386 typedef context::CDHashMap
<NodeTheoryPair
, NodeTheoryPair
, NodeTheoryPairHashFunction
> PropagationMap
;
387 PropagationMap d_propagationMap
;
390 * Timestamp of propagations
392 context::CDO
<size_t> d_propagationMapTimestamp
;
395 * Literals that are propagated by the theory. Note that these are TNodes.
396 * The theory can only propagate nodes that have an assigned literal in the
397 * SAT solver and are hence referenced in the SAT solver.
399 context::CDList
<TNode
> d_propagatedLiterals
;
402 * The index of the next literal to be propagated by a theory.
404 context::CDO
<unsigned> d_propagatedLiteralsIndex
;
407 * Called by the output channel to propagate literals and facts
408 * @return false if immediate conflict
410 bool propagate(TNode literal
, theory::TheoryId theory
);
413 * Internal method to call the propagation routines and collect the
414 * propagated literals.
416 void propagate(theory::Theory::Effort effort
);
419 * A variable to mark if we added any lemmas.
424 * A variable to mark if the OutputChannel was "used" by any theory
425 * since the start of the last check. If it has been, we require
426 * a FULL_EFFORT check before exiting and reporting SAT.
428 * See the documentation for the needCheck() function, below.
430 bool d_outputChannelUsed
;
432 /** Atom requests from lemmas */
433 AtomRequests d_atomRequests
;
436 * Adds a new lemma, returning its status.
437 * @param node the lemma
438 * @param negated should the lemma be asserted negated
439 * @param removable can the lemma be remove (restrictions apply)
440 * @param needAtoms if not THEORY_LAST, then
442 theory::LemmaStatus
lemma(TNode node
,
447 theory::TheoryId atomsTo
);
449 /** Enusre that the given atoms are send to the given theory */
450 void ensureLemmaAtoms(const std::vector
<TNode
>& atoms
, theory::TheoryId theory
);
452 RemoveTermFormulas
& d_tform_remover
;
454 /** sort inference module */
455 SortInference d_sortInfer
;
457 /** Time spent in theory combination */
458 TimerStat d_combineTheoriesTime
;
463 /** Whether we were just interrupted (or not) */
465 ResourceManager
* d_resourceManager
;
467 /** Container for lemma input and output channels. */
468 LemmaChannels
* d_channels
;
472 /** Constructs a theory engine */
473 TheoryEngine(context::Context
* context
, context::UserContext
* userContext
,
474 RemoveTermFormulas
& iteRemover
, const LogicInfo
& logic
,
475 LemmaChannels
* channels
);
477 /** Destroys a theory engine */
482 /** "Spend" a resource during a search or preprocessing.*/
483 void spendResource(unsigned amount
);
486 * Adds a theory. Only one theory per TheoryId can be present, so if
487 * there is another theory it will be deleted.
489 template <class TheoryClass
>
490 inline void addTheory(theory::TheoryId theoryId
) {
491 Assert(d_theoryTable
[theoryId
] == NULL
&& d_theoryOut
[theoryId
] == NULL
);
492 d_theoryOut
[theoryId
] = new EngineOutputChannel(this, theoryId
);
493 d_theoryTable
[theoryId
] =
494 new TheoryClass(d_context
, d_userContext
, *d_theoryOut
[theoryId
],
495 theory::Valuation(this), d_logicInfo
);
498 inline void setPropEngine(prop::PropEngine
* propEngine
) {
499 Assert(d_propEngine
== NULL
);
500 d_propEngine
= propEngine
;
503 inline void setDecisionEngine(DecisionEngine
* decisionEngine
) {
504 Assert(d_decisionEngine
== NULL
);
505 d_decisionEngine
= decisionEngine
;
508 /** Called when all initialization of options/logic is done */
512 * Get a pointer to the underlying propositional engine.
514 inline prop::PropEngine
* getPropEngine() const {
519 * Get a pointer to the underlying sat context.
521 inline context::Context
* getSatContext() const {
526 * Get a pointer to the underlying user context.
528 inline context::Context
* getUserContext() const {
529 return d_userContext
;
533 * Get a pointer to the underlying quantifiers engine.
535 theory::QuantifiersEngine
* getQuantifiersEngine() const {
536 return d_quantEngine
;
539 * Get a pointer to the underlying decision manager.
541 theory::DecisionManager
* getDecisionManager() const
543 return d_decManager
.get();
548 * Helper for preprocess
550 Node
ppTheoryRewrite(TNode term
);
553 * Queue of nodes for pre-registration.
555 std::queue
<TNode
> d_preregisterQueue
;
558 * Boolean flag denoting we are in pre-registration.
560 bool d_inPreregister
;
563 * Did the theories get any new facts since the last time we called
566 context::CDO
<bool> d_factsAsserted
;
569 * Map from equality atoms to theories that would like to be notified about them.
574 * Assert the formula to the given theory.
575 * @param assertion the assertion to send (not necesserily normalized)
576 * @param original the assertion as it was sent in from the propagating theory
577 * @param toTheoryId the theory to assert to
578 * @param fromTheoryId the theory that sent it
580 void assertToTheory(TNode assertion
, TNode originalAssertion
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
583 * Marks a theory propagation from a theory to a theory where a
584 * theory could be the THEORY_SAT_SOLVER for literals coming from
585 * or being propagated to the SAT solver. If the receiving theory
586 * already recieved the literal, the method returns false, otherwise
589 * @param assertion the normalized assertion being sent
590 * @param originalAssertion the actual assertion that was sent
591 * @param toTheoryId the theory that is on the receiving end
592 * @param fromTheoryId the theory that sent the assertino
593 * @return true if a new assertion, false if theory already got it
595 bool markPropagation(TNode assertion
, TNode originalAssertions
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
598 * Computes the explanation by travarsing the propagation graph and
599 * asking relevant theories to explain the propagations. Initially
600 * the explanation vector should contain only the element (node, theory)
601 * where the node is the one to be explained, and the theory is the
602 * theory that sent the literal. The lemmaProofRecipe will contain a list
603 * of the explanation steps required to produce the original node.
605 void getExplanation(std::vector
<NodeTheoryPair
>& explanationVector
, LemmaProofRecipe
* lemmaProofRecipe
);
610 * Signal the start of a new round of assertion preprocessing
612 void preprocessStart();
615 * Runs theory specific preprocessing on the non-Boolean parts of
616 * the formula. This is only called on input assertions, after ITEs
619 Node
preprocess(TNode node
);
621 /** Notify (preprocessed) assertions. */
622 void notifyPreprocessedAssertions(const std::vector
<Node
>& assertions
);
624 /** Return whether or not we are incomplete (in the current context). */
625 inline bool isIncomplete() const { return d_incomplete
; }
628 * Returns true if we need another round of checking. If this
629 * returns true, check(FULL_EFFORT) _must_ be called by the
630 * propositional layer before reporting SAT.
632 * This is especially necessary for incomplete theories that lazily
633 * output some lemmas on FULL_EFFORT check (e.g. quantifier reasoning
634 * outputing quantifier instantiations). In such a case, a lemma can
635 * be asserted that is simplified away (perhaps it's already true).
636 * However, we must maintain the invariant that, if a theory uses the
637 * OutputChannel, it implicitly requests that another check(FULL_EFFORT)
638 * be performed before exit, even if no new facts are on its fact queue,
639 * as it might decide to further instantiate some lemmas, precluding
642 inline bool needCheck() const {
643 return d_outputChannelUsed
|| d_lemmasAdded
;
647 * This is called at shutdown time by the SmtEngine, just before
648 * destruction. It is important because there are destruction
649 * ordering issues between PropEngine and Theory.
654 * Solve the given literal with a theory that owns it.
656 theory::Theory::PPAssertStatus
solve(TNode literal
,
657 theory::SubstitutionMap
& substitutionOut
);
660 * Preregister a Theory atom with the responsible theory (or
663 void preRegister(TNode preprocessed
);
666 * Assert the formula to the appropriate theory.
667 * @param node the assertion
669 void assertFact(TNode node
);
672 * Check all (currently-active) theories for conflicts.
673 * @param effort the effort level to use
675 void check(theory::Theory::Effort effort
);
678 * Run the combination framework.
680 void combineTheories();
683 * Calls ppStaticLearn() on all theories, accumulating their
684 * combined contributions in the "learned" builder.
686 void ppStaticLearn(TNode in
, NodeBuilder
<>& learned
);
689 * Calls presolve() on all theories and returns true
690 * if one of the theories discovers a conflict.
695 * Calls postsolve() on all theories.
700 * Calls notifyRestart() on all active theories.
702 void notifyRestart();
704 void getPropagatedLiterals(std::vector
<TNode
>& literals
) {
705 for (; d_propagatedLiteralsIndex
< d_propagatedLiterals
.size(); d_propagatedLiteralsIndex
= d_propagatedLiteralsIndex
+ 1) {
706 Debug("getPropagatedLiterals") << "TheoryEngine::getPropagatedLiterals: propagating: " << d_propagatedLiterals
[d_propagatedLiteralsIndex
] << std::endl
;
707 literals
.push_back(d_propagatedLiterals
[d_propagatedLiteralsIndex
]);
712 * Returns the next decision request, or null if none exist. The next
713 * decision request is a literal that this theory engine prefers the SAT
714 * solver to make as its next decision. Decision requests are managed by
715 * the decision manager d_decManager.
717 Node
getNextDecisionRequest();
719 bool properConflict(TNode conflict
) const;
720 bool properPropagation(TNode lit
) const;
721 bool properExplanation(TNode node
, TNode expl
) const;
724 * Returns an explanation of the node propagated to the SAT solver.
726 Node
getExplanation(TNode node
);
729 * Returns an explanation of the node propagated to the SAT solver and the theory
730 * that propagated it.
732 Node
getExplanationAndRecipe(TNode node
, LemmaProofRecipe
* proofRecipe
);
737 bool collectModelInfo(theory::TheoryModel
* m
);
738 /** post process model */
739 void postProcessModel( theory::TheoryModel
* m
);
742 * Get the pointer to the model object used by this theory engine.
744 theory::TheoryModel
* getModel();
746 * Get the current model for the current set of assertions. This method
747 * should only be called immediately after a satisfiable or unknown
748 * response to a check-sat call, and only if produceModels is true.
750 * If the model is not already built, this will cause this theory engine
751 * to build the model.
753 * If the model is not available (for instance, if the last call to check-sat
754 * was interrupted), then this returns the null pointer.
756 theory::TheoryModel
* getBuiltModel();
757 /** set eager model building
759 * If this method is called, then this TheoryEngine will henceforth build
760 * its model immediately after every satisfiability check that results
761 * in a satisfiable or unknown result. The motivation for this mode is to
762 * accomodate API users that get the model object from the TheoryEngine,
763 * where we want to ensure that this model is always valid.
764 * TODO (#2648): revisit this.
766 void setEagerModelBuilding() { d_eager_model_building
= true; }
768 /** get synth solutions
770 * This method returns true if there is a synthesis solution available. This
771 * is the case if the last call to check satisfiability originated in a
772 * check-synth call, and the synthesis solver successfully found a solution
773 * for all active synthesis conjectures.
775 * This method adds entries to sol_map that map functions-to-synthesize with
776 * their solutions, for all active conjectures. This should be called
777 * immediately after the solver answers unsat for sygus input.
779 * For details on what is added to sol_map, see
780 * SynthConjecture::getSynthSolutions.
782 bool getSynthSolutions(std::map
<Node
, Node
>& sol_map
);
785 * Get the model builder
787 theory::TheoryEngineModelBuilder
* getModelBuilder() { return d_curr_model_builder
; }
790 * Get the theory associated to a given Node.
792 * @returns the theory, or NULL if the TNode is
795 inline theory::Theory
* theoryOf(TNode node
) const {
796 return d_theoryTable
[theory::Theory::theoryOf(node
)];
800 * Get the theory associated to a the given theory id.
802 * @returns the theory
804 inline theory::Theory
* theoryOf(theory::TheoryId theoryId
) const {
805 Assert(theoryId
< theory::THEORY_LAST
);
806 return d_theoryTable
[theoryId
];
809 inline bool isTheoryEnabled(theory::TheoryId theoryId
) const {
810 return d_logicInfo
.isTheoryEnabled(theoryId
);
812 /** get the logic info used by this theory engine */
813 const LogicInfo
& getLogicInfo() const;
815 * Returns the equality status of the two terms, from the theory
816 * that owns the domain type. The types of a and b must be the same.
818 theory::EqualityStatus
getEqualityStatus(TNode a
, TNode b
);
821 * Returns the value that a theory that owns the type of var currently
822 * has (or null if none);
824 Node
getModelValue(TNode var
);
827 * Takes a literal and returns an equivalent literal that is guaranteed to be a SAT literal
829 Node
ensureLiteral(TNode n
);
832 * Print all instantiations made by the quantifiers module.
834 void printInstantiations( std::ostream
& out
);
837 * Print solution for synthesis conjectures found by ce_guided_instantiation module
839 void printSynthSolution( std::ostream
& out
);
842 * Get list of quantified formulas that were instantiated
844 void getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
);
847 * Get instantiation methods
848 * first inputs forall x.q[x] and returns ( q[a], ..., q[z] )
849 * second inputs forall x.q[x] and returns ( a, ..., z )
850 * third and fourth return mappings e.g. forall x.q1[x] -> ( q1[a]...q1[z] ) , ... , forall x.qn[x] -> ( qn[a]...qn[z] )
852 void getInstantiations( Node q
, std::vector
< Node
>& insts
);
853 void getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
);
854 void getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
);
855 void getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
);
858 * Get instantiated conjunction, returns q[t1] ^ ... ^ q[tn] where t1...tn are current set of instantiations for q.
859 * Can be used for quantifier elimination when satisfiable and q[t1] ^ ... ^ q[tn] |= q
861 Node
getInstantiatedConjunction( Node q
);
864 * Forwards an entailment check according to the given theoryOfMode.
865 * See theory.h for documentation on entailmentCheck().
867 std::pair
<bool, Node
> entailmentCheck(theory::TheoryOfMode mode
, TNode lit
, const theory::EntailmentCheckParameters
* params
= NULL
, theory::EntailmentCheckSideEffects
* out
= NULL
);
871 /** Default visitor for pre-registration */
872 PreRegisterVisitor d_preRegistrationVisitor
;
874 /** Visitor for collecting shared terms */
875 SharedTermsVisitor d_sharedTermsVisitor
;
877 /** Dump the assertions to the dump */
878 void dumpAssertions(const char* tag
);
880 /** For preprocessing pass lifting bit-vectors of size 1 to booleans */
882 void staticInitializeBVOptions(const std::vector
<Node
>& assertions
);
884 Node
ppSimpITE(TNode assertion
);
885 /** Returns false if an assertion simplified to false. */
886 bool donePPSimpITE(std::vector
<Node
>& assertions
);
888 SharedTermsDatabase
* getSharedTermsDatabase() { return &d_sharedTerms
; }
890 theory::eq::EqualityEngine
* getMasterEqualityEngine() { return d_masterEqualityEngine
; }
892 RemoveTermFormulas
* getTermFormulaRemover() { return &d_tform_remover
; }
894 SortInference
* getSortInference() { return &d_sortInfer
; }
896 /** Prints the assertions to the debug stream */
897 void printAssertions(const char* tag
);
899 /** Theory alternative is in use. */
900 bool useTheoryAlternative(const std::string
& name
);
902 /** Enables using a theory alternative by name. */
903 void enableTheoryAlternative(const std::string
& name
);
906 std::set
< std::string
> d_theoryAlternatives
;
908 std::map
< std::string
, std::vector
< theory::Theory
* > > d_attr_handle
;
911 /** Set user attribute.
913 * This function is called when an attribute is set by a user. In SMT-LIBv2
914 * this is done via the syntax (! n :attr)
916 void setUserAttribute(const std::string
& attr
,
918 const std::vector
<Node
>& node_values
,
919 const std::string
& str_value
);
921 /** Handle user attribute.
923 * Associates theory t with the attribute attr. Theory t will be
924 * notified whenever an attribute of name attr is set.
926 void handleUserAttribute(const char* attr
, theory::Theory
* t
);
929 * Check that the theory assertions are satisfied in the model.
930 * This function is called from the smt engine's checkModel routine.
932 void checkTheoryAssertionsWithModel(bool hardFailure
);
935 IntStat d_arithSubstitutionsAdded
;
937 };/* class TheoryEngine */
939 }/* CVC4 namespace */
941 #endif /* CVC4__THEORY_ENGINE_H */