mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
56e14c4639
This PR moves the public API headers into a top-level include directory. This makes it easier to find the public API of cvc5 and makes the install headers script obsolete. Fixes #9553 Fixes #9556
78 lines
2.7 KiB
C++
78 lines
2.7 KiB
C++
/******************************************************************************
|
|
* Top contributors (to current version):
|
|
* Andrew Reynolds, 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.
|
|
* ****************************************************************************
|
|
*
|
|
* Test for project issue #455
|
|
*
|
|
*/
|
|
|
|
#include <cvc5/cvc5.h>
|
|
|
|
#include <cassert>
|
|
|
|
#include "base/configuration.h"
|
|
|
|
using namespace cvc5;
|
|
|
|
int main(void)
|
|
{
|
|
if (!internal::Configuration::isBuiltWithPoly())
|
|
{
|
|
return 0;
|
|
}
|
|
Solver slv;
|
|
slv.setLogic("QF_UFNRA");
|
|
slv.setOption("produce-unsat-assumptions", "true");
|
|
slv.setOption("incremental", "false");
|
|
slv.setOption("produce-models", "true");
|
|
Sort s1 = slv.mkUninterpretedSort("_u0");
|
|
Sort s2 = slv.getRealSort();
|
|
Term t1 = slv.mkConst(s2, "_x4");
|
|
Term t2 = slv.mkConst(s1, "_x5");
|
|
Term t3 = slv.mkConst(s2, "_x7");
|
|
Term t4 = slv.mkReal("2");
|
|
Term t5 = slv.mkConst(s2, "_x10");
|
|
Term t6 = slv.mkConst(s2, "_x11");
|
|
Term t7 = slv.mkReal("3615783917");
|
|
Term t8 = slv.mkConst(s2, "_x14");
|
|
Term t9 = slv.mkConst(s2, "_x15");
|
|
Term t10 = slv.mkTerm(Kind::ADD, {t5, t9});
|
|
Term t11 = slv.mkTerm(Kind::ADD, {t10, t7, t8, t6});
|
|
Term t12 = slv.mkTerm(Kind::LEQ, {t4, t11});
|
|
Term t13 = slv.mkTerm(Kind::SUB, {t11, t6});
|
|
Term t14 = slv.mkTerm(Kind::SUB, {t6, t13});
|
|
Term t15 = slv.mkTerm(Kind::MULT, {t4, t4});
|
|
Term t16 = slv.mkTerm(Kind::GT, {t15, t11});
|
|
Term t17 = slv.mkTerm(Kind::SUB, {t11, t3});
|
|
Term t18 = slv.mkTerm(Kind::LEQ, {t17, t7});
|
|
Term t19 = slv.mkTerm(Kind::IMPLIES, {t18, t12});
|
|
Term t20 = slv.mkTerm(Kind::GEQ, {t1, t3});
|
|
Term t21 = slv.mkTerm(Kind::MULT, {t7, t13});
|
|
Term t22 = slv.mkTerm(Kind::MULT, {t21, t14});
|
|
Term t23 = slv.mkTerm(Kind::SUB, {t14, t3});
|
|
Term t24 = slv.mkVar(s2, "_f19_0");
|
|
Term t25 = slv.mkVar(s2, "_f19_1");
|
|
Term t26 = slv.mkVar(s1, "_f19_2");
|
|
Term t27 = slv.mkVar(s2, "_f19_3");
|
|
Term t28 = slv.mkVar(s1, "_f19_4");
|
|
Term t29 = slv.defineFun("_f19", {t24, t25, t26, t27, t28}, t24.getSort(), t24);
|
|
Term t30 = slv.mkTerm(Kind::DISTINCT, {t19, t20, t16});
|
|
Term t31 = slv.mkTerm(Kind::ITE, {t30, t9, t22});
|
|
Term t32 = slv.mkTerm(Kind::DIVISION, {t11, t6, t10});
|
|
Term t33 = slv.mkTerm(Kind::GEQ, {t32, t3});
|
|
Term t34 = slv.mkTerm(Kind::APPLY_UF, {t29, t31, t3, t2, t3, t2});
|
|
Term t35 = slv.mkTerm(Kind::GEQ, {t34, t23});
|
|
Term t36 = slv.mkTerm(Kind::NOT, {t35});
|
|
slv.assertFormula({t36});
|
|
slv.assertFormula({t33});
|
|
slv.checkSatAssuming({t18.notTerm()});
|
|
}
|