https://github.com/uuverifiers/princess

The Princess Theorem Prover
https://github.com/uuverifiers/princess

logic smt smt-lib smt-solver theorem-prover

Last synced: 5 months ago
JSON representation

The Princess Theorem Prover

• Host: GitHub
• URL: https://github.com/uuverifiers/princess
• Owner: uuverifiers
• License: other
• Created: 2022-05-18T13:33:54.000Z (about 4 years ago)
• Default Branch: master
• Last Pushed: 2026-01-07T20:08:32.000Z (5 months ago)
• Last Synced: 2026-01-14T07:40:58.149Z (5 months ago)
• Topics: logic, smt, smt-lib, smt-solver, theorem-prover
• Language: Scala
• Homepage:
• Size: 52.9 MB
• Stars: 30
• Watchers: 3
• Forks: 9
• Open Issues: 8
• Metadata Files:
  • Readme: README.md
  • License: LICENSE
  • Authors: AUTHORS

Awesome Lists containing this project

README

          
# The Princess Theorem Prover

Princess is a theorem prover (aka SMT Solver) for Presburger

arithmetic with uninterpreted predicates, written entirely in Scala.  Princess can reason

about problems in integer arithmetic, augmented with predicates that

can be axiomatised arbitrarily. Such problems can contain arbitrary

quantifiers to express that some formula is supposed to hold for all

or for some integers. Princess also contains theory modules for, among

others, non-linear arithmetic, rationals, bit-vectors, arrays, heaps,

algebraic data-types, strings.

More information about Princess can be found on the main webpage,

https://philipp.ruemmer.org/princess.shtml