SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
PPFilterBoundsOnlyComplete.h
Go to the documentation of this file.
1 #pragma once
2 
7 
8 namespace smtrat {
9 
10 namespace internal {
11 struct OpSettings : cadcells::operators::MccallumFilteredSettings {
13  static constexpr bool enable_weak = true;
14  static constexpr bool complete = true;
15 };
16 
17 struct NewCoveringSettings : NewCoveringSettings2 {
20 };
21 } // namespace internal
22 
24 public:
26  : Manager() {
31  }
32 };
33 } // 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.
constexpr static auto covering_heuristic
static constexpr bool enable_weak
static constexpr DelineationFunction delineation_function