given n : int(..0)
given n : int(1..3,9..)
find a : int(-50..50)
such that a = n+n
with *.param
letting n be -5
letting n be 1
the first given n is ignored. Maybe we want it because of param refinement in several steps, but should be documented and it would be useful to output a warning, just in case it wasn't redefined on purpose.
It may be nice to have series of short videos on how to install and/or how to use with a few small examples. One can create these videos using screen recording utilities (such as recordmydesktop for Ubuntu).
This is purely for enhancement of the documentation and user education and is in no way critical for the functionality.
A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
If you have
with *.param
the first
given nis ignored. Maybe we want it because of param refinement in several steps, but should be documented and it would be useful to output a warning, just in case it wasn't redefined on purpose.If you have