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 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
|
/********************* */
/*! \file engine_output_channel.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Guy Katz, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 theory engine output channel.
**/
#include "theory/engine_output_channel.h"
#include "proof/cnf_proof.h"
#include "proof/lemma_proof.h"
#include "proof/proof_manager.h"
#include "proof/theory_proof.h"
#include "prop/prop_engine.h"
#include "smt/smt_statistics_registry.h"
#include "theory/theory_engine.h"
using namespace CVC4::kind;
namespace CVC4 {
namespace theory {
EngineOutputChannel::Statistics::Statistics(theory::TheoryId theory)
: conflicts(getStatsPrefix(theory) + "::conflicts", 0),
propagations(getStatsPrefix(theory) + "::propagations", 0),
lemmas(getStatsPrefix(theory) + "::lemmas", 0),
requirePhase(getStatsPrefix(theory) + "::requirePhase", 0),
restartDemands(getStatsPrefix(theory) + "::restartDemands", 0),
trustedConflicts(getStatsPrefix(theory) + "::trustedConflicts", 0),
trustedLemmas(getStatsPrefix(theory) + "::trustedLemmas", 0)
{
smtStatisticsRegistry()->registerStat(&conflicts);
smtStatisticsRegistry()->registerStat(&propagations);
smtStatisticsRegistry()->registerStat(&lemmas);
smtStatisticsRegistry()->registerStat(&requirePhase);
smtStatisticsRegistry()->registerStat(&restartDemands);
smtStatisticsRegistry()->registerStat(&trustedConflicts);
smtStatisticsRegistry()->registerStat(&trustedLemmas);
}
EngineOutputChannel::Statistics::~Statistics()
{
smtStatisticsRegistry()->unregisterStat(&conflicts);
smtStatisticsRegistry()->unregisterStat(&propagations);
smtStatisticsRegistry()->unregisterStat(&lemmas);
smtStatisticsRegistry()->unregisterStat(&requirePhase);
smtStatisticsRegistry()->unregisterStat(&restartDemands);
smtStatisticsRegistry()->unregisterStat(&trustedConflicts);
smtStatisticsRegistry()->unregisterStat(&trustedLemmas);
}
EngineOutputChannel::EngineOutputChannel(TheoryEngine* engine,
theory::TheoryId theory)
: d_engine(engine), d_statistics(theory), d_theory(theory)
{
}
void EngineOutputChannel::safePoint(ResourceManager::Resource r)
{
spendResource(r);
if (d_engine->d_interrupted)
{
throw theory::Interrupted();
}
}
theory::LemmaStatus EngineOutputChannel::lemma(TNode lemma,
ProofRule rule,
bool removable,
bool preprocess,
bool sendAtoms)
{
Debug("theory::lemma") << "EngineOutputChannel<" << d_theory << ">::lemma("
<< lemma << ")"
<< ", preprocess = " << preprocess << std::endl;
++d_statistics.lemmas;
d_engine->d_outputChannelUsed = true;
PROOF({ registerLemmaRecipe(lemma, lemma, preprocess, d_theory); });
theory::LemmaStatus result =
d_engine->lemma(lemma,
rule,
false,
removable,
preprocess,
sendAtoms ? d_theory : theory::THEORY_LAST);
return result;
}
void EngineOutputChannel::registerLemmaRecipe(Node lemma,
Node originalLemma,
bool preprocess,
theory::TheoryId theoryId)
{
// During CNF conversion, conjunctions will be broken down into
// multiple lemmas. In order for the recipes to match, we have to do
// the same here.
NodeManager* nm = NodeManager::currentNM();
if (preprocess) lemma = d_engine->preprocess(lemma);
bool negated = (lemma.getKind() == NOT);
Node nnLemma = negated ? lemma[0] : lemma;
switch (nnLemma.getKind())
{
case AND:
if (!negated)
{
for (unsigned i = 0; i < nnLemma.getNumChildren(); ++i)
registerLemmaRecipe(nnLemma[i], originalLemma, false, theoryId);
}
else
{
NodeBuilder<> builder(OR);
for (unsigned i = 0; i < nnLemma.getNumChildren(); ++i)
builder << nnLemma[i].negate();
Node disjunction =
(builder.getNumChildren() == 1) ? builder[0] : builder;
registerLemmaRecipe(disjunction, originalLemma, false, theoryId);
}
break;
case EQUAL:
if (nnLemma[0].getType().isBoolean())
{
if (!negated)
{
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0], nnLemma[1].negate()),
originalLemma,
false,
theoryId);
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0].negate(), nnLemma[1]),
originalLemma,
false,
theoryId);
}
else
{
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0], nnLemma[1]),
originalLemma,
false,
theoryId);
registerLemmaRecipe(
nm->mkNode(OR, nnLemma[0].negate(), nnLemma[1].negate()),
originalLemma,
false,
theoryId);
}
}
break;
case ITE:
if (!negated)
{
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0].negate(), nnLemma[1]),
originalLemma,
false,
theoryId);
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0], nnLemma[2]),
originalLemma,
false,
theoryId);
}
else
{
registerLemmaRecipe(
nm->mkNode(OR, nnLemma[0].negate(), nnLemma[1].negate()),
originalLemma,
false,
theoryId);
registerLemmaRecipe(nm->mkNode(OR, nnLemma[0], nnLemma[2].negate()),
originalLemma,
false,
theoryId);
}
break;
default: break;
}
// Theory lemmas have one step that proves the empty clause
LemmaProofRecipe proofRecipe;
Node emptyNode;
LemmaProofRecipe::ProofStep proofStep(theoryId, emptyNode);
// Remember the original lemma, so we can report this later when asked to
proofRecipe.setOriginalLemma(originalLemma);
// Record the assertions and rewrites
Node rewritten;
if (lemma.getKind() == OR)
{
for (unsigned i = 0; i < lemma.getNumChildren(); ++i)
{
rewritten = theory::Rewriter::rewrite(lemma[i]);
if (rewritten != lemma[i])
{
proofRecipe.addRewriteRule(lemma[i].negate(), rewritten.negate());
}
proofStep.addAssertion(lemma[i]);
proofRecipe.addBaseAssertion(rewritten);
}
}
else
{
rewritten = theory::Rewriter::rewrite(lemma);
if (rewritten != lemma)
{
proofRecipe.addRewriteRule(lemma.negate(), rewritten.negate());
}
proofStep.addAssertion(lemma);
proofRecipe.addBaseAssertion(rewritten);
}
proofRecipe.addStep(proofStep);
ProofManager::getCnfProof()->setProofRecipe(&proofRecipe);
}
theory::LemmaStatus EngineOutputChannel::splitLemma(TNode lemma, bool removable)
{
Debug("theory::lemma") << "EngineOutputChannel<" << d_theory << ">::lemma("
<< lemma << ")" << std::endl;
++d_statistics.lemmas;
d_engine->d_outputChannelUsed = true;
Debug("pf::explain") << "EngineOutputChannel::splitLemma( " << lemma << " )"
<< std::endl;
theory::LemmaStatus result =
d_engine->lemma(lemma, RULE_SPLIT, false, removable, false, d_theory);
return result;
}
bool EngineOutputChannel::propagate(TNode literal)
{
Debug("theory::propagate") << "EngineOutputChannel<" << d_theory
<< ">::propagate(" << literal << ")" << std::endl;
++d_statistics.propagations;
d_engine->d_outputChannelUsed = true;
return d_engine->propagate(literal, d_theory);
}
void EngineOutputChannel::conflict(TNode conflictNode,
std::unique_ptr<Proof> proof)
{
Trace("theory::conflict")
<< "EngineOutputChannel<" << d_theory << ">::conflict(" << conflictNode
<< ")" << std::endl;
Assert(!proof); // Theory shouldn't be producing proofs yet
++d_statistics.conflicts;
d_engine->d_outputChannelUsed = true;
d_engine->conflict(conflictNode, d_theory);
}
void EngineOutputChannel::demandRestart()
{
NodeManager* curr = NodeManager::currentNM();
Node restartVar = curr->mkSkolem(
"restartVar",
curr->booleanType(),
"A boolean variable asserted to be true to force a restart");
Trace("theory::restart") << "EngineOutputChannel<" << d_theory
<< ">::restart(" << restartVar << ")" << std::endl;
++d_statistics.restartDemands;
lemma(restartVar, RULE_INVALID, true);
}
void EngineOutputChannel::requirePhase(TNode n, bool phase)
{
Debug("theory") << "EngineOutputChannel::requirePhase(" << n << ", " << phase
<< ")" << std::endl;
++d_statistics.requirePhase;
d_engine->getPropEngine()->requirePhase(n, phase);
}
void EngineOutputChannel::setIncomplete()
{
Trace("theory") << "setIncomplete()" << std::endl;
d_engine->setIncomplete(d_theory);
}
void EngineOutputChannel::spendResource(ResourceManager::Resource r)
{
d_engine->spendResource(r);
}
void EngineOutputChannel::handleUserAttribute(const char* attr,
theory::Theory* t)
{
d_engine->handleUserAttribute(attr, t);
}
} // namespace theory
} // namespace CVC4
|