head 1.9; access; symbols pkgsrc-2026Q1:1.9.0.12 pkgsrc-2026Q1-base:1.9 pkgsrc-2025Q4:1.9.0.10 pkgsrc-2025Q4-base:1.9 pkgsrc-2025Q3:1.9.0.8 pkgsrc-2025Q3-base:1.9 pkgsrc-2025Q2:1.9.0.6 pkgsrc-2025Q2-base:1.9 pkgsrc-2025Q1:1.9.0.4 pkgsrc-2025Q1-base:1.9 pkgsrc-2024Q4:1.9.0.2 pkgsrc-2024Q4-base:1.9 pkgsrc-2024Q3:1.8.0.2 pkgsrc-2024Q3-base:1.8 pkgsrc-2024Q2:1.7.0.4 pkgsrc-2024Q2-base:1.7 pkgsrc-2024Q1:1.7.0.2 pkgsrc-2024Q1-base:1.7 pkgsrc-2023Q4:1.6.0.6 pkgsrc-2023Q4-base:1.6 pkgsrc-2023Q3:1.6.0.4 pkgsrc-2023Q3-base:1.6 pkgsrc-2023Q2:1.6.0.2 pkgsrc-2023Q2-base:1.6 pkgsrc-2023Q1:1.4.0.24 pkgsrc-2023Q1-base:1.4 pkgsrc-2022Q4:1.4.0.22 pkgsrc-2022Q4-base:1.4 pkgsrc-2022Q3:1.4.0.20 pkgsrc-2022Q3-base:1.4 pkgsrc-2022Q2:1.4.0.18 pkgsrc-2022Q2-base:1.4 pkgsrc-2022Q1:1.4.0.16 pkgsrc-2022Q1-base:1.4 pkgsrc-2021Q4:1.4.0.14 pkgsrc-2021Q4-base:1.4 pkgsrc-2021Q3:1.4.0.12 pkgsrc-2021Q3-base:1.4 pkgsrc-2021Q2:1.4.0.10 pkgsrc-2021Q2-base:1.4 pkgsrc-2021Q1:1.4.0.8 pkgsrc-2021Q1-base:1.4 pkgsrc-2020Q4:1.4.0.6 pkgsrc-2020Q4-base:1.4 pkgsrc-2020Q3:1.4.0.4 pkgsrc-2020Q3-base:1.4 pkgsrc-2020Q2:1.4.0.2 pkgsrc-2020Q2-base:1.4 pkgsrc-2020Q1:1.3.0.2 pkgsrc-2020Q1-base:1.3 pkgsrc-2019Q4:1.3.0.4 pkgsrc-2019Q4-base:1.3 pkgsrc-2019Q3:1.2.0.8 pkgsrc-2019Q3-base:1.2 pkgsrc-2019Q2:1.2.0.6 pkgsrc-2019Q2-base:1.2 pkgsrc-2019Q1:1.2.0.4 pkgsrc-2019Q1-base:1.2 pkgsrc-2018Q4:1.2.0.2 pkgsrc-2018Q4-base:1.2 pkgsrc-2018Q3:1.1.0.6 pkgsrc-2018Q3-base:1.1 pkgsrc-2018Q2:1.1.0.4 pkgsrc-2018Q2-base:1.1 pkgsrc-2018Q1:1.1.0.2 pkgsrc-2018Q1-base:1.1; locks; strict; comment @# @; 1.9 date 2024.11.11.07.28.43; author wiz; state Exp; branches; next 1.8; commitid 1fBDq3LwS98NncxF; 1.8 date 2024.08.13.09.21.07; author adam; state Exp; branches; next 1.7; commitid MhD64uLWnEU1UDlF; 1.7 date 2024.01.23.20.01.03; author adam; state Exp; branches; next 1.6; commitid uA7ky0RJzyZXXBVE; 1.6 date 2023.05.16.19.23.05; author wiz; state Exp; branches; next 1.5; commitid jEMPu2S2OBPmRdpE; 1.5 date 2023.05.11.06.43.43; author adam; state Exp; branches; next 1.4; commitid NkSzgCRCxrwEOvoE; 1.4 date 2020.05.31.20.47.23; author joerg; state Exp; branches; next 1.3; commitid yUk1Tjlbfl9y2raC; 1.3 date 2019.11.02.16.16.22; author rillig; state Exp; branches; next 1.2; commitid 8i1eJQVJcj8NjiJB; 1.2 date 2018.12.23.12.27.34; author wiz; state Exp; branches; next 1.1; commitid E1NeC55alhxp9V4B; 1.1 date 2018.03.13.00.36.05; author khorben; state Exp; branches; next ; commitid a0ifoeNMdVPdneuA; desc @@ 1.9 log @py-*: remove unused tool dependency py-setuptools includes the py-wheel functionality nowadays @ text @# $NetBSD: Makefile,v 1.8 2024/08/13 09:21:07 adam Exp $ .include "../../math/z3/Makefile.common" PKGNAME= ${PYPKGPREFIX}-${DISTNAME} COMMENT= Efficient SMT solver library TOOL_DEPENDS+= ${PYPKGPREFIX}-setuptools>=46.4.0:../../devel/py-setuptools DEPENDS+= ${PYPKGPREFIX}-importlib-resources-[0-9]*:../../devel/py-importlib-resources USE_TOOLS+= cmake ninja PYSETUPSUBDIR= src/api/python WHEEL_NAME= ${DISTNAME:S/z3/z3_solver/}.0 .include "../../mk/bsd.prefs.mk" post-install: # same binary as in math/z3 ${RM} ${DESTDIR}${PREFIX}/bin/z3 .if ${OPSYS} == "Darwin" install_name_tool -id ${PREFIX}/${PYSITELIB}/z3/lib/libz3.${PKGVERSION_NOREV:R}.dylib \ ${DESTDIR}${PREFIX}/${PYSITELIB}/z3/lib/libz3.${PKGVERSION_NOREV:R}.dylib install_name_tool -id ${PREFIX}/${PYSITELIB}/z3/lib/libz3.dylib \ ${DESTDIR}${PREFIX}/${PYSITELIB}/z3/lib/libz3.dylib .endif .include "../../lang/python/wheel.mk" .include "../../math/z3/buildlink3.mk" .include "../../mk/bsd.pkg.mk" @ 1.8 log @z3 py-z3: updated to 4.13.0 Version 4.13.0 - add ARM64 wheels for Python, thanks to Steven Moy, smoy @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.7 2024/01/23 20:01:03 adam Exp $ a8 1 TOOL_DEPENDS+= ${PYPKGPREFIX}-wheel-[0-9]*:../../devel/py-wheel @ 1.7 log @z3 py-z3: updated to 4.12.5 z3-4.12.5 update release scripts and notes track quantifier instantiation method in proof hint prepare for release add status badge for windows build, remove windows build from Azure pipelines add Windows build free memory the clean way free memory the clean way encapsulate anum functionality add explicit move constructor to deal with unit test regression test-z3 algebraic on Windows/debug - encapsulate mpz a bit more @ text @d1 1 a1 3 # $NetBSD: Makefile,v 1.6 2023/05/16 19:23:05 wiz Exp $ PYTHON_VERSIONS_INCOMPATIBLE= 27 @ 1.6 log @py-z3: not for Python 2 @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.5 2023/05/11 06:43:43 adam Exp $ d10 4 d16 1 a16 1 EGG_NAME= ${DISTNAME:S/z3/z3_solver/}.0 d30 1 a30 1 .include "../../lang/python/egg.mk" @ 1.5 log @z3 py-z3: updated to 4.12.1 Version 4.12.1 ============== - change macos build to use explicit reference to Macos version 11. Hosted builds are migrating to macos-12 and it broke a user Version 4.12.0 ============== - add clause logging API. - The purpose of logging API and self-checking is to enable an array of use cases. - proof mining (what instantiations did Z3 use)? - A refresh of the AxiomProfiler could use the logging API. The (brittle) trace feature should be deprecated. - debugging - a built-in self certifier implements a custom proof checker for the format used by the new solver (sat.euf=true). - other potential options: - integration into certified tool chains - interpolation - Z3_register_on_clause (also exposed over C++, Python and .Net) - it applies to z3's main CDCL(T) core and a new CDCL(T) core (sat.euf=true). - The added API function allows to register a callback for when clauses are inferred. More precisely, when clauses are assumed (as part of input), deleted, or deduced. Clauses that are deduced by the CDCL SAT engine using standard inferences are marked as 'rup'. Clauses that are deduced by theories are marked by default by 'smt', and when more detailed information is available with proof hints or proof objects. Instantations are considered useful to track so they are logged using terms of the form (inst (not (forall (x) body)) body[t/x] (bind t)), where 'inst' is a name of a function that produces a proof term representing the instantiation. - add options for proof logging, trimming, and checking for the new core. - sat.smt.proof (symbol) add SMT proof to file (default: ) - sat.smt.proof.check (bool) check SMT proof while it is created (default: false) - it applies a custom self-validator. The self-validator comprises of several small checkers and represent a best-effort validation mechanism. If there are no custom validators associated with inferences, or the custom validators fail to certify inferences, the self-validator falls back to invoking z3 (SMT) solving on the lemma. - euf - propagations and conflicts from congruence closure (theory of equality and uninterpreted functions) are checked based on a proof format that tracks uses of congruence closure and equalities. It only performs union find operations. - tseitin - clausification steps are checked for Boolean operators. - farkas, bound, implies_eq - arithmetic inferences that can be justified using a combination of Farkas lemma and cuts are checked. Note: the arithmetic solver may produce proof hints that the proof checker cannot check. It is mainly a limitation of the arithmetic solver not pulling relevant information. Ensuring a tight coupling with proof hints and the validator capabilites is open ended future work and good material for theses. - bit-vector inferences - are treated as trusted (there is no validation, it always blindly succeeds) - arrays, datatypes - there is no custom validation for other theories at present. Lemmas are validated using SMT. - sat.smt.proof.check_rup (bool) apply forward RUP proof checking (default: true) - this option can incur significant runtime overhead. Effective proof checking relies on first trimming proofs into a format where dependencies are tracked and then checking relevant inferences. Turn this option off if you just want to check theory inferences. - add options to validate proofs offline. It applies to proofs saved when sat.smt.proof is set to a valid file name. - solver.proof.check (bool) check proof logs (default: true) - the option sat.smt.proof_check_rup can be used to control what is checked - solver.proof.save (bool) save proof log into a proof object that can be extracted using (get-proof) (default: false) - experimental: saves a proof log into a term - solver.proof.trim (bool) trim the offline proof and print the trimmed proof to the console - experimental: performs DRUP trimming to reduce the set of hypotheses and inferences relevant to derive the empty clause. - JS support for Arrays, thanks to Walden Yan - More portable memory allocation, thanks to Nuno Lopes (avoid custom handling to calculate memory usage) - clause logging and proofs: many open-ended directions. Many directions and functionality features remain in an open-ended state, subject to fixes, improvements, and contributions. We list a few of them here: - comprehensive efficient self-validators for arithmetic, and other theories - an efficient proof checker when several theory solvers cooperate in a propagation or conflict. The theory combination case is currently delegated to the smt solver. The proper setup for integrating theory lemmas is in principle not complicated, but the implementation requires some changes. - external efficient proof validators (based on certified tool chains) can be integrated over the API. - dampening repeated clauses: A side-effect of conflict resolution is to log theory lemmas. It often happens that the theory lemma becomes the conflict clause, that is then logged as rup. Thus, two clauses are logged. - support for online trim so that proofs generated using clause logging can be used for SPACER - SPACER also would benefit from more robust proof hints for arithmetic lemmas (bounds and implied equalities are sometimes not logged correctly) - integration into axiom profiling through online and/or offline interfaces. - an online interface attaches a callback with a running solver. This is available. - an offline interface saves a clause proof to a file (currently just supported for sat.euf) and then reads the file in a separate process The separate process attaches a callback on inferred clauses. This is currently not available but a relatively small feature. - more detailed proof hints for the legacy solver clause logger. Other than quantifier instantiations, no detailed information is retained for theory clauses. - integration of pre-processing proofs with logging proofs. There is currently no supported bridge to create a end-to-end proof objects. - experimental API for accessing E-graphs. Exposed over Python. This API should be considered temporary and subject to be changed depending on use cases or removed. The functions are `Z3_solver_congruence_root`, `Z3_solver_congruence_next`. Version 4.11.2 ============== - add error handling to fromString method in JavaScript - fix regression in default parameters for CDCL, thanks to Nuno Lopes - fix model evaluation bugs for as-array nested under functions (data-type constructors) - add rewrite simplifications for datatypes with a single constructor - add "Global Guidance" capability to SPACER, thanks to Arie Gurfinkel and Hari Gorvind. The commit logs related to Global Guidance contain detailed information. - change proof logging format for the new core to use SMTLIB commands. The format was so far an extension of DRAT used by SAT solvers, but not well compatible with SMT format that is extensible. The resulting format is a mild extension of SMTLIB with three extra commands assume, learn, del. They track input clauses, generated clauses and deleted clauses. They are optionally augmented by proof hints. Two proof hints are used in the current version: "rup" and "farkas". "rup" is used whent the generated clause can be justified by reverse unit propagation. "farkas" is used when the clause can be justified by a combination of Farkas cutting planes. There is a built-in proof checker for the format. Quantifier instantiations are also tracked as proof hints. Other proof hints are to be added as the feature set is tested and developed. The fallback, buit-in, self-checker uses z3 to check that the generated clause is a consequence. Note that this is generally insufficient as generated clauses are in principle required to only be satisfiability preserving. Proof checking and tranformation operations is overall open ended. The log for the first commit introducing this change contains further information on the format. - fix to re-entrancy bug in user propagator (thanks to Clemens Eisenhofer). - handle _toExpr for quantified formulas in JS bindings @ text @d1 3 a3 1 # $NetBSD: Makefile,v 1.4 2020/05/31 20:47:23 joerg Exp $ @ 1.4 log @Drop Python 2.7 restriction that isn't active anyway. @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.3 2019/11/02 16:16:22 rillig Exp $ d6 1 a6 1 GITHUB_PROJECT= z3 d8 15 a22 1 COMMENT= Python bindings for the Z3 theorem prover / SMT solver d24 1 a24 14 CONFIGURE_ARGS+= --python NO_BUILD= yes PY_PATCHPLIST= yes PYZ3DIR= ${PREFIX}/${PYSITELIB}/z3 INSTALLATION_DIRS+= ${PYZ3DIR} INSTALLATION_DIRS+= ${PYZ3DIR}/lib do-install: ${LN} -s ${LIBDIR}/libz3.so ${DESTDIR}${PYZ3DIR}/lib/libz3.so ${INSTALL_DATA} ${WRKSRC}/build/python/z3/*.py ${DESTDIR}${PYZ3DIR} ${PY_COMPILE_ALL} ${DESTDIR}${PYZ3DIR} .include "../../lang/python/extension.mk" @ 1.3 log @math: align variable assignments pkglint -Wall -F --only aligned -r Manual correction in R/Makefile.extension for the MASTER_SITES continuation line. @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.2 2018/12/23 12:27:34 wiz Exp $ a13 2 PYTHON_VERSIONS_ACCEPTED= 27 @ 1.2 log @py-z3: set GITHUB_PROJECT to fix fetch stage @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.1 2018/03/13 00:36:05 khorben Exp $ d11 2 a12 2 NO_BUILD= yes PY_PATCHPLIST= yes @ 1.1 log @Import a package for the Python bindings for math/z3 @ text @d1 1 a1 1 # $NetBSD: Makefile,v 1.7 2018/02/27 08:34:16 wiz Exp $ d6 1 @