Clemens Eisenhofer
|
6b48b25beb
|
Draft: Made division/remainder to op_constraints (not yet used - old code still called)
|
2023-02-09 23:36:15 +01:00 |
|
Jakob Rath
|
b460150f98
|
tried logic ALL for univariate solver
Allows us to solve bench25 but some others turn into unknown
|
2023-01-25 11:42:02 +01:00 |
|
Jakob Rath
|
7fbf27309b
|
rename
|
2023-01-25 11:42:02 +01:00 |
|
Jakob Rath
|
26e7d0d35a
|
We need to use expr_ref when storing expressions across add calls
Without this, bench3 created a constraint 2^parity == x * parity which
should have been 2^parity == x * x_inv.
|
2023-01-16 15:41:04 +01:00 |
|
Clemens Eisenhofer
|
4a6053b289
|
Missing univariate for pseudo-inverse
|
2023-01-05 18:02:21 +01:00 |
|
Jakob Rath
|
86a36a524a
|
Fix unsoundness in viable fallback
(the src constraint of forbidden intervals is not necessarily univariate)
|
2022-12-19 15:37:49 +01:00 |
|
Jakob Rath
|
868a3710e0
|
fix segfault
|
2022-12-19 14:25:58 +01:00 |
|
Jakob Rath
|
59592754d8
|
minor univariate tweak
|
2022-12-19 14:07:57 +01:00 |
|
Nikolaj Bjorner
|
1940f53b31
|
fix memory smash in cache push
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2022-12-18 12:33:58 -08:00 |
|
Nikolaj Bjorner
|
899b1f8f7e
|
fiddle with univariate
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2022-12-17 20:02:46 -08:00 |
|
Nikolaj Bjorner
|
4e8bd4425f
|
add find_two
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2022-12-17 19:41:09 -08:00 |
|
Jakob Rath
|
afde0e993c
|
Add bitblasting fallback to viable::query
(integration between conflict/viable is still messy)
|
2022-12-16 13:02:54 +01:00 |
|
Jakob Rath
|
8a5f1af3d1
|
univariate::find_max
|
2022-12-15 15:59:15 +01:00 |
|
Jakob Rath
|
31e0add966
|
univariate::find_min
|
2022-12-15 15:51:29 +01:00 |
|
Jakob Rath
|
37536425f4
|
Encode 2^k*x as (bvshl x k) in the fallback solver
|
2022-12-15 14:03:42 +01:00 |
|
Jakob Rath
|
a6504785b5
|
print bitblasted constraints
|
2022-12-15 13:43:23 +01:00 |
|
Jakob Rath
|
2f65ce1026
|
try to fix build
|
2022-09-21 14:03:07 +02:00 |
|
Jakob Rath
|
058c5771b9
|
univariate solver: add_bit
|
2022-08-22 15:09:11 +02:00 |
|
Jakob Rath
|
3e99828c3c
|
start make_asserting for non-unit coeff
|
2022-08-19 17:06:28 +02:00 |
|
Jakob Rath
|
63031548cb
|
Store only literals in the conflict state
|
2022-04-11 15:00:06 +02:00 |
|
Nikolaj Bjorner
|
704a41ee36
|
disable polysat inside of recursive solver
|
2022-04-06 13:40:40 +02:00 |
|
Jakob Rath
|
613b0db4cc
|
fix refcount issue
|
2022-03-19 04:19:16 +01:00 |
|
Jakob Rath
|
edeba9b56a
|
support op_constraint in univariate solver
|
2022-03-17 14:03:42 +01:00 |
|
Jakob Rath
|
c4370eb7e6
|
univariate solver seems to work
|
2022-03-11 18:06:32 +01:00 |
|
Jakob Rath
|
74281fa830
|
compile
|
2022-03-11 08:33:10 +01:00 |
|
Jakob Rath
|
8b1f1d0e11
|
begin univariate solver impl
|
2022-03-10 17:58:37 +01:00 |
|
Jakob Rath
|
78028bedae
|
use solver_factory
|
2022-03-10 16:57:08 +01:00 |
|
Jakob Rath
|
4a86c3fb67
|
looks like QF_BV is handled by inc_sat_solver
|
2022-03-10 16:19:35 +01:00 |
|
Jakob Rath
|
afc711d6ec
|
move into separate component
|
2022-03-10 16:10:56 +01:00 |
|