{"schema_version":1,"metadata":{"branch":"current","release":"7.9","architecture":"amd64","generated_at":"2026-10-19T21:49:21.442696+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/snapshots/packages/amd64/sqlports-7.55.tgz","source_sha256":"653f4645a3b774e7a077ec166d3a1cd2ce8f577923a96e067bd1c508d9769ceb","package_count":12122,"source_kind":"sqlports"},"package":{"name":"cadical-3.0.1","path":"math/cadical","url":"/packages/current/math/cadical/","comment":"CaDiCaL SAT Solver","homepage":"https://github.com/arminbiere/cadical","maintainer":"Kirill A. Korinsky <kirill@korins.ky>","description":"The goal of the development of CaDiCaL was to obtain a CDCL solver,\nwhich is easy to understand and change, while at the same time not being\nmuch slower than other state-of-the-art CDCL solvers.\n\nOriginally we wanted to also radically simplify the design and internal\ndata structures, but that goal was only achieved partially, at least for\ninstance compared to Lingeling.\n\nHowever, the code is much better documented and CaDiCaL actually became\nin general faster than Lingeling even though it is missing some\npreprocessors (mostly parity and cardinality constraint reasoning),\nwhich would be crucial to solve certain instances.\n","description_source":null,"description_unresolved":[],"package_architecture":"amd64","stem":"cadical","readme":null,"dependencies":[{"path":"devel/gmake","type":"build","package_spec":"","url":"/packages/current/devel/gmake/"}],"reverse_dependencies":{"count":1,"url":"/packages/data/ae/ae5f0a21b6f33ae96631a056d3f7d922d6c8031d5afb091f8c76e3e8a83c4776.json"},"categories":["math"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}