SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
PPDefault.h
Go to the documentation of this file.
1 #pragma once
2 
6 
7 namespace smtrat {
8 
9 /**
10  * The most efficient CoveringNG strategy with preprocessing.
11  *
12  */
14 public:
18  addBackend<CoveringNGModule<CoveringNGSettingsDefault>>()
19  })
20  );
21  }
22 };
23 } // namespace smtrat
The most efficient CoveringNG strategy with preprocessing.
Definition: PPDefault.h:13
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.