mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
7a4a17b193
This introduces a general way to use public enums both in the C++ and the (upcoming) C API. For the C++ case, we now use enum classes rather than enums for public enums. This also includes definitions for C API to_string conversions for public enums. C API definitions in cvc5_types.h are only included from the C API, guarded via a macro (thus, for now, not included yet when the header is included).
83 lines
2.4 KiB
C++
83 lines
2.4 KiB
C++
/******************************************************************************
|
|
* Top contributors (to current version):
|
|
* Aina Niemetz, Tim King, Mathias Preiner
|
|
*
|
|
* This file is part of the cvc5 project.
|
|
*
|
|
* Copyright (c) 2009-2022 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 linear arithmetic solving capabilities and
|
|
* the push pop of cvc5. This also gives an example option.
|
|
*/
|
|
|
|
#include <iostream>
|
|
|
|
#include <cvc5/cvc5.h>
|
|
|
|
using namespace std;
|
|
using namespace cvc5;
|
|
|
|
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.mkConst(integer, "x");
|
|
Term y = slv.mkConst(real, "y");
|
|
|
|
// Constants
|
|
Term three = slv.mkInteger(3);
|
|
Term neg2 = slv.mkInteger(-2);
|
|
Term two_thirds = slv.mkReal(2, 3);
|
|
|
|
// Terms
|
|
Term three_y = slv.mkTerm(Kind::MULT, {three, y});
|
|
Term diff = slv.mkTerm(Kind::SUB, {y, x});
|
|
|
|
// Formulas
|
|
Term x_geq_3y = slv.mkTerm(Kind::GEQ, {x, three_y});
|
|
Term x_leq_y = slv.mkTerm(Kind::LEQ, {x, y});
|
|
Term neg2_lt_x = slv.mkTerm(Kind::LT, {neg2, x});
|
|
|
|
Term assertions = slv.mkTerm(Kind::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(Kind::LEQ, {diff, two_thirds});
|
|
cout << "Prove that " << diff_leq_two_thirds << " with cvc5." << endl;
|
|
cout << "cvc5 should report UNSAT." << endl;
|
|
cout << "Result from cvc5 is: "
|
|
<< slv.checkSatAssuming(diff_leq_two_thirds.notTerm()) << endl;
|
|
slv.pop();
|
|
|
|
cout << endl;
|
|
|
|
slv.push();
|
|
Term diff_is_two_thirds = slv.mkTerm(Kind::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 cvc5." << endl;
|
|
cout << "cvc5 should report SAT." << endl;
|
|
cout << "Result from cvc5 is: " << slv.checkSat() << endl;
|
|
slv.pop();
|
|
|
|
cout << "Thus the maximum value of (y - x) is 2/3."<< endl;
|
|
|
|
return 0;
|
|
}
|