SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
ExpressionTest.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include "Expression.h"
4 #include "ExpressionPool.h"
5 #include "ExpressionVisitor.h"
6 #include "ExpressionConverter.h"
7 
8 namespace smtrat {
9 
10  void visiting(const Expression& expr) {
11  std::cout << expr << std::endl;
12  }
13 
14  void testExpression() {
15  carl::Variable x = carl::fresh_boolean_variable("x");
17 
22 
23  std::cout << e3 << std::endl;
24  std::cout << e4 << std::endl;
25  std::cout << e5 << std::endl;
26 
28 
29  FormulaT f = c(e3);
30 
31  std::cout << f << std::endl;
32  }
33 
34 }
Class to create the formulas for axioms.
carl::Formula< Poly > FormulaT
Definition: types.h:37
void visiting(const Expression &expr)
void testExpression()