/****************************************************************************** * Top contributors (to current version): * Andrew Reynolds, Aina Niemetz * * This file is part of the cvc5 project. * * Copyright (c) 2009-2025 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 #600 * */ #include using namespace cvc5; int main(void) { TermManager tm; Solver solver(tm); solver.setOption("incremental", "false"); solver.setOption("sets-exp", "true"); solver.setOption("check-abducts", "true"); solver.setOption("produce-abducts", "true"); Sort s0 = tm.mkUninterpretedSort("_u0"); Sort s1 = tm.getRoundingModeSort(); Sort s2 = tm.mkSetSort(s1); Term t3 = tm.mkVar(s2, "_x1"); Term t4 = tm.mkConst(s2, "_x2"); Term t5 = tm.mkVar(s0, "_x4"); Term t6 = tm.mkVar(s1, "_x5"); Term t7 = tm.mkTerm(Kind::SET_IS_SINGLETON, {t4}); Sort s8 = t7.getSort(); Term t9 = tm.mkTerm(Kind::VARIABLE_LIST, {t6, t5, t3}); Sort s10 = t9.getSort(); Term t11 = tm.mkTerm(Kind::SET_COMPREHENSION, {t9, t7, t7}); Sort s12 = t11.getSort(); Term t13 = tm.mkTerm(Kind::SET_CHOOSE, {t11}); solver.assertFormula(t13); Term t14 = solver.getAbduct(t13); return 0; }