4.0.0 uuverifiers princess-smt-parser_2.13 jar Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories. https://philipp.ruemmer.org/princess.shtml 2021-11-15 BSD-3-Clause https://opensource.org/licenses/BSD-3-Clause repo Princess-smt-parser uuverifiers https://philipp.ruemmer.org/princess.shtml https://github.com/uuverifiers/princess scm:git@github.com/uuverifiers/princess.git p_ruemmer Philipp Ruemmer ph_r@gmx.net https://philipp.ruemmer.org zafer.esen Zafer Esen zafer.esen@it.uu.se https://katalog.uu.se/empinfo/?id=N18-2424 angelo.brillout Angelo Brillout angelo.brillout@gmail.com https://ch.linkedin.com/in/angelo-brillout-2942bb7 peter.backeman Peter Backeman peter@backeman.se http://www.es.mdh.se/staff/4393-Peter__Backeman peter.baumgartner Peter Baumgartner Peter.Baumgartner@data61.csiro.au http://users.cecs.anu.edu.au/~baumgart/ org.scala-lang scala-library 2.13.4