forked from vprover/vampire
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vground.cpp
220 lines (184 loc) · 5.18 KB
/
vground.cpp
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
/*
* File vground.cpp.
*
* This file is part of the source code of the software program
* Vampire. It is protected by applicable
* copyright laws.
*
* This source code is distributed under the licence found here
* https://vprover.github.io/license.html
* and in the source directory
*
* In summary, you are allowed to use Vampire for non-commercial
* purposes but not allowed to distribute, modify, copy, create derivatives,
* or use in competitions.
* For other uses of Vampire please contact developers for a different
* licence, which we will make an effort to provide.
*/
/**
* @file vampire.cpp. Implements the top-level procedures of Vampire.
*/
#include <iostream>
#include <ostream>
#include <fstream>
#include <csignal>
#include "Debug/Tracer.hpp"
#include "Lib/Random.hpp"
#include "Lib/Set.hpp"
#include "Lib/Int.hpp"
#include "Lib/Timer.hpp"
#include "Lib/Exception.hpp"
#include "Lib/Environment.hpp"
#include "Lib/List.hpp"
#include "Lib/Vector.hpp"
#include "Lib/System.hpp"
#include "Lib/Metaiterators.hpp"
#include "Lib/MapToLIFO.hpp"
#include "Kernel/Signature.hpp"
#include "Kernel/Clause.hpp"
#include "Kernel/Formula.hpp"
#include "Kernel/FormulaUnit.hpp"
#include "Kernel/InferenceStore.hpp"
#include "Indexing/TermSharing.hpp"
#include "Indexing/SubstitutionTree.hpp"
#include "Indexing/LiteralMiniIndex.hpp"
#include "Parse/TPTP.hpp"
#include "Shell/CommandLine.hpp"
#include "Shell/GeneralSplitting.hpp"
#include "Shell/Grounding.hpp"
#include "Shell/Options.hpp"
#include "Shell/Property.hpp"
#include "Shell/Preprocess.hpp"
#include "Shell/Refutation.hpp"
#include "Shell/Statistics.hpp"
#include "Shell/TPTP.hpp"
#include "Saturation/SaturationAlgorithm.hpp"
#include "SAT/DIMACS.hpp"
#include "SAT/SATClause.hpp"
#if CHECK_LEAKS
#include "Lib/MemoryLeak.hpp"
#endif
#define SPIDER 1
#define SAVE_SPIDER_PROPERTIES 1
using namespace Shell;
using namespace SAT;
using namespace Saturation;
using namespace Inferences;
UnitList* globUnitList=0;
void groundingMode()
{
CALL("groundingMode()");
try {
ScopedPtr<Problem> prb(UIHelper::getInputProblem(*env.options));
Preprocess prepro(*env.options);
prepro.preprocess(*prb);
ClauseIterator clauses=prb->clauseIterator();
if(prb->hasEquality()) {
ClauseList* eqAxioms=Grounding::getEqualityAxioms(prb->getProperty()->positiveEqualityAtoms()!=0);
clauses=pvi(getConcatenatedIterator(ClauseList::DestructiveIterator(eqAxioms),clauses));
}
MapToLIFO<Clause*, SATClause*> insts;
Grounding gnd;
SATClause::NamingContext nameCtx;
while(clauses.hasNext()) {
Clause* cl=clauses.next();
ClauseList* grounded=gnd.ground(cl);
SATClauseList* sGrounded=0;
while(grounded) {
Clause* gcl=ClauseList::pop(grounded);
SATClauseList::push(SATClause::fromFOClause(nameCtx, gcl), sGrounded);
}
insts.pushManyToKey(cl, sGrounded);
}
env.beginOutput();
DIMACS::outputGroundedProblem(insts, nameCtx, env.out());
env.endOutput();
} catch(MemoryLimitExceededException) {
env.beginOutput();
env.out()<<"Memory limit exceeded\n";
env.endOutput();
} catch(TimeLimitExceededException) {
env.beginOutput();
env.out()<<"Time limit exceeded\n";
env.endOutput();
}
} // groundingMode
void explainException (Exception& exception)
{
env.beginOutput();
exception.cry(env.out());
env.endOutput();
} // explainException
/**
* The main function.
* @since 03/12/2003 many changes related to logging
* and exception handling.
* @since 10/09/2004, Manchester changed to use knowledge bases
*/
int main(int argc, char* argv [])
{
CALL ("main");
System::setSignalHandlers();
// create random seed for the random number generation
Lib::Random::setSeed(123456);
try {
// read the command line and interpret it
Options options;
Shell::CommandLine cl(argc,argv);
cl.interpret(options);
Allocator::setMemoryLimit(options.memoryLimit()*1048576);
Lib::Random::setSeed(options.randomSeed());
Timer timer;
timer.start();
env.timer = &timer;
Indexing::TermSharing sharing;
env.sharing = &sharing;
env.options = &options;
Shell::Statistics statistics;
env.statistics = &statistics;
if(options.mode()!=Options::MODE_GROUNDING) {
USER_ERROR("Invalid mode: must be \"grouding\"");
}
groundingMode();
#if CHECK_LEAKS
if(globUnitList) {
MemoryLeak leak;
leak.release(globUnitList);
}
delete env.signature;
env.signature = 0;
#endif
}
#if VDEBUG
catch (Debug::AssertionViolationException& exception) {
#if CHECK_LEAKS
MemoryLeak::cancelReport();
#endif
}
#endif
catch (UserErrorException& exception) {
#if CHECK_LEAKS
MemoryLeak::cancelReport();
#endif
explainException(exception);
}
catch (Exception& exception) {
#if CHECK_LEAKS
MemoryLeak::cancelReport();
#endif
env.beginOutput();
explainException(exception);
env.statistics->print(env.out());
env.endOutput();
}
catch (std::bad_alloc& _) {
#if CHECK_LEAKS
MemoryLeak::cancelReport();
#endif
env.beginOutput();
env.out() << "Insufficient system memory" << '\n';
env.endOutput();
}
// delete env.allocator;
return EXIT_SUCCESS;
} // main