diff --git a/cpp/GaussianFactorGraph.cpp b/cpp/GaussianFactorGraph.cpp
index db5868070..fbdd0ac01 100644
--- a/cpp/GaussianFactorGraph.cpp
+++ b/cpp/GaussianFactorGraph.cpp
@@ -19,10 +19,6 @@
 #include "inference-inl.h"
 #include "iterative.h"
 
-#ifdef USE_SPQR
-#include <spqr.hpp>;
-#endif
-
 using namespace std;
 using namespace gtsam;
 using namespace boost::assign;
@@ -194,11 +190,6 @@ GaussianFactorGraph::eliminate(const Ordering& ordering, bool old)
 /* ************************************************************************* */
 VectorConfig GaussianFactorGraph::optimize(const Ordering& ordering, bool old)
 {
-	bool verbose = false;
-	if (verbose)
-		BOOST_FOREACH(const sharedFactor& factor,factors_)
-			factor->get_model()->print("Starting model");
-
 	// eliminate all nodes in the given ordering -> chordal Bayes net
 	GaussianBayesNet chordalBayesNet = eliminate(ordering, old);
 
diff --git a/spqr_mini/spqr_front.cpp b/spqr_mini/spqr_front.cpp
index 1bd16ed67..63da97fe0 100644
--- a/spqr_mini/spqr_front.cpp
+++ b/spqr_mini/spqr_front.cpp
@@ -309,16 +309,6 @@ template <typename Entry> Int spqr_front
     cholmod_common *cc  // for cc->hypotenuse function
 )
 {
-//		std::cout << "**************spqr_front dumping started****************" << std::endl;
-//		std::cout << "m: " << m << " n: " << n << " npiv: " << npiv << " tol: " << tol
-//				<< " ntol: " << ntol << " fchunk: " << fchunk << std::endl;
-//		for (int i=0; i<m; i++) {
-//			for (int j=0; j<n; j++)
-//				std::cout << F[j*m+i] << "\t";
-//			std::cout << std::endl;
-//		}
-//		std::cout << "**************spqr_front duming finished****************" << std::endl;
-
     Entry tau ;
     double wk ;
     Entry *V ;