SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Default.h
Go to the documentation of this file.
1 #pragma once
2 
5 
6 namespace smtrat {
7 
8 /**
9  * The most efficient CoveringNG strategy with preprocessing.
10  *
11  */
12 class CoveringNG_Default: public Manager {
13 public:
17  );
18  }
19 };
20 } // namespace smtrat
The most efficient CoveringNG strategy with preprocessing.
Definition: Default.h:12
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
Class to create the formulas for axioms.