SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
qe.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <algorithm>
4 #include <variant>
5 #include <vector>
6 
8 #include <smtrat-common/types.h>
9 #include <carl-arith/core/Variable.h>
10 #include <carl-arith/ran/Conversion.h>
13 
14 #include "Settings.h"
17 
18 namespace smtrat::qe::coverings {
19 
21 
22 std::optional<FormulaT> qe(const FormulaT& formula);
23 
24 } // namespace smtrat::qe::coverings
std::optional< FormulaT > qe(const FormulaT &input)
Definition: qe.cpp:14
carl::Formula< Poly > FormulaT
Definition: types.h:37