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
57
58
59
60
61
62
63
|
/********************* */
/*! \file theory_rewriter.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 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 TheoryRewriter class
**
** The TheoryRewriter class is the interface that theory rewriters implement.
**/
#include "theory/theory_rewriter.h"
namespace CVC4 {
namespace theory {
TrustRewriteResponse::TrustRewriteResponse(RewriteStatus status,
Node n,
Node nr,
ProofGenerator* pg)
: d_status(status)
{
// we always make non-null, regardless of whether n = nr
d_node = TrustNode::mkTrustRewrite(n, nr, pg);
}
TrustRewriteResponse TheoryRewriter::postRewriteWithProof(TNode node)
{
RewriteResponse response = postRewrite(node);
// by default, we return a trust rewrite response with no proof generator
return TrustRewriteResponse(
response.d_status, node, response.d_node, nullptr);
}
TrustRewriteResponse TheoryRewriter::preRewriteWithProof(TNode node)
{
RewriteResponse response = preRewrite(node);
// by default, we return a trust rewrite response with no proof generator
return TrustRewriteResponse(
response.d_status, node, response.d_node, nullptr);
}
Node TheoryRewriter::rewriteEqualityExt(Node node) { return node; }
TrustNode TheoryRewriter::rewriteEqualityExtWithProof(Node node)
{
Node nodeRew = rewriteEqualityExt(node);
if (nodeRew != node)
{
// by default, we return a trust rewrite response with no proof generator
return TrustNode::mkTrustRewrite(node, nodeRew, nullptr);
}
// no rewrite
return TrustNode::null();
}
} // namespace theory
} // namespace CVC4
|
