mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 17:45:32 +00:00
Code Activity

univariate solver seems to work

Browse source
This commit is contained in:
Jakob Rath 2022-03-11 18:06:32 +01:00
parent 1de51da67e
commit c4370eb7e6
4 changed files with 143 additions and 34 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/test/CMakeLists.txt
View file

@ -3,7 +3,7 @@ add_subdirectory(lp)
################################################################################
# z3-test executable
################################################################################
set(z3_test_deps api fuzzing simplex polysat)
set(z3_test_deps api fuzzing simplex polysat polysat_univariate_solver)
z3_expand_dependencies(z3_test_expanded_deps ${z3_test_deps})
set (z3_test_extra_object_files "")
foreach (component ${z3_test_expanded_deps})

74
src/test/viable.cpp
View file

@ -1,6 +1,7 @@
#include "math/polysat/log.h"
#include "math/polysat/solver.h"
#include "math/polysat/viable.h"
#include "math/polysat/univariate/univariate_solver.h"
namespace polysat {
@ -113,11 +114,80 @@ namespace polysat {
vector<std::pair<unsigned, unsigned>> intervals;
test_intervals(3, intervals);
}
static void test_univariate() {
std::cout << "\ntest_univariate\n";
unsigned bw = 32;
rational modulus = rational::power_of_two(bw);
auto factory = mk_univariate_bitblast_factory();
auto solver = (*factory)(bw);
vector<rational> lhs;
vector<rational> rhs;
// c0: 2x+10 <= 123
lhs.clear();
lhs.push_back(rational(10));
lhs.push_back(rational(2));
rhs.clear();
rhs.push_back(rational(123));
solver->add_ule(lhs, rhs, false, 0);
std::cout << "status: " << solver->check() << "\n";
std::cout << "model: " << solver->model() << "\n";
solver->push();
// c1: x*x == 16
lhs.clear();
lhs.push_back(modulus - 16);
lhs.push_back(rational(0));
lhs.push_back(rational(1));
rhs.clear();
solver->add_ule(lhs, rhs, false, 1);
std::cout << "status: " << solver->check() << "\n";
std::cout << "model: " << solver->model() << "\n";
solver->push();
// c2: x <= 1000
lhs.clear();
lhs.push_back(rational(0));
lhs.push_back(rational(1));
rhs.clear();
rhs.push_back(rational(1000));
solver->add_ule(lhs, rhs, false, 2);
// std::cout << *solver << '\n';
std::cout << "status: " << solver->check() << "\n";
std::cout << "model: " << solver->model() << "\n";
solver->pop(2);
// c3: umul_ovfl(2, x)
lhs.clear();
lhs.push_back(rational(2));
rhs.clear();
rhs.push_back(rational(0));
rhs.push_back(rational(1));
solver->add_umul_ovfl(lhs, rhs, false, 3);
std::cout << "status: " << solver->check() << "\n";
std::cout << "model: " << solver->model() << "\n";
// c4: 1000 > x
lhs.clear();
lhs.push_back(rational(1000));
rhs.clear();
rhs.push_back(rational(0));
rhs.push_back(rational(1));
solver->add_ule(lhs, rhs, true, 4);
std::cout << "status: " << solver->check() << "\n";
std::cout << "core: " << solver->unsat_core() << "\n";
}
}
void tst_viable() {
polysat::test1();
polysat::test2();
}
// polysat::test2();
polysat::test_univariate();
}