io.github.uuverifiers:princess-smt-parser_2.11 (maven): Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Keywords: logic|smt|smt-lib|smt-solver|theorem-prover