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
|
#!/usr/bin/env python
###############################################################################
# Top contributors (to current version):
# Yoni Zohar, Mudathir Mohamed
#
# 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.
# #############################################################################
#
# A simple demonstration of the solving capabilities of the cvc5
# sygus solver through the Python API. This is a direct
# translation of sygus-grammar.cpp.
##
import copy
import utils
import pycvc5
from pycvc5 import Kind
if __name__ == "__main__":
slv = pycvc5.Solver()
# required options
slv.setOption("lang", "sygus2")
slv.setOption("incremental", "false")
# set the logic
slv.setLogic("LIA")
integer = slv.getIntegerSort()
boolean = slv.getBooleanSort()
# declare input variable for the function-to-synthesize
x = slv.mkVar(integer, "x")
# declare the grammar non-terminal
start = slv.mkVar(integer, "Start")
# define the rules
zero = slv.mkInteger(0)
neg_x = slv.mkTerm(Kind.Uminus, x)
plus = slv.mkTerm(Kind.Plus, x, start)
# create the grammar object
g1 = slv.mkSygusGrammar({x}, {start})
g2 = slv.mkSygusGrammar({x}, {start})
g3 = slv.mkSygusGrammar({x}, {start})
# bind each non-terminal to its rules
g1.addRules(start, {neg_x, plus})
g2.addRules(start, {neg_x, plus})
g3.addRules(start, {neg_x, plus})
# add parameters as rules for the start symbol. Similar to "(Variable Int)"
g2.addAnyVariable(start)
# declare the functions-to-synthesize
id1 = slv.synthFun("id1", {x}, integer, g1)
id2 = slv.synthFun("id2", {x}, integer, g2)
g3.addRule(start, zero)
id3 = slv.synthFun("id3", {x}, integer, g3)
# g1 is reusable as long as it remains unmodified after first use
id4 = slv.synthFun("id4", {x}, integer, g1)
# declare universal variables.
varX = slv.mkSygusVar(integer, "x")
id1_x = slv.mkTerm(Kind.ApplyUf, id1, varX)
id2_x = slv.mkTerm(Kind.ApplyUf, id2, varX)
id3_x = slv.mkTerm(Kind.ApplyUf, id3, varX)
id4_x = slv.mkTerm(Kind.ApplyUf, id4, varX)
# add semantic constraints
# (constraint (= (id1 x) (id2 x) (id3 x) (id4 x) x))
slv.addSygusConstraint(slv.mkTerm(Kind.And, [slv.mkTerm(Kind.Equal, id1_x, id2_x), slv.mkTerm(Kind.Equal, id1_x, id3_x), slv.mkTerm(Kind.Equal, id1_x, id4_x), slv.mkTerm(Kind.Equal, id1_x, varX)]))
# print solutions if available
if (slv.checkSynth().isUnsat()):
# Output should be equivalent to:
# (define-fun id1 ((x Int)) Int (+ x (+ x (- x))))
# (define-fun id2 ((x Int)) Int x)
# (define-fun id3 ((x Int)) Int (+ x 0))
# (define-fun id4 ((x Int)) Int (+ x (+ x (- x))))
terms = [id1, id2, id3, id4]
utils.print_synth_solutions(terms, slv.getSynthSolutions(terms))
|
