blob: cbaec7ca6e7464fa2fa7ab0c31325d0ed0c993e7 (
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
57
58
59
60
|
/******************************************************************************
* Top contributors (to current version):
* Mathias Preiner
*
* This file is part of the cvc5 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.
* ****************************************************************************
*
* Implementation of bit-vectors proof checker.
*/
#include "theory/bv/proof_checker.h"
namespace cvc5 {
namespace theory {
namespace bv {
void BVProofRuleChecker::registerTo(ProofChecker* pc)
{
pc->registerChecker(PfRule::BV_BITBLAST, this);
pc->registerChecker(PfRule::BV_BITBLAST_STEP, this);
pc->registerChecker(PfRule::BV_EAGER_ATOM, this);
}
Node BVProofRuleChecker::checkInternal(PfRule id,
const std::vector<Node>& children,
const std::vector<Node>& args)
{
if (id == PfRule::BV_BITBLAST)
{
Assert(children.empty());
Assert(args.size() == 1);
Assert(args[0].getKind() == kind::EQUAL);
return args[0];
}
else if (id == PfRule::BV_BITBLAST_STEP)
{
Assert(children.empty());
Assert(args.size() == 1);
Assert(args[0].getKind() == kind::EQUAL);
return args[0];
}
else if (id == PfRule::BV_EAGER_ATOM)
{
Assert(children.empty());
Assert(args.size() == 1);
Assert(args[0].getKind() == kind::BITVECTOR_EAGER_ATOM);
return args[0].eqNode(args[0][0]);
}
// no rule
return Node::null();
}
} // namespace bv
} // namespace theory
} // namespace cvc5
|
