diff --git a/src/Interpreters/InterpreterSelectQuery.cpp b/src/Interpreters/InterpreterSelectQuery.cpp
index 7f37bb6cc7e..365ca4699b0 100644
--- a/src/Interpreters/InterpreterSelectQuery.cpp
+++ b/src/Interpreters/InterpreterSelectQuery.cpp
@@ -2097,7 +2097,6 @@ void InterpreterSelectQuery::executeOrderOptimized(QueryPipeline & pipeline, Inp
     const Settings & settings = context->getSettingsRef();
 
     bool need_finish_sorting = (input_sorting_info->order_key_prefix_descr.size() < output_order_descr.size());
-    std::cerr << "\n Need finish: " << need_finish_sorting << "\n";
     if (pipeline.getNumStreams() > 1)
     {
         UInt64 limit_for_merging = (need_finish_sorting ? 0 : limit);
diff --git a/src/Processors/ISource.cpp b/src/Processors/ISource.cpp
index e2093c99223..7c620a98a74 100644
--- a/src/Processors/ISource.cpp
+++ b/src/Processors/ISource.cpp
@@ -58,7 +58,7 @@ void ISource::work()
     }
 //    {
 //        current_chunk = std::current_exception();
-//        ready_to_push = true;
+//        has_input = true;
 //        got_exception = true;
 //    }
 }
diff --git a/src/Processors/Transforms/FinishSortingTransform.cpp b/src/Processors/Transforms/FinishSortingTransform.cpp
index 6df795de314..b58b008339d 100644
--- a/src/Processors/Transforms/FinishSortingTransform.cpp
+++ b/src/Processors/Transforms/FinishSortingTransform.cpp
@@ -27,7 +27,6 @@ FinishSortingTransform::FinishSortingTransform(
     : SortingTransform(header, description_to_sort_, max_merged_block_size_, limit_)
     , description_sorted(description_sorted_)
 {
-    std::cerr << "Finishing created.\n";
     const auto & sample = inputs.front().getHeader();
 
     /// Replace column names to column position in description_sorted.
@@ -49,8 +48,6 @@ static bool less(const Columns & lhs, const Columns & rhs, size_t i, size_t j, c
 {
     for (const auto & elem : descr)
     {
-        std::cerr << elem.column_name << ":" << elem.column_number << " ";
-
         size_t ind = elem.column_number;
         int res = elem.direction * lhs[ind]->compareAt(i, j, *rhs[ind], elem.nulls_direction);
         if (res < 0)
@@ -58,7 +55,6 @@ static bool less(const Columns & lhs, const Columns & rhs, size_t i, size_t j, c
         else if (res > 0)
             return false;
     }
-    std::cerr << " ----> equal!";
     return false;
 }