summaryrefslogtreecommitdiff
path: root/examples/api/sygus-fun.cpp
blob: 0f96e72a7d6f38c6747da42ce3dcea9e7638ba1c (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
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
/******************************************************************************
 * Top contributors (to current version):
 *   Abdalrhman Mohamed, Mudathir Mohamed, Aina Niemetz
 *
 * 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 Sygus API.
 *
 * A simple demonstration of how to use the Sygus API to synthesize max and min
 * functions. Here is the same problem written in Sygus V2 format:
 *
 * (set-logic LIA)
 *
 * (synth-fun max ((x Int) (y Int)) Int
 *   ((Start Int) (StartBool Bool))
 *   ((Start Int (0 1 x y
 *                (+ Start Start)
 *                (- Start Start)
 *                (ite StartBool Start Start)))
 *    (StartBool Bool ((and StartBool StartBool)
 *                     (not StartBool)
 *                     (<= Start Start)))))
 *
 * (synth-fun min ((x Int) (y Int)) Int)
 *
 * (declare-var x Int)
 * (declare-var y Int)
 *
 * (constraint (>= (max x y) x))
 * (constraint (>= (max x y) y))
 * (constraint (or (= x (max x y))
 *                 (= y (max x y))))
 * (constraint (= (+ (max x y) (min x y))
 *                (+ x y)))
 *
 * (check-synth)
 *
 * The printed output for this example 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))
 * )
 */

#include <cvc5/cvc5.h>

#include <iostream>

#include "utils.h"

using namespace cvc5::api;

int main()
{
  Solver slv;

  // required options
  slv.setOption("lang", "sygus2");
  slv.setOption("incremental", "false");

  // set the logic
  slv.setLogic("LIA");

  Sort integer = slv.getIntegerSort();
  Sort boolean = slv.getBooleanSort();

  // declare input variables for the functions-to-synthesize
  Term x = slv.mkVar(integer, "x");
  Term y = slv.mkVar(integer, "y");

  // declare the grammar non-terminals
  Term start = slv.mkVar(integer, "Start");
  Term start_bool = slv.mkVar(boolean, "StartBool");

  // define the rules
  Term zero = slv.mkInteger(0);
  Term one = slv.mkInteger(1);

  Term plus = slv.mkTerm(PLUS, start, start);
  Term minus = slv.mkTerm(MINUS, start, start);
  Term ite = slv.mkTerm(ITE, start_bool, start, start);

  Term And = slv.mkTerm(AND, start_bool, start_bool);
  Term Not = slv.mkTerm(NOT, start_bool);
  Term leq = slv.mkTerm(LEQ, start, start);

  // create the grammar object
  Grammar g = slv.mkSygusGrammar({x, y}, {start, start_bool});

  // bind each non-terminal to its rules
  g.addRules(start, {zero, one, x, y, plus, minus, ite});
  g.addRules(start_bool, {And, Not, leq});

  // declare the functions-to-synthesize. Optionally, provide the grammar
  // constraints
  Term max = slv.synthFun("max", {x, y}, integer, g);
  Term min = slv.synthFun("min", {x, y}, integer);

  // declare universal variables.
  Term varX = slv.mkSygusVar(integer, "x");
  Term varY = slv.mkSygusVar(integer, "y");

  Term max_x_y = slv.mkTerm(APPLY_UF, max, varX, varY);
  Term min_x_y = slv.mkTerm(APPLY_UF, min, varX, varY);

  // add semantic constraints
  // (constraint (>= (max x y) x))
  slv.addSygusConstraint(slv.mkTerm(GEQ, max_x_y, varX));

  // (constraint (>= (max x y) y))
  slv.addSygusConstraint(slv.mkTerm(GEQ, max_x_y, varY));

  // (constraint (or (= x (max x y))
  //                 (= y (max x y))))
  slv.addSygusConstraint(slv.mkTerm(
      OR, slv.mkTerm(EQUAL, max_x_y, varX), slv.mkTerm(EQUAL, max_x_y, varY)));

  // (constraint (= (+ (max x y) (min x y))
  //                (+ x y)))
  slv.addSygusConstraint(slv.mkTerm(
      EQUAL, slv.mkTerm(PLUS, max_x_y, min_x_y), slv.mkTerm(PLUS, varX, varY)));

  // print solutions if available
  if (slv.checkSynth().isUnsat())
  {
    // 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))
    // )
    std::vector<Term> terms = {max, min};
    printSynthSolutions(terms, slv.getSynthSolutions(terms));
  }

  return 0;
}
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback