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