SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
BCIrred.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 OpSettings : cadcells::operators::MccallumFilteredSettings {
14  static constexpr DelineationFunction delineation_function = ALL;
15  static constexpr bool only_irreducible_resultants = true;
16 };
17 
19  constexpr static bool exploit_strict_constraints = false;
20 
24 };
25 
27  struct MCSATSettings : mcsat::Base {
30  };
31 };
32 } // namespace internal
33 
34 class Filter_BCIrred : public Manager {
35 public:
37  : Manager() {
40  }
41 };
42 
43 } // 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
static constexpr DelineationFunction delineation_function
static constexpr bool only_irreducible_resultants
Definition: BCIrred.h:15