|
4 | 4 | from itertools import chain, combinations, permutations |
5 | 5 |
|
6 | 6 | from bitarray.util import any_and, ones, subset |
| 7 | +from typing import Optional, Set |
7 | 8 |
|
8 | 9 | from .bkcons import deduce_bk_cons, deduce_non_singletons, deduce_recalls, deduce_type_cons |
9 | 10 | from .combine import Combiner |
@@ -173,8 +174,6 @@ def run(self, bkcons): |
173 | 174 | # generate a program |
174 | 175 | with settings.stats.duration('generate'): |
175 | 176 | prog = generator.get_prog() |
176 | | - print("Generated prog: {}".format(prog)) |
177 | | - settings.logger.info("Generated prog: {}".format(prog)) |
178 | 177 | if prog is None: |
179 | 178 | break |
180 | 179 |
|
@@ -203,7 +202,6 @@ def run(self, bkcons): |
203 | 202 | prog_size) |
204 | 203 | else: |
205 | 204 | pos_covered, inconsistent = tester.test_prog(prog) |
206 | | - print(f"pos_covered: {pos_covered}, inconsistent: {inconsistent}") |
207 | 205 | # @CH: can you explain these? |
208 | 206 | skipped, skip_early_neg = False, False |
209 | 207 |
|
@@ -1634,7 +1632,6 @@ def learn_solution(settings): |
1634 | 1632 | tester = Tester(settings) |
1635 | 1633 |
|
1636 | 1634 | bkcons = get_bk_cons(settings, tester) |
1637 | | - print("Have incorporated bk cons.") |
1638 | 1635 | time_so_far = time.time() - t1 |
1639 | 1636 | timeout(settings, popper, (settings, tester, bkcons), timeout_duration=int(settings.timeout - time_so_far), ) |
1640 | 1637 | return settings.solution, settings.best_prog_score, settings.stats |
|
0 commit comments