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
|
/******************************************************************************
* Top contributors (to current version):
* Mudathir Mohamed, Daniel Larraz, Mathias Preiner
*
* 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.
* ****************************************************************************
*
* A simple demonstration of the Sygus API.
*
* A simple demonstration of how to use the Sygus API to synthesize max and min
* functions. This is a direct translation of sygus-fun.cpp.
*/
import static io.github.cvc5.Kind.*;
import io.github.cvc5.*;
public class SygusFun
{
public static void main(String args[]) throws CVC5ApiException
{
TermManager tm = new TermManager();
Solver slv = new Solver(tm);
{
// required options
slv.setOption("sygus", "true");
slv.setOption("incremental", "false");
// set the logic
slv.setLogic("LIA");
Sort integer = tm.getIntegerSort();
Sort bool = tm.getBooleanSort();
// declare input variables for the functions-to-synthesize
Term x = tm.mkVar(integer, "x");
Term y = tm.mkVar(integer, "y");
// declare the grammar non-terminals
Term start = tm.mkVar(integer, "Start");
Term start_bool = tm.mkVar(bool, "StartBool");
// define the rules
Term zero = tm.mkInteger(0);
Term one = tm.mkInteger(1);
Term plus = tm.mkTerm(ADD, start, start);
Term minus = tm.mkTerm(SUB, start, start);
Term ite = tm.mkTerm(ITE, start_bool, start, start);
Term And = tm.mkTerm(AND, start_bool, start_bool);
Term Not = tm.mkTerm(NOT, start_bool);
Term leq = tm.mkTerm(LEQ, start, start);
// create the grammar object
Grammar g = slv.mkGrammar(new Term[] {x, y}, new Term[] {start, start_bool});
// bind each non-terminal to its rules
g.addRules(start, new Term[] {zero, one, x, y, plus, minus, ite});
g.addRules(start_bool, new Term[] {And, Not, leq});
// declare the functions-to-synthesize. Optionally, provide the grammar
// constraints
Term max = slv.synthFun("max", new Term[] {x, y}, integer, g);
Term min = slv.synthFun("min", new Term[] {x, y}, integer);
// declare universal variables.
Term varX = slv.declareSygusVar("x", integer);
Term varY = slv.declareSygusVar("y", integer);
Term max_x_y = tm.mkTerm(APPLY_UF, max, varX, varY);
Term min_x_y = tm.mkTerm(APPLY_UF, min, varX, varY);
// add semantic constraints
// (constraint (>= (max x y) x))
slv.addSygusConstraint(tm.mkTerm(GEQ, max_x_y, varX));
// (constraint (>= (max x y) y))
slv.addSygusConstraint(tm.mkTerm(GEQ, max_x_y, varY));
// (constraint (or (= x (max x y))
// (= y (max x y))))
slv.addSygusConstraint(
tm.mkTerm(OR, tm.mkTerm(EQUAL, max_x_y, varX), tm.mkTerm(EQUAL, max_x_y, varY)));
// (constraint (= (+ (max x y) (min x y))
// (+ x y)))
slv.addSygusConstraint(
tm.mkTerm(EQUAL, tm.mkTerm(ADD, max_x_y, min_x_y), tm.mkTerm(ADD, varX, varY)));
// print solutions if available
if (slv.checkSynth().hasSolution())
{
// Output should be equivalent to:
// (
// (define-fun max ((x Int) (y Int)) Int (ite (<= x y) y x))
// (define-fun min ((x Int) (y Int)) Int (ite (<= x y) x y))
// )
Term[] terms = new Term[] {max, min};
Utils.printSynthSolutions(terms, slv.getSynthSolutions(terms));
}
}
Context.deletePointers();
}
}
|
