diff --git a/gtsam/inference/BayesTree-inl.h b/gtsam/inference/BayesTree-inl.h
index 6973088bf..2c04ebec9 100644
--- a/gtsam/inference/BayesTree-inl.h
+++ b/gtsam/inference/BayesTree-inl.h
@@ -47,11 +47,11 @@ namespace gtsam {
   void BayesTree<CONDITIONAL>::Clique::assertInvariants() const {
 #ifndef NDEBUG
     // We rely on the keys being sorted
-    FastVector<Index> sortedUniqueKeys(conditional_->begin(), conditional_->end());
-    std::sort(sortedUniqueKeys.begin(), sortedUniqueKeys.end());
-    std::unique(sortedUniqueKeys.begin(), sortedUniqueKeys.end());
-    assert(sortedUniqueKeys.size() == conditional_->size() &&
-        std::equal(sortedUniqueKeys.begin(), sortedUniqueKeys.end(), conditional_->begin()));
+//    FastVector<Index> sortedUniqueKeys(conditional_->begin(), conditional_->end());
+//    std::sort(sortedUniqueKeys.begin(), sortedUniqueKeys.end());
+//    std::unique(sortedUniqueKeys.begin(), sortedUniqueKeys.end());
+//    assert(sortedUniqueKeys.size() == conditional_->size() &&
+//        std::equal(sortedUniqueKeys.begin(), sortedUniqueKeys.end(), conditional_->begin()));
 #endif
   }
 
diff --git a/gtsam/inference/IndexConditional.cpp b/gtsam/inference/IndexConditional.cpp
index a7e4d0890..532e79248 100644
--- a/gtsam/inference/IndexConditional.cpp
+++ b/gtsam/inference/IndexConditional.cpp
@@ -36,8 +36,8 @@ namespace gtsam {
     FastSet<Index> uniquesorted(beginFrontals(), endFrontals());
     assert(uniquesorted.size() == nrFrontals() && std::equal(uniquesorted.begin(), uniquesorted.end(), beginFrontals()));
     // Check that separator keys are less than parent keys
-    BOOST_FOREACH(Index j, frontals()) {
-      assert(find_if(beginParents(), endParents(), _1 < j) == endParents()); }
+    //BOOST_FOREACH(Index j, frontals()) {
+    //  assert(find_if(beginParents(), endParents(), _1 < j) == endParents()); }
 #endif
   }