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
|
/********************* */
/*! \file linear_arith-new.cpp
** \verbatim
** Top contributors (to current version):
** Aina Niemetz, Makai Mann
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 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.\endverbatim
**
** \brief A simple demonstration of the linear arithmetic capabilities of CVC4
**
** A simple demonstration of the linear arithmetic solving capabilities and
** the push pop of CVC4. This also gives an example option.
**/
#include <iostream>
// #include "cvc4/api/cvc4cpp.h" // use this after CVC4 is properly installed
#include "api/cvc4cpp.h"
using namespace std;
using namespace CVC4::api;
int main()
{
Solver slv;
slv.setLogic("QF_LIRA"); // Set the logic
// Prove that if given x (Integer) and y (Real) then
// the maximum value of y - x is 2/3
// Sorts
Sort real = slv.getRealSort();
Sort integer = slv.getIntegerSort();
// Variables
Term x = slv.mkVar(integer, "x");
Term y = slv.mkVar(real, "y");
// Constants
Term three = slv.mkReal(3);
Term neg2 = slv.mkReal(-2);
Term two_thirds = slv.mkReal(2, 3);
// Terms
Term three_y = slv.mkTerm(MULT, three, y);
Term diff = slv.mkTerm(MINUS, y, x);
// Formulas
Term x_geq_3y = slv.mkTerm(GEQ, x, three_y);
Term x_leq_y = slv.mkTerm(LEQ, x, y);
Term neg2_lt_x = slv.mkTerm(LT, neg2, x);
Term assertions =
slv.mkTerm(AND, x_geq_3y, x_leq_y, neg2_lt_x);
cout << "Given the assertions " << assertions << endl;
slv.assertFormula(assertions);
slv.push();
Term diff_leq_two_thirds = slv.mkTerm(LEQ, diff, two_thirds);
cout << "Prove that " << diff_leq_two_thirds << " with CVC4." << endl;
cout << "CVC4 should report VALID." << endl;
cout << "Result from CVC4 is: "
<< slv.checkValidAssuming(diff_leq_two_thirds) << endl;
slv.pop();
cout << endl;
slv.push();
Term diff_is_two_thirds = slv.mkTerm(EQUAL, diff, two_thirds);
slv.assertFormula(diff_is_two_thirds);
cout << "Show that the assertions are consistent with " << endl;
cout << diff_is_two_thirds << " with CVC4." << endl;
cout << "CVC4 should report SAT." << endl;
cout << "Result from CVC4 is: " << slv.checkSat() << endl;
slv.pop();
cout << "Thus the maximum value of (y - x) is 2/3."<< endl;
return 0;
}
|