2021-04-12 12:31:43 -07:00
|
|
|
/******************************************************************************
|
|
|
|
|
* Top contributors (to current version):
|
2021-10-01 18:21:02 -05:00
|
|
|
* Aina Niemetz, Tim King, Mudathir Mohamed
|
2021-04-12 12:31:43 -07:00
|
|
|
*
|
|
|
|
|
* 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 linear arithmetic solving capabilities and
|
2021-10-01 18:21:02 -05:00
|
|
|
* the push pop of cvc5. This also gives an example option.
|
2021-04-12 12:31:43 -07:00
|
|
|
*/
|
2012-11-30 23:07:19 +00:00
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
import cvc5.*;
|
|
|
|
|
public class LinearArith
|
|
|
|
|
{
|
|
|
|
|
public static void main(String args[]) throws CVC5ApiException
|
|
|
|
|
{
|
|
|
|
|
Solver slv = new Solver();
|
|
|
|
|
slv.setLogic("QF_LIRA"); // Set the logic
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
// Prove that if given x (Integer) and y (Real) then
|
|
|
|
|
// the maximum value of y - x is 2/3
|
|
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
// Sorts
|
|
|
|
|
Sort real = slv.getRealSort();
|
|
|
|
|
Sort integer = slv.getIntegerSort();
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
// Variables
|
2021-10-01 18:21:02 -05:00
|
|
|
Term x = slv.mkConst(integer, "x");
|
|
|
|
|
Term y = slv.mkConst(real, "y");
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
// Constants
|
2021-10-01 18:21:02 -05:00
|
|
|
Term three = slv.mkInteger(3);
|
|
|
|
|
Term neg2 = slv.mkInteger(-2);
|
|
|
|
|
Term two_thirds = slv.mkReal(2, 3);
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
// Terms
|
2021-10-01 18:21:02 -05:00
|
|
|
Term three_y = slv.mkTerm(Kind.MULT, three, y);
|
|
|
|
|
Term diff = slv.mkTerm(Kind.MINUS, y, x);
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
// Formulas
|
2021-10-01 18:21:02 -05:00
|
|
|
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);
|
2012-11-30 23:07:19 +00:00
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
Term assertions = slv.mkTerm(Kind.AND, x_geq_3y, x_leq_y, neg2_lt_x);
|
2012-11-30 23:07:19 +00:00
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
System.out.println("Given the assertions " + assertions);
|
|
|
|
|
slv.assertFormula(assertions);
|
2012-11-30 23:07:19 +00:00
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
slv.push();
|
|
|
|
|
Term diff_leq_two_thirds = slv.mkTerm(Kind.LEQ, diff, two_thirds);
|
|
|
|
|
System.out.println("Prove that " + diff_leq_two_thirds + " with cvc5.");
|
|
|
|
|
System.out.println("cvc5 should report ENTAILED.");
|
|
|
|
|
System.out.println("Result from cvc5 is: " + slv.checkEntailed(diff_leq_two_thirds));
|
|
|
|
|
slv.pop();
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
System.out.println();
|
|
|
|
|
|
2021-10-01 18:21:02 -05:00
|
|
|
slv.push();
|
|
|
|
|
Term diff_is_two_thirds = slv.mkTerm(Kind.EQUAL, diff, two_thirds);
|
|
|
|
|
slv.assertFormula(diff_is_two_thirds);
|
|
|
|
|
System.out.println("Show that the assertions are consistent with ");
|
|
|
|
|
System.out.println(diff_is_two_thirds + " with cvc5.");
|
|
|
|
|
System.out.println("cvc5 should report SAT.");
|
|
|
|
|
System.out.println("Result from cvc5 is: " + slv.checkSat());
|
|
|
|
|
slv.pop();
|
2012-11-30 23:07:19 +00:00
|
|
|
|
|
|
|
|
System.out.println("Thus the maximum value of (y - x) is 2/3.");
|
|
|
|
|
}
|
2021-10-01 18:21:02 -05:00
|
|
|
}
|