From bcc82fdfc37af965d25ebb853ba2a586add3ec36 Mon Sep 17 00:00:00 2001
From: Paul Tristan Wagner <paultristanwagner@gmail.com>
Date: Thu, 9 Nov 2023 16:26:27 +0100
Subject: [PATCH] Update README.md

---
 README.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 661bc01..2e47151 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,7 @@
 # Satisfiability checking
 
-This project is supposed to be a practice environment to implement algorithms related to satisfiability checking.
+Command line tool for SAT solving, SMT solving in various theories, and other algorithms related to satisfiability checking.
+
 The techniques used here are introduced in the RWTH University
 lecture '[Satisfiability checking](https://ths.rwth-aachen.de/teaching/winter-term-2021-2022/lecture-satisfiability-checking/)'
 by Prof. Dr. Erika Ábrahám.
@@ -72,4 +73,4 @@ Currently, the program supports decimal coefficients which will be handled via f
 An optional objective function can be given to maximize or minimize the value of a linear expression.
 
 <img src="images/simplex-optimal.png" alt="Optimal Simplex example"/> <br>
-<img src="images/simplex-unbounded.png" alt="Unbounded Simplex example"/> <br>
\ No newline at end of file
+<img src="images/simplex-unbounded.png" alt="Unbounded Simplex example"/> <br>