diff --git a/lceb.c b/lceb.c
index 24675f4..d78d449 100644
--- a/lceb.c
+++ b/lceb.c
@@ -40,8 +40,8 @@ int main(ac, av)
     gen_combinations(nops);
     //ncombs=ncombinations(len_ops, nops);
     ncombs=n_combs();
-    print_combs();
-    printf("target=%d\nstacksize=%d\nops_comb=%d\n", target, stacksize, ncombs);
+    //print_combs();
+    printf("target=%d\nstacksize=%d\n", target, stacksize);
     set_target(target);
     //printf("len_ops=%d\nnops=%d\nops_comb=%d\n", len_ops, nops, ncombs);
     //stack=new_stack(stacksize, "Main Stack", 1);
@@ -53,7 +53,7 @@ int main(ac, av)
 
     //print_stack(stack, 1);
     gen_stacks(&inputstack); // printf("sorting stack...\n");
-    print_stacks();
+    //print_stacks();
     //mergesort_stack(stack->stack, 0, stack->last-1);
     //print_stack(stack, 1);
 
@@ -65,11 +65,10 @@ int main(ac, av)
     */
 
     gen_tree(intarray, nops, 0, 0);
-    printf("operators combinations : %d\n", ncombs);
-
     nstacks=n_stacks();
     ntrees=n_trees();
-    printf("nstacks=%d\nncombs=%d\nntrees=%d\n", nstacks, ncombs, ntrees);
+    printf("stacks=%d\noperators combinations=%d\ntrees=%d\n",
+           nstacks, ncombs, ntrees);
     //for (k=0; k<nstacks; ++k) {
     //    stack=nth_stack(k);
     //    printf("%%%%%%%%%%%%%%%%%%\n");
diff --git a/oper.c b/oper.c
index 748c5e7..2acfb55 100644
--- a/oper.c
+++ b/oper.c
@@ -59,7 +59,7 @@ void gen_combinations(nops)
     int len_ops=strlen(ops);
 
     n_combs=n_combine(len_ops, nops);
-    printf("gen: n=%d\n", n_combs);
+    //printf("gen: n=%d\n", n_combs);
     for (i=0; i<n_combs; ++i) {
         combs[ncombs]=strdup(combine(ops, nops, i));
         ncombs++;
diff --git a/stack.c b/stack.c
index 72da2f0..2901a0e 100644
--- a/stack.c
+++ b/stack.c
@@ -74,7 +74,7 @@ STACK *new_stack(size, name, keep)
     }
 
     stack=allstacks+laststack;
-    printf("new_stack %d/%d: address=%p\n", laststack, totalstacks, stack);
+    //printf("new_stack %d/%d: address=%p\n", laststack, totalstacks, stack);
     laststack++;
     //malloc(sizeof (STACK));
     //stack->stack=NULL;
@@ -216,7 +216,7 @@ int gen_stacks(stack)
         //printf("Permute : ");
         //print_stack(stack, 0);
         if (exists) {
-            printf("++++++++++++++++ Adding stack... ");
+            //printf("++++++++++++++++ Adding stack... ");
             new=dup_stack(stack, name);
             //           print_stack(new, 0);
             //keep_stack(new);