SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include "qe.h"
#include <smtrat-coveringng/VariableOrdering.h>
#include <carl-arith/core/Variables.h>
#include <carl-formula/formula/FormulaContent.h>
#include <optional>
#include <random>
#include "Statistics.h"
#include <carl-formula/formula/functions/PNF.h>
#include "util/to_formula.h"
#include <smtrat-coveringng/Simplification.h>
Go to the source code of this file.
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
smtrat::qe | |
smtrat::qe::coverings | |
Functions | |
std::optional< FormulaT > | smtrat::qe::coverings::qe (const FormulaT &input) |