README update.

README.md

@@ -2,31 +2,35 @@
 
 [![build status](https://github.com/elsoroka/BooleanSatisfiability.jl/actions/workflows/ci.yml/badge.svg?branch=main)](https://github.com/elsoroka/BooleanSatisfiability.jl/actions/workflows/CI.yml?query=branch%3Amain) [![docs](https://github.com/elsoroka/BooleanSatisfiability.jl/actions/workflows/docs.yml/badge.svg)](https://elsoroka.github.io/BooleanSatisfiability.jl/) [![codecov](https://codecov.io/gh/elsoroka/BooleanSatisfiability.jl/branch/main/graph/badge.svg?token=84BIREQL46)](https://codecov.io/gh/elsoroka/BooleanSatisfiability.jl)
 
-BooleanSatisfiability.jl is a package for representing Boolean satisfiability (SAT) and selected other satisfiability modulo theories (SMT) problems in Julia. This package provides a simple front-end interface to common SMT solvers, including full support for vector-valued and matrix-valued expressions.
+BooleanSatisfiability.jl is a package for representing satisfiability modulo theories (SMT) problems in Julia. This package provides a simple front-end interface to common SMT solvers, including full support for vector-valued and matrix-valued expressions. Currently, the theories of propositional logic, Integers, Reals and fixed-size BitVectors are supported. We will eventually add support for all [SMT-LIB standard theories](http://smtlib.cs.uiowa.edu/theories.shtml).
 
-* Easily specify single-valued or vector-valued Boolean SAT, integer or real-valued SMT problems using Julia's built-in broadcasting capabilities.
-* Generate files in [SMT2](http://www.smtlib.org/) format.
-* BooleanSatisfiability.jl calls [Z3](https://www.microsoft.com/en-us/research/publication/z3-an-efficient-smt-solver/) as the back-end solver and interprets the result.
+What you can do with this package:
+* Easily specify single-valued or vector-valued SMT expressions using Julia's built-in broadcasting capabilities.
+* Generate files in the [SMT-LIB](http://www.smtlib.org/) specification language.
+* Interact with any solver that follows the SMT-LIB standard.
 
-## Example
-
-Solving the single-valued problem **(x ∧ y) ∨ (¬x ∧ y)**
-```
-x = Bool("x")
-y = Bool("y")
-expr = (x ∧ y) ∨ (¬x ∧ y)
-status = sat!(expr)
-println("x = $(value(x)), y = $(value(y))”)
-```
+## Examples
 
 Solving the vector-valued problem **(x1 ∧ y1) ∨ (¬x1 ∧ y1) ∧ ... ∧ (xn ∧ yn) ∨ (¬xn ∧ yn)**
 ```
 x = Bool(n, "x")
 y = Bool(n, "y")
 expr = (x .∧ y) .∨ (¬x .∧ y)
-status = sat!(expr)
+status = sat!(expr, solver=Z3())
 println("x = $(value(x)), y = $(value(y))”)
 ```
 
+Proving a bitwise version of de Morgan's law.
+In this example we want to show there is NO possible value of x and y such that de Morgan's bitwise law doesn't hold.
+```
+@satvariable(x, BitVector, 64)
+@satvariable(y, BitVector, 64)
+
+expr = not((~x & ~y) == ~(x | y))
+
+status = sat!(expr, solver=Z3())
+println(status) # if status is UNSAT we proved it.
+```
+
 ## Development status
 Working on a first release! Follow for updates.