blob: 3ace236b553ebdaf1d8e36a91a753bb7b147df16 (
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/********************* */
/*! \file proof_utils.cpp
** \verbatim
** Top contributors (to current version):
** Liana Hadarean
** This file is part of the CVC4 project.
** Copyright (c) 2009-2016 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
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "proof/proof_utils.h"
#include "theory/theory.h"
namespace CVC4 {
namespace utils {
void collectAtoms(TNode node, std::set<Node>& seen) {
if (seen.find(node) != seen.end())
return;
if (theory::Theory::theoryOf(node) != theory::THEORY_BOOL || node.isVar()) {
seen.insert(node);
return;
}
for (unsigned i = 0; i < node.getNumChildren(); ++i) {
collectAtoms(node[i], seen);
}
}
std::string toLFSCKind(Kind kind) {
switch(kind) {
// core kinds
case kind::OR : return "or";
case kind::AND: return "and";
case kind::XOR: return "xor";
case kind::EQUAL: return "=";
case kind::IMPLIES: return "impl";
case kind::NOT: return "not";
// bit-vector kinds
case kind::BITVECTOR_AND :
return "bvand";
case kind::BITVECTOR_OR :
return "bvor";
case kind::BITVECTOR_XOR :
return "bvxor";
case kind::BITVECTOR_NAND :
return "bvnand";
case kind::BITVECTOR_NOR :
return "bvnor";
case kind::BITVECTOR_XNOR :
return "bvxnor";
case kind::BITVECTOR_COMP :
return "bvcomp";
case kind::BITVECTOR_MULT :
return "bvmul";
case kind::BITVECTOR_PLUS :
return "bvadd";
case kind::BITVECTOR_SUB :
return "bvsub";
case kind::BITVECTOR_UDIV :
case kind::BITVECTOR_UDIV_TOTAL :
return "bvudiv";
case kind::BITVECTOR_UREM :
case kind::BITVECTOR_UREM_TOTAL :
return "bvurem";
case kind::BITVECTOR_SDIV :
return "bvsdiv";
case kind::BITVECTOR_SREM :
return "bvsrem";
case kind::BITVECTOR_SMOD :
return "bvsmod";
case kind::BITVECTOR_SHL :
return "bvshl";
case kind::BITVECTOR_LSHR :
return "bvlshr";
case kind::BITVECTOR_ASHR :
return "bvashr";
case kind::BITVECTOR_CONCAT :
return "concat";
case kind::BITVECTOR_NEG :
return "bvneg";
case kind::BITVECTOR_NOT :
return "bvnot";
case kind::BITVECTOR_ROTATE_LEFT :
return "rotate_left";
case kind::BITVECTOR_ROTATE_RIGHT :
return "rotate_right";
case kind::BITVECTOR_ULT :
return "bvult";
case kind::BITVECTOR_ULE :
return "bvule";
case kind::BITVECTOR_UGT :
return "bvugt";
case kind::BITVECTOR_UGE :
return "bvuge";
case kind::BITVECTOR_SLT :
return "bvslt";
case kind::BITVECTOR_SLE :
return "bvsle";
case kind::BITVECTOR_SGT :
return "bvsgt";
case kind::BITVECTOR_SGE :
return "bvsge";
case kind::BITVECTOR_EXTRACT :
return "extract";
case kind::BITVECTOR_REPEAT :
return "repeat";
case kind::BITVECTOR_ZERO_EXTEND :
return "zero_extend";
case kind::BITVECTOR_SIGN_EXTEND :
return "sign_extend";
default:
Unreachable();
}
}
std::string toLFSCKindTerm(Expr node) {
Kind k = node.getKind();
if( k==kind::EQUAL ){
if( node[0].getType().isBoolean() ){
return "iff";
}else{
return "=";
}
}else{
return toLFSCKind( k );
}
}
} /* namespace CVC4::utils */
} /* namespace CVC4 */
|
