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
|
/******************************************************************************
* Top contributors (to current version):
* Aina Niemetz, Andrew Reynolds
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2025 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.
* ****************************************************************************
*
* Test for project issue #587
*
*/
#include <cvc5/cvc5.h>
using namespace cvc5;
int main(void)
{
TermManager tm;
Solver solver(tm);
solver.setOption("incremental", "false");
solver.setOption("sygus-core-connective", "true");
solver.setOption("produce-abducts", "true");
Sort s0 = tm.getBooleanSort();
Sort s1 = tm.mkSetSort(s0);
Sort s2 = tm.mkSetSort(s1);
Term t3 = tm.mkEmptySet(s2);
Term t4 = tm.mkConst(s1, "_x2");
Op o5 = tm.mkOp(Kind::SET_SINGLETON);
Term t6 = tm.mkTerm(o5, {t3});
Sort s7 = t6.getSort();
Op o8 = tm.mkOp(Kind::SET_SINGLETON);
Term t9 = tm.mkTerm(o5, {t6});
Sort s10 = t9.getSort();
Op o11 = tm.mkOp(Kind::SET_MINUS);
Term t12 = tm.mkTerm(o11, {t9, t9});
Op o13 = tm.mkOp(Kind::SET_IS_SINGLETON);
Term t14 = tm.mkTerm(o13, {t12});
solver.assertFormula(t14);
Op o15 = tm.mkOp(Kind::SET_MEMBER);
Term t16 = tm.mkTerm(o15, {t14, t4});
Term t17 = solver.getAbduct(t16);
return 0;
}
|
