SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
SingletonSimplifier.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 NaryExpression& expr) const {
12  if (expr.type == IFF) return nullptr;
13  if (expr.expressions.size() == 1) {
14  return expr.expressions.front().getContentPtr();
15  }
16  return nullptr;
17  }
18  };
19 
20 }
21 }
22 }
Class to create the formulas for axioms.
const ExpressionContent * simplify(const NaryExpression &expr) const