SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
SymmetryModule.h
Go to the documentation of this file.
1 /**
2  * @file SymmetryModule.h
3  * @author YOUR NAME <YOUR EMAIL ADDRESS>
4  *
5  * @version 2018-03-12
6  * Created on 2018-03-12.
7  */
8 
9 #pragma once
10 
11 #include <smtrat-solver/PModule.h>
12 #include "SymmetrySettings.h"
13 
14 namespace smtrat
15 {
16  template<typename Settings>
17  class SymmetryModule : public PModule
18  {
19  public:
21  SymmetryModule(const ModuleInput* _formula, Conditionals& _conditionals, Manager* _manager = nullptr);
22 
24 
25  // Main interfaces.
26  /**
27  * Checks the received formula for consistency.
28  * @return True, if the received formula is satisfiable;
29  * False, if the received formula is not satisfiable;
30  * Unknown, otherwise.
31  */
33  };
34 }
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
Answer checkCore()
Checks the received formula for consistency.
SymmetryModule(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