blob: c4d1052da588bc131dc000a53153d341890e0785 (
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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* 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.
* ****************************************************************************
*
* Class for verifying queries for synthesis solutions
*/
#include "cvc5_private.h"
#ifndef CVC5__THEORY__QUANTIFIERS__SYNTH_VERIFY_H
#define CVC5__THEORY__QUANTIFIERS__SYNTH_VERIFY_H
#include <memory>
#include "options/options.h"
#include "theory/quantifiers/sygus/term_database_sygus.h"
#include "util/result.h"
namespace cvc5 {
namespace theory {
namespace quantifiers {
/**
* Class for verifying queries corresponding to synthesis conjectures
*/
class SynthVerify
{
public:
SynthVerify(const Options& opts, TermDbSygus* tds);
~SynthVerify();
/**
* Verification call, which takes into account specific aspects of the
* synthesis conjecture, e.g. recursive function definitions.
*
* @param query The query corresponding to the negated body of the synthesis
* conjecture
* @param vars The skolem variables witnessing the counterexample
* @param mvs If satisfiable, these contain the model value for vars
* @return The result of whether query is satisfiable.
*/
Result verify(Node query,
const std::vector<Node>& vars,
std::vector<Node>& mvs);
private:
/** Pointer to the term database sygus */
TermDbSygus* d_tds;
/** The options for subsolver calls */
Options d_subOptions;
};
} // namespace quantifiers
} // namespace theory
} // namespace cvc5
#endif
|
