SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
NegationSimplifier.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include "BaseSimplifier.h"
4 #include "../ExpressionPool.h"
5 
6 namespace smtrat {
7 namespace expression {
8 namespace simplifier {
9 
11  const ExpressionContent* simplify(const UnaryExpression& expr) const {
12  if (expr.type != NOT) return nullptr;
13  return expr.expression.getContent().negation;
14  }
15  };
16 
17 }
18 }
19 }
const ExpressionContent & getContent() const
Definition: Expression.h:37
Class to create the formulas for axioms.
const ExpressionContent * simplify(const UnaryExpression &expr) const