SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
BCNoop.h
Go to the documentation of this file.
1 #pragma once
2 
4 
5 // #include "../modules/FPPModule/FPPModule.h"
8 
9 
10 namespace smtrat {
11 
12 namespace internal {
13 struct OCSettings : smtrat::mcsat::onecell::BaseSettings {
14  constexpr static bool exploit_strict_constraints = false;
15 
19 };
20 
22  struct MCSATSettings : mcsat::Base {
25  };
26 };
27 } // namespace internal
28 
29 class Filter_BCNoop : public Manager {
30 public:
32  : Manager() {
35  }
36 };
37 
38 } // namespace smtrat
Base class for solvers.
Definition: Manager.h:34
void setStrategy(const std::initializer_list< BackendLink > &backends)
Definition: Manager.h:385
BackendLink addBackend(const std::initializer_list< BackendLink > &backends={})
Definition: Manager.h:396
Implements a module performing DPLL style SAT checking.
Definition: SATModule.h:62
Class to create the formulas for axioms.
mcsat::MCSATSettingsFMVSNL MCSATSettings
Definition: SATSettings.h:110
constexpr static auto cell_heuristic
Definition: BCAll.h:20
constexpr static bool exploit_strict_constraints
Definition: BCAll.h:18
constexpr static auto covering_heuristic
Definition: BCAll.h:21