./math/z3, The Z3 theorem prover / SMT solver

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 4.8.3nb1, Package name: z3-4.8.3nb1, Maintainer: dholland

z3 is an open source theorem prover / SMT solver from Microsoft Research.

(SMT stands for "satisfiability modulo theories".)

Required to run:
[lang/ocaml] [math/ocaml-num] [lang/python37]

Required to build:

Package options: ocaml

Master sites:

SHA1: bc713372c9be6808306a8e0844caf27c0a10ee2c
RMD160: 3b8bc18719725c0d110ca52f7e692519cbac341e
Filesize: 4022.574 KB

Version history: (Expand)

CVS history: (Expand)

   2020-05-31 22:49:34 by Joerg Sonnenberger | Files touched by this commit (14)
Log message:
Explicitly read files as unicode for Python 3. The content is converted
using the system locale with Python 3.6 otherwise, falling back to
   2019-04-25 09:33:32 by Maya Rashish | Files touched by this commit (620)
Log message:
PKGREVISION bump for anything using python without a PYPKGPREFIX.

This is a semi-manual PKGREVISION bump.
   2018-12-18 07:46:39 by Kamil Rytarowski | Files touched by this commit (11)
Log message:
z3: Upgrade to 4.8.3

Eliminate merged patches.
Improve java support.

Patch by Michal Gorny.

Upstream changelog
This release covers
    bug fixes since 4.8.1
    .NET bindings for dotnet standard 1.4 on windows and 64 bit Linux systems \ 
and MacOs

    New requirements:
        A breaking change to the API is that parsers for SMT-LIB2 formulas \ 
return a vector of
        formulas as opposed to a conjunction of formulas. The vector of formulas \ 
correspond to
        the set of "assert" instructions in the SMT-LIB input.

    New features
        A parallel mode is available for select theories, including QF_BV.
        By setting parallel.enable=true Z3 will spawn a number of worker threads \ 
proportional to the
        number of available CPU cores to apply cube and conquer solving on the goal.
        The SAT solver by default handle cardinality and PB constraints using a \ 
custom plugin
        that operates directly on cardinality and PB constraints.
        A "cube" interface is exposed over the solver API.
        Model conversion is first class over the textual API, such that subgoals \ 
created from running a
        solver can be passed in text files and a model for the original formula \ 
can be recreated from the result.
        This has also led to changes in how models are tracked over tactic \ 
subgoals. The API for
        extracting models from apply_result have been replaced.
        An optional mode handles xor constraints using a custom xor propagator.
        It is off by default and its value not demonstrated.
        The SAT solver includes new inprocessing techniques that are available \ 
during simplification.
        It performs asymmetric tautology elimination by default, and one can \ 
turn on more powerful inprocessing techniques
        (known as ACCE, ABCE, CCE). Asymmetric branching also uses features \ 
introduced in Lingeling by exploiting binary implication graphs.
        Use sat.acce=true to enable the full repertoire of inprocessing methods. \ 
By default, clauses that are "eliminated" by acce are tagged
        as lemmas (redundant) and are garbage collected if their glue level is high.
        Substantial overhaul of the spacer horn clause engine.
        Added basic features to support Lambda bindings.
        Added model compression to eliminate local function definitions in \ 
models when
        inlining them does not incur substantial overhead. The old behavior, \ 
where models are left
        uncompressed can be replayed by setting the top-level parameter \ 
        Integration of a new solver for linear integer arithmetic and mixed \ 
linear integer arithmetic by Lev Nachmanson.
        It incorporates several improvements to QF_LIA solving based on
        . using a better LP engine, which is already the foundation for QF_LRA
        . including cuts based on Hermite Normal Form (thanks to approaches described
        in "cuts from proofs" and "cutting the mix").
        . extracting integer solutions from LP solutions by tightening bounds \ 
        We use a generalization of Bromberger and Weidenbach that allows \ 
avoiding selected
        bounds tighthenings (https://easychair.org/publications/paper/qGfG).
        It solves significantly more problems in the QF_LIA category and may at \ 
this point also
        be the best solver for your problem as well.
        The new solver is enabled only for select SMT-LIB logics. These include \ 
        Other theories (still) use the legacy solver for arithmetic. You can \ 
enable the new solver by setting
        the parameter smt.arith.solver=6 to give it a spin.

    Removed features:
        interpolation API
        duality engine for constrained Horn clauses.
        pdr engine for constrained Horn clauses. The engine's functionality has been
        folded into spacer as one of optional strategies.
        long deprecated API functions have been removed from z3_api.h

Z3 4.7.1. official release

    cumulative bug fix since 4.6.0
    minor version incremented as API now uses stdbool and stdint: bool and \ 
int64_t, uint64_t

Official release Z3 4.6.0.
   2018-11-12 17:10:29 by Jaap Boender | Files touched by this commit (141) | Package updated
Log message:
Revbumps associated with update of lang/ocaml.
   2018-10-01 13:21:03 by Jonathan Perkin | Files touched by this commit (2)
Log message:
z3: rlim_t fixes.
   2018-07-19 17:15:31 by Jaap Boender | Files touched by this commit (190) | Package updated
Log message:
Recursive revbump associated with the update of lang/ocaml to 4.07.
   2018-06-15 17:11:35 by Jonathan Perkin | Files touched by this commit (2)
Log message:
z3: Fix broken build system by pretending SunOS is Linux.
   2018-04-13 15:55:39 by Jaap Boender | Files touched by this commit (88)
Log message:
Revbump associated with the upgrade of lang/ocaml

(this is the upgrade from 4.06 to 4.06.1)