final(?) documentation fixes

diff --git a/config/doxygen.cfg b/config/doxygen.cfg
index 2ddd1d60914430b48c56ae1f8f27d79238bd8e4f..78014290d6a88c7543071e717dedad1f58579ec9 100644 (file)
--- a/config/doxygen.cfg
+++ b/config/doxygen.cfg
@@ -569,7 +569,7 @@ WARN_LOGFILE           =
 # with spaces.
 
 INPUT                  = $(SRCDIR)/src \
-                        $(BUILDDIR)/src
+                        src
 
 # This tag can be used to specify the character encoding of the source files
 # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is

diff --git a/src/theory/uf/symmetry_breaker.cpp b/src/theory/uf/symmetry_breaker.cpp
index 1855aa59bdfae1164a89656543de876f6ca8fb20..5761ee4f55fa0d54532321eea3d201f00cbe93d3 100644 (file)
--- a/src/theory/uf/symmetry_breaker.cpp
+++ b/src/theory/uf/symmetry_breaker.cpp
@@ -24,7 +24,7 @@
  **   foreach \f$ {c_0, ..., c_n} \in P \f$ do
  **     if \f$ invariant\_by\_permutations(\phi, {c_0, ..., c_n}) \f$ then
  **       T := \f$ select\_terms(\phi, {c_0, ..., c_n}) \f$
- **       cts := \f$ \empty \f$
+ **       cts := \f$ \emptyset \f$
  **       while T != \f$ \empty \wedge |cts| <= n \f$ do
  **         \f$ t := select\_most\_promising\_term(T, \phi) \f$
  **         \f$ T := T \setminus {t} \f$

diff --git a/src/theory/uf/symmetry_breaker.h b/src/theory/uf/symmetry_breaker.h
index ddbd50cbbaa46ae8fa1aa49c40682196f9b70950..2b7b10209ae856eca7905d1fe95a2a133edf1966 100644 (file)
--- a/src/theory/uf/symmetry_breaker.h
+++ b/src/theory/uf/symmetry_breaker.h
@@ -14,8 +14,8 @@
  ** \brief Implementation of algorithm suggested by Deharbe, Fontaine,
  ** Merz, and Paleo, "Exploiting symmetry in SMT problems," CADE 2011
  **
- ** Implementation of algorithm suggested by Deharbe, Fontaine,
- ** Merz, and Paleo, "Exploiting symmetry in SMT problems," CADE 2011.
+ ** Implementation of algorithm suggested by Deharbe, Fontaine, Merz,
+ ** and Paleo, "Exploiting symmetry in SMT problems," CADE 2011.
  **
  ** From the paper:
  **
@@ -24,7 +24,7 @@
  **   foreach \f$ {c_0, ..., c_n} \in P \f$ do
  **     if \f$ invariant\_by\_permutations(\phi, {c_0, ..., c_n}) \f$ then
  **       T := \f$ select\_terms(\phi, {c_0, ..., c_n}) \f$
- **       cts := \f$ \empty \f$
+ **       cts := \f$ \emptyset \f$
  **       while T != \f$ \empty \wedge |cts| <= n \f$ do
  **         \f$ t := select\_most\_promising\_term(T, \phi) \f$
  **         \f$ T := T \setminus {t} \f$