SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
NewGBPPModule.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include "NewGBPPSettings.h"
5 
6 namespace smtrat {
7 template<typename Settings>
8 class NewGBPPModule : public PModule {
9 
10 public:
12  NewGBPPModule(const ModuleInput* _formula, Conditionals& _conditionals, Manager* _manager = nullptr);
14  void updateModel() const { mModel.clear(); };
16 };
17 } // namespace smtrat
All preprocessing modules shall derive from this module, that is modules, which simplify their receiv...
Base class for solvers.
Definition: Manager.h:34
The input formula a module has to consider for it's satisfiability check.
Definition: ModuleInput.h:131
Model mModel
Stores the assignment of the current satisfiable result, if existent.
Definition: Module.h:199
void updateModel() const
Updates the model, if the solver has detected the consistency of the received formula,...
Definition: NewGBPPModule.h:14
Answer checkCore()
Checks the received formula for consistency.
NewGBPPModule(const ModuleInput *_formula, Conditionals &_conditionals, Manager *_manager=nullptr)
Class to create the formulas for axioms.
const settings::Settings & Settings()
Definition: Settings.h:96
Answer
An enum with the possible answers a Module can give.
Definition: types.h:57
std::vector< std::atomic_bool * > Conditionals
A vector of atomic bool pointers.
Definition: types.h:17