mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 11:25:51 +00:00
7368f9f7d3
- increase build version to 4.12.1. This prepares updated release for MacOs-11 build on x86 - move literal propagation mode in euf-egraph to a callback and traversal of equivalence class. Track antecedent by newest equality instead of root. This makes equality propagation to literals have similar behavior as in legacy solver and appears to result in a speedup (10% fewer conflicts on QF_UF/QG-classification/qg5/iso_icl478.smt2 in preliminary testing) - fix interaction of pre-processing and assumptions. Pre-processing has to freeze assumption literals so they don't get eliminated. This is similar to dependencies that are already frozen.
37 lines
967 B
C
37 lines
967 B
C
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
arith_bounds_tactic.h
|
|
|
|
Abstract:
|
|
|
|
Fast/rudimentary arithmetic subsumption tactic.
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2012-9-6
|
|
|
|
Notes:
|
|
|
|
Background: The Farkas learner in PDR generates tons
|
|
of inequalities that contain redundancies.
|
|
It therefore needs a fast way to reduce these redundancies before
|
|
passing the results to routines that are more expensive.
|
|
The arith subsumption_strategy encapsulates a rudimentary
|
|
routine for simplifying inequalities. Additional simplification
|
|
routines can be added here or composed with this strategy.
|
|
|
|
Note: The bound_manager subsumes some of the collection methods used
|
|
for assembling bounds, but it does not have a way to check for
|
|
subsumption of atoms.
|
|
|
|
## Tactic arith-bounds
|
|
|
|
--*/
|
|
#pragma once
|
|
#include "tactic/tactic.h"
|
|
|
|
tactic * mk_arith_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
|
|
|