blob: 626efe8e35bfbc421deda942d29024bf148f889f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
/********************* */
/*! \file theory_rewrite_eq.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
** in the top-level source directory and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief The TheoryRewriteEq preprocessing pass
**/
#include "cvc4_private.h"
#ifndef CVC4__PREPROCESSING__PASSES__THEORY_REWRITE_EQ_H
#define CVC4__PREPROCESSING__PASSES__THEORY_REWRITE_EQ_H
#include "expr/node.h"
#include "preprocessing/preprocessing_pass.h"
#include "theory/trust_node.h"
namespace CVC5 {
namespace preprocessing {
namespace passes {
/**
* Implements the preprocessing pass for called ppRewrite on all equalities
* in the input. This is required to be a preprocessing pass since it is not
* recommended that ppRewrite is called on equalities generated in lemmas (e.g.
* it may interfere with equality splitting in theory combination).
*/
class TheoryRewriteEq : public PreprocessingPass
{
public:
TheoryRewriteEq(PreprocessingPassContext* preprocContext);
protected:
PreprocessingPassResult applyInternal(
AssertionPipeline* assertionsToPreprocess) override;
/**
* Rewrite the assertion based on rewriting equalities based on theory
* specific rewriting.
* An example is removing arithmetic equalities via:
* (= x y) ---> (and (>= x y) (<= x y))
* Returns the trust node corresponding to the rewrite.
*/
theory::TrustNode rewriteAssertion(TNode assertion);
};
} // namespace passes
} // namespace preprocessing
} // namespace CVC5
#endif /* CVC4__PREPROCESSING__PASSES__THEORY_REWRITE_EQ_H */
|
